paper-with-me

Papers

Implicit Compression Regularization: Concise Reasoning via Internal Shorter Distributions in RL Post-Training

2026-05-08 · Chen Wang, Hexuan Deng, Yining Zhang, Yuchen Zhang, Jionghao Bai, Zhaochun Li, Ge Lan, Yue Wang 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 \emph{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.

📄 PDF Abstract BibTeX arXiv:2605.07316

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Efficient Reasoning via Thought-Training and Thought-Free Inference

2025-11-05 · Canhui Wu, Qiong Cao, Chao Xue, Wei Xi 외 arxiv

Recent advances in large language models (LLMs) have leveraged explicit Chain-of-Thought (CoT) prompting to improve reasoning accuracy. However, most existing methods primarily focus on compressing verbose reasoning outp…

ConCISE: Confidence-guided Compression in Step-by-step Efficient Reasoning

2025-05-08 · Ziqing Qiao, Yongheng Deng, Jiali Zeng, Dong Wang 외

Large Reasoning Models (LRMs) perform strongly in complex reasoning tasks via Chain-of-Thought (CoT) prompting, but often suffer from verbose outputs caused by redundant content, increasing computational overhead, and de…

Efficient Reasoning via Thought Compression for Language Segmentation

2026-04-02 · Qing Zhou, Shiyu Zhang, Yuyu Jia, Junyu Gao 외 arxiv

Chain-of-thought (CoT) reasoning has significantly improved the performance of large multimodal models in language-guided segmentation, yet its prohibitive computational cost, stemming from generating verbose rationales,…

CNeRV: Content-adaptive Neural Representation for Visual Data

2022-11-18 · Hao Chen, Matt Gwilliam, Bo He, Ser-Nam Lim 외

Compression and reconstruction of visual data have been widely studied in the computer vision community, even before the popularization of deep learning. More recently, some have used deep learning to improve or refine e…

Data CompressionDecoder

Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning

2025-08-04 · Taihang Zhen, Jialiang Hong, Kai Chen, Guang Yang 외 arxiv

Large reasoning models (LRMs) often exhibit overthinking, producing verbose Chain-of-Thought (CoT) traces that increase inference cost and obscure the underlying reasoning process. Existing CoT compression methods mainly…

Reinforcement LearningSemantic Similarity