paper-with-me

Papers

Reasoning Cache: Continual Improvement Over Long Horizons via Short-Horizon RL

2026-02-03 · Ian Wu, Yuxiao Qu, Amrith Setlur, Aviral Kumar arxiv

Large Language Models (LLMs) that can continually improve beyond their training budgets are able to solve increasingly difficult problems by adapting at test time, a property we refer to as extrapolation. However, standard reinforcement learning (RL) operates over fixed problem distributions and training budgets, which limits extrapolation amidst distribution shift at test time. To address this, we introduce RC, an iterative decoding algorithm that replaces standard autoregressive decoding during both training and inference. RC exploits an asymmetry between the response generation and summarization capabilities of LLMs to construct reasoning chains that consistently improve across iterations. Models trained to use RC can extrapolate and continually improve over reasoning horizons more than an order of magnitude longer than those seen during training. Empirically, training a 4B model with RC using a 16k-token training budget improves performance on HMMT 2025 from 40% to nearly 70% with 0.5m tokens at test time, outperforming both comparably sized models and many larger reasoning LLMs. Finally, we also show that models trained with RC can more effectively leverage existing scaffolds to further scale test-time performance, due to the improved summary-conditioned generation abilities learned through training.

📄 PDF Abstract BibTeX arXiv:2602.03773

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement LearningResponse Generation

Similar Papers 제목 키워드 기반

Retrospective Sparse Attention for Efficient Long-Context Generation

2025-08-12 · Seonghwan Choi, Beomseok Kang, Dongwon Jo, Jae-Joon Kim arxiv

Large Language Models (LLMs) are increasingly deployed in long-context tasks such as reasoning, code generation, and multi-turn dialogue. However, inference over extended contexts is bottlenecked by the Key-Value (KV) ca…

Code Generation

LongFlow: Efficient KV Cache Compression for Reasoning Models

2026-03-12 · Yi Su, Zhenxu Tian, Dan Qiao, Yuechi Zhou 외 arxiv

Recent reasoning models such as OpenAI-o1 and DeepSeek-R1 have shown strong performance on complex tasks including mathematical reasoning and code generation. However, this performance gain comes with substantially longe…

Mathematical ReasoningCode Generation

ReasonCache: Accelerating Large Reasoning Model Serving through KV Cache Sharing

2025-07-29 · Kaiwen Chen, Xin Tan, Minchen Yu, Jingzong Li 외 arxiv

Large Reasoning Models (LRMs) are becoming integral to many AI inference systems, enhancing their capabilities with advanced reasoning. However, deploying these models in production environments presents a significant Qo…

Collaborative Filtering

Training Large Reasoning Models Efficiently via Progressive Thought Encoding

2026-02-18 · Zeliang Zhang, Xiaodong Liu, Hao Cheng, Hao Sun 외 arxiv

Large reasoning models (LRMs) excel on complex problems but face a critical barrier to efficiency: reinforcement learning (RL) training requires long rollouts for outcome-based rewards, where autoregressive decoding domi…

parameter-efficient fine-tuningReinforcement Learning

TaDA: Training-free recipe for Decoding with Adaptive KV Cache Compression and Mean-centering

2025-06-05 · Vinay Joshi, Pratik Prabhanjan Brahma, Zicheng Liu, Emad Barsoum

The key-value (KV) cache in transformer models is a critical component for efficient decoding or inference, yet its memory demands scale poorly with sequence length, posing a major challenge for scalable deployment of la…

Quantization