Alternatives and similar repositories for UltraGist

Users that are interested in UltraGist are comparing it to the libraries listed below

• hkust-nlp / mstar
  [ICML 2025] M-STAR (Multimodal Self-Evolving TrAining for Reasoning) Project. Diving into Self-Evolving Training for Multimodal Reasoning
  ☆70Updated 6 months ago
• October2001 / ProLong
  [ACL 2024 (Oral)] A Prospector of Long-Dependency Data for Large Language Models
  ☆58Updated last year
• MileBench / MileBench
  This repo contains evaluation code for the paper "MileBench: Benchmarking MLLMs in Long Context"
  ☆36Updated last year
• hkust-nlp / Laser
  [ICLR2026] Laser: Learn to Reason Efficiently with Adaptive Length-based Reward Shaping
  ☆62Updated 8 months ago
• Shwai-He / MEO
  The source code of "Merging Experts into One: Improving Computational Efficiency of Mixture of Experts (EMNLP 2023)":
  ☆44Updated last year
• GAIR-NLP / ReasonEval
  [AAAI 2025 oral] Evaluating Mathematical Reasoning Beyond Accuracy
  ☆77Updated 3 months ago
• yyDing1 / ScaleQuest
  [ACL 2025] We introduce ScaleQuest, a scalable, novel and cost-effective data synthesis method to unleash the reasoning capability of LLM…
  ☆68Updated last year
• princeton-nlp / CEPE
  [ACL 2024] Long-Context Language Modeling with Parallel Encodings
  ☆168Updated last year
• GAIR-NLP / weak-to-strong-reasoning
  ☆58Updated last year
• OpenMOSS / Say-I-Dont-Know
  [ICML'2024] Can AI Assistants Know What They Don't Know?
  ☆85Updated last year
• multimodal-art-projection / KORGym
  ☆53Updated 8 months ago
• TingchenFu / MathIF
  instruction-following benchmark for large reasoning models
  ☆44Updated 5 months ago
• SparkJiao / dpo-trajectory-reasoning
  [EMNLP 2024] Source code for the paper "Learning Planning-based Reasoning with Trajectory Collection and Process Rewards Synthesizing".
  ☆83Updated last year
• princeton-nlp / QuRating
  [ICML 2024] Selecting High-Quality Data for Training Language Models
  ☆200Updated last month
• Zanette-Labs / SpeculativeRejection
  [NeurIPS 2024] Fast Best-of-N Decoding via Speculative Rejection
  ☆55Updated last year
• hahahawu / Long-to-Short-via-Model-Merging
  Model merging is a highly efficient approach for long-to-short reasoning.
  ☆98Updated 3 months ago
• FreedomIntelligence / OVM
  ☆72Updated last year
• PKU-ML / LongPPL
  Code for ICLR 2025 Paper "What is Wrong with Perplexity for Long-context Language Modeling?"
  ☆110Updated 3 months ago
• KbsdJames / Omni-MATH
  The official repository of the Omni-MATH benchmark.
  ☆93Updated last year
• princeton-pli / LongProc
  LongProc: Benchmarking Long-Context Language Models on Long Procedural Generation
  ☆33Updated 3 months ago
• OpenLMLab / LongWanjuan
  Towards Systematic Measurement for Long Text Quality
  ☆37Updated last year
• THU-KEG / RM-Bench
  [ICLR 25 Oral] RM-Bench: Benchmarking Reward Models of Language Models with Subtlety and Style
  ☆73Updated 6 months ago
• mozhu621 / LongGenBench
  ☆29Updated 3 months ago
• RM-R1-UIUC / RM-R1
  RM-R1: Unleashing the Reasoning Potential of Reward Models
  ☆156Updated 7 months ago
• RUCAIBox / JiuZhang3.0
  The code and data for the paper JiuZhang3.0
  ☆49Updated last year
• yegcjs / mixinglaws
  ☆109Updated 6 months ago
• RLHFlow / RAFT
  This is an official implementation of the Reward rAnked Fine-Tuning Algorithm (RAFT), also known as iterative best-of-n fine-tuning or re…
  ☆39Updated last year
• Kwai-Klear / RLEP
  RL with Experience Replay
  ☆54Updated 6 months ago
• YujieLu10 / Seeker
  ☆11Updated last year
• HKUNLP / STRING
  [ICLR'25] Data and code for our paper "Why Does the Effective Context Length of LLMs Fall Short?"
  ☆78Updated last year