ExpThink: Experience-Guided Reinforcement Learning for Adaptive Chain-of-Thought Compression
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Large reasoning models (LRMs) achieve strong performance via extended chain-of-thought (CoT) reasoning, yet suffer from excessive token consumption and high inference latency. Existing reinforcement learning (RL) approaches for CoT compression rely on uniform, static length penalties that neglect model capability dynamics and problem-level difficulty variation. We propose ExpThinkxspace, an RL framework that addresses both dimensions through two complementary mechanisms. First, experience-guided reward shaping tracks the shortest correct solution found so far for each problem and applies a three-tier reward: full credit for concise correct responses, discounted credit for verbose correct ones, and zero for incorrect ones. The threshold tightens automatically with model improvement, forming a self-evolving curriculum that requires no manual scheduling. Second, difficulty-adaptive advantage replaces standard deviation normalization with correct-count normalization, yielding monotonically difficulty-scaled gradients that amplify learning on hard problems to preserve accuracy while suppressing gradients on easy ones to encourage brevity. Together, these mechanisms enforce an accuracy-first, compression-second training objective. Experiments on multiple mathematical reasoning benchmarks demonstrate that ExpThinkxspace reduces average response length by up to 77% while simultaneously improving accuracy, achieving up to 3× higher accuracy-efficiency ratio (accuracy divided by average token count) than the vanilla baseline and outperforming existing RL-based compression methods on both metrics.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 32 of its 52 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
32 of 52 references.
Closest ancestors · 15
Same direction, newest first
- 2026Stepwise Penalization for Length-Efficient Chain-of-Thought Reasoning27 Feb
- 2026Compress the Easy, Explore the Hard: Difficulty-Aware Entropy Regularization for Efficient LLM Reasoning26 Feb
- 2026Self-Compression of Chain-of-Thought via Multi-Agent Reinforcement Learning29 Jan
- 2025Leash: Adaptive Length Penalty and Reward Shaping for Efficient Large Reasoning Model25 Dec
- 2025Reinforcement Learning for Chain of Thought Compression with One-Domain-to-All Generalization19 Dec
- 2025Efficient Reasoning via Thought-Training and Thought-Free Inference5 Nov
- 2025DART: Difficulty-Adaptive Reasoning Truncation for Efficient Large Language Models3 Nov
- 2025DLER: Doing Length pEnalty Right - Incentivizing More Intelligence per Token via Reinforcement Learning16 Oct
- 2025Your Models Have Thought Enough: Training Large Reasoning Models to Stop Overthinking27 Sep
- 2025Optimizing Length Compression in Large Reasoning Models17 Jun
- 2025Learn to Reason Efficiently with Adaptive Length-based Reward Shaping21 May
- 2025Learning When to Think: Shaping Adaptive Reasoning in R1-Style Models via Multi-Stage RL16 May
3 more
Other references · 17
- 2025Qwen3 Technical Reportcited by 8,195
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
- 2025Understanding R1-Zero-Like Training: A Critical Perspectivecited by 1,276
- 2024OpenAI o1 System Cardcited by 1,220
- 2025XRPO: Pushing the limits of GRPO with Targeted Exploration and Exploitationcited by 17
- 2026WS-GRPO: Weakly-Supervised Group-Relative Policy Optimization for Rollout-Efficient Reasoningcited by 12
- 2025STEP: Success-Rate-Aware Trajectory-Efficient Policy Optimizationcited by 11
- 2026F-GRPO: Don't Let Your Policy Learn the Obvious and Forget the Rarecited by 10
- 2026Learning to Hint for Reinforcement Learningcited by 9
- 2026Buffer Matters: Unleashing the Power of Off-Policy Reinforcement Learning in Large Language Model Reasoningcited by 8
5 more
- 2026Tackling Length Inflation Without Trade-offs: Group Relative Reward Rescaling for Reinforcement Learningcited by 7
- 2025LANPO: Bootstrapping Language and Numerical Feedback for Reinforcement Learning in LLMscited by 5
- 2026RPO:Reinforcement Fine-Tuning with Partial Reasoning Optimizationcited by 2
- 2026Thinking Seeds: Leveraging Historical Diversity for Position-Aware RL in LLMscited by 1
- 2026Long Chain-of-Thought Compression via Fine-Grained Group Policy Optimizationcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026HMPO: Hybrid Median-length Policy Optimization for Chain-of-Thought Compression
- 2026Towards Efficient Large Language Reasoning Models via Extreme-Ratio Chain-of-Thought Compression
- 2026Selective Latent Thinking: Adaptive Compression of LLM Reasoning Chains
- 2026ConMax: Confidence-Maximizing Compression for Efficient Chain-of-Thought Reasoning
- 2025Demystifying Long Chain-of-Thought Reasoning in LLMs
- 2025DeepCompress: A Dual Reward Strategy for Dynamically Exploring and Compressing Reasoning Chains
- 2025Not All Thoughts are Generated Equal: Efficient LLM Reasoning via Multi-Turn Reinforcement Learning
- 2026Think Less, Know More: State-Aware Reasoning Compression with Knowledge Guidance for Efficient Reasoning