Giving Credit Where It's Due: Redundancy-Aware Learning for Efficient Reasoning
On the map: LLM reasoning → Test-time compute and efficient thinking also fits: Prompting and chain-of-thought reasoning
Abstract (arXiv)
Large reasoning models can produce correct yet unnecessarily long reasoning traces. Existing methods improve reasoning efficiency with trajectory-level objectives or local token- and step-level signals, but rarely model inter-step semantic dependencies. This limits their ability to distinguish redundant steps from those that support later deductions, making it harder to shorten reasoning without sacrificing accuracy. We introduce RECAP (REdundancy-aware Credit Assignment via Propagation), which addresses this limitation by assigning credit where it is due based on both a step's downstream role in the reasoning structure and its contribution to solving the problem correctly. We define structural responsibility to capture the step's downstream role by measuring how strongly later reasoning depends on it, using credit propagated backward from the final-answer node through an outcome-independent, LLM-annotated semantic dependency graph. However, a step can have high structural responsibility yet steer the reasoning away from the correct solution. RECAP therefore introduces step efficacy to measure answer-directed progress through changes in gold-answer log-likelihood as each step is added. Together, these signals reshape rollout-level GRPO advantages into step-specific updates. RECAP requires neither a separately trained process reward model nor preconstructed concise trajectories. Across two 7B models and four mathematical reasoning benchmarks, RECAP improves the accuracy-efficiency trade-off. On Qwen2.5-Math-7B, it improves pass@1 by 2.0-3.7 percentage points while reducing reasoning tokens by 8%-31% relative to GRPO across all four benchmarks. Analysis suggests these savings reflect fewer reasoning operations and less dead-end reasoning, rather than more compact expression.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 13 of its 45 references that are in the map. First posted on arXiv 22 Sep 2026.
Builds on
13 of 45 references.
Closest ancestors · 4
Same direction, newest first
- 2026Stepwise Penalization for Length-Efficient Chain-of-Thought Reasoning27 Feb
- 2025Scaling Latent Reasoning via Looped Language Models29 Oct
- 2025Don't Overthink It: A Survey of Efficient R1-style Large Reasoning Models4 Aug
- 2025ConciseHint: Boosting Efficient Reasoning via Continuous Concise Hints during Generation23 Jun
Other references · 9
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,330
- 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,810
- 2024OpenAI o1 System Cardcited by 1,244
- 2024Qwen2.5-Math Technical Report: Toward Mathematical Expert Model via Self-Improvementcited by 1,090
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
- 2026Think Dense, Not Long: Dynamic Decoupled Conditional Advantage for Efficient Reasoningcited by 5
- 2026GraphPO: Graph-based Policy Optimization for Reasoning Modelscited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026How Much Thinking is Enough? Quantifying and Understanding Redundancy in LLM Reasoning
- 2026APR: Penalizing Structural Redundancy in Large Reasoning Models via Anchor-based Process Rewards
- 2026Penelope: Localized Latent Recurrence for Efficient Structured Reasoning
- 2026Step-GRPO: Internalizing Dynamic Early Exit for Efficient Reasoning
- 2026Stop When Reasoning Converges: Semantic-Preserving Early Exit for Reasoning Models
- 2026Know When to Stop: Segment-Level Credit Assignment for Reducing Overthinking
- 2025Think Clearly: Improving Reasoning via Redundant Token Pruning
- 2025ReFIne: A Framework for Trustworthy Large Reasoning Models with Reliability, Faithfulness, and Interpretability