Implicit Compression Regularization: Concise Reasoning via Internal Shorter Distributions in RL Post-Training
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Reinforcement learning with verifiable rewards improves LLM reasoning but often induces overthinking, where models generate unnecessarily long reasoning traces. Existing methods mainly rely on length penalties or early-exit strategies; however, the former may degrade accuracy and induce underthinking, whereas the latter assumes that substantial portions of reasoning traces can be safely truncated. To obtain a compression signal without these limitations, we revisit the training dynamics of existing compression methods. We observe that the length--accuracy correlation is initially negative but continually increases during compression, indicating that shorter responses are initially more likely to be correct but gradually lose this property as the policy moves toward underthinking. Based on this observation, we formalize overthinking: a negative correlation indicates an overthinking regime, while a positive one indicates underthinking. When overthinking, the shortest correct responses are shorter than the group-average response length in expectation, making them natural compression targets already present in on-policy rollouts. We therefore propose Implicit Compression Regularization (ICR), an on-policy regularization method whose compression signal comes from a virtual shorter distribution induced by the shortest correct responses in rollout groups, guiding the policy toward concise yet correct trajectories. Training dynamics show that ICR maintains a better length--accuracy correlation during compression, indicating that short responses remain better aligned with correctness instead of drifting toward underthinking. Experiments on three reasoning backbones and multiple mathematical and knowledge-intensive benchmarks show that ICR consistently shortens responses while preserving or improving accuracy, achieving a stronger accuracy--length Pareto frontier.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 31 of its 36 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
31 of 36 references.
Closest ancestors · 16
Same direction, newest first
- 2026SmartThinker: Progressive Chain-of-Thought Length Calibration for Efficient Large Language Model Reasoning9 Mar
- 2026Compress the Easy, Explore the Hard: Difficulty-Aware Entropy Regularization for Efficient LLM Reasoning26 Feb
- 2026On the Optimal Reasoning Length for RL-Trained Language Models10 Feb
- 2025DeepCompress: A Dual Reward Strategy for Dynamically Exploring and Compressing Reasoning Chains31 Oct
- 2025Explore Briefly, Then Decide: Mitigating LLM Overthinking via Cumulative Entropy Regulation2 Oct
- 2025Reasoning on a Budget: A Survey of Adaptive and Controllable Test-Time Compute in LLMs2 Jul
- 2025Optimizing Length Compression in Large Reasoning Models17 Jun
- 2025Thinking Fast and Right: Balancing Accuracy and Reasoning Length with Adaptive Rewards23 May
- 2025The First Impression Problem: Internal Bias Triggers Overthinking in Reasoning Models22 May
- 2025Learn to Reason Efficiently with Adaptive Length-based Reward Shaping21 May
- 2025Between Underthinking and Overthinking: An Empirical Study of Reasoning Length and correctness in LLMs30 Apr
- 2025ShorterBetter: Guiding Reasoning Models to Find Optimal Inference Length for Efficient Reasoning30 Apr
4 more
- 2025Missing Premise exacerbates Overthinking: Are Reasoning Models losing Critical Thinking Skill?9 Apr
- 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Models20 Mar
- 2025The Danger of Overthinking: Examining the Reasoning-Action Dilemma in Agentic Tasks12 Feb
- 2024Do NOT Think That Much for 2+3=? On the Overthinking of o1-Like LLMs30 Dec
Other references · 15
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025Qwen3 Technical Reportcited by 8,820
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Let's Verify Step by Stepcited by 3,789
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2025Kimi k1.5: Scaling Reinforcement Learning with LLMscited by 1,210
- 2025Does Reinforcement Learning Really Incentivize Reasoning Capacity in LLMs Beyond the Base Model?cited by 982
- 2025Chain of Draft: Thinking Faster by Writing Lesscited by 297
- 2025MathArena: Evaluating LLMs on Uncontaminated Math Competitionscited by 297
- 2025Training Language Models to Reason Efficientlycited by 247
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Distilled Reinforcement Learning for LLM Post-trainingcited by 8
- 2026Distilled Reinforcement Learning for LLM Post-training19 Jul 2026
Similar, not cited
Close in wording, no citation either way
- 2026ConMax: Confidence-Maximizing Compression for Efficient Chain-of-Thought Reasoning
- 2025Think Silently, Think Fast: Dynamic Latent Compression of LLM Reasoning Chains
- 2025Reinforcement Learning for Chain of Thought Compression with One-Domain-to-All Generalization
- 2026Selective Latent Thinking: Adaptive Compression of LLM Reasoning Chains
- 2025Think Right: Learning to Mitigate Under-Over Thinking via Adaptive, Attentive Compression
- 2025Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning
- 2025Making Slow Thinking Faster: Compressing LLM Chain-of-Thought via Step Entropy
- 2025SmartThinker: Learning to Compress and Preserve Reasoning by Step-Level Length Control