← Back to all news
arXiv Machine Learning By Yuqing Zhou, Hong Wang, Manqing Mao, Zhuoer Wang, Samson Koelle, Jie Yuan, Yanjun Lin, James Feng, Nikki Lijing Kuang, Ziwei Zhu, Wei Niu

Giving Credit Where It's Due: Redundancy-Aware Learning for Efficient Reasoning

Read the original on arXiv Machine Learning →

The paper introduces RECAP, a redundancy-aware credit assignment method that improves reasoning efficiency in large language models by assigning credit to each reasoning step based on its downstream role and contribution to the correct answer. RECAP uses a semantic dependency graph to measure structural responsibility and evaluates step efficacy via changes in gold-answer log-likelihood, enabling step-specific updates without requiring a separate reward model or concise trajectories. Experiments on two 7B models across four mathematical reasoning benchmarks show that RECAP enhances the accuracy-efficiency trade-off, boosting pass@1 by 2.0–3.7 percentage points while cutting reasoning tokens by 8–31% compared to GRPO.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Jun 9

Correct Is Not Enough: Training Reasoning Planners with Executor-Grounded Rewards

arXiv:2605. 03862v4 Announce Type: replace Abstract: Reinforcement learning with verifiable rewards has become a common way to improve explicit reasoning in large language models, but final-answer correctness alone does not reveal whether the reasoning trace is faithful, reliable, or useful to the model that consumes it.

By Tianyang Han, Hengyu Shi, Junjie Hu, Xu Yang, Zhiling Wang, Junhao Su
llmsreinforcement-learningbenchmarks
More like this →
arXiv Machine Learning
Jun 10

How Does Reasoning Flow? Tracing Attention-Induced Information Flow for Targeted RL in LLMs

arXiv:2606. 10646v1 Announce Type: new Abstract: Token-level credit assignment remains a key obstacle for reinforcement learning (RL) in large language models (LLMs), where RL recipes typically treat all tokens equally, failing to distinguish decisive reasoning steps from routine formatting or fluent filler.

By Zhichen Dong, Yang Li, Yuhan Sun, Weixun Wang, Yijia Luo, Zinian Peng, Taiheng Ye, Chao Yang, Wenbo Su, Yu Cheng, Bo Zheng, Junchi Yan
llmsreinforcement-learningefficiency
More like this →
arXiv AI
Jun 30

Reconsidering Overthinking: Penalizing Internal and External Redundancy in CoT Reasoning

arXiv:2508. 02178v3 Announce Type: replace Abstract: Large reasoning models (LRMs) often exhibit overthinking, producing verbose Chain-of-Thought (CoT) traces that increase inference cost and obscure the underlying reasoning process.

By Taihang Zhen, Jialiang Hong, Kai Chen, Guang Yang, Junlan Feng, Wenpeng Zhu, Jing Huo, Yang Gao, Depeng Wang, Haitao Wan, Xi Yang, Fanyu Meng, Yuyao Zhang, Ji Qi, Xiangyu Zhou
reinforcement-learning
More like this →
arXiv Computation and Language
6d ago

Enhancing Language Model Reasoning with Structured Multi-Level Modeling

The paper introduces Multi-Level Reasoning (MLR), a two-level stochastic framework that separates long chain-of-thought generation into a high-level planner producing structured step descriptors and a low-level executor generating detailed reasoning. MLR replaces single-policy reinforcement learning with an iterative Step‑DPO preference optimization that uses Twisted Sequential Monte Carlo for scalable, stepwise supervision, improving training stability and accuracy. Experiments on math, science, and logic benchmarks show that MLR outperforms both supervised fine‑tuning and strong RL baselines while maintaining robustness over extended reasoning horizons.

By Siheng Xiong, Ali Payani, Faramarz Fekri
llmsreinforcement-learningfine-tuningefficiencybenchmarks
More like this →