Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.24003 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917439022825472 |
|---|---|
| author | Wang, Han Yu, Xiaodong Wu, Jialian Liu, Jiang Sun, Ximeng Bansal, Mohit Liu, Zicheng |
| author_facet | Wang, Han Yu, Xiaodong Wu, Jialian Liu, Jiang Sun, Ximeng Bansal, Mohit Liu, Zicheng |
| contents | Large language models (LLMs) achieve strong reasoning performance by allocating substantial computation at inference time, often generating long and verbose reasoning traces. While recent work on efficient reasoning reduces this overhead through length-based rewards or pruning, many approaches are post-trained under a much shorter context window than base-model training, a factor whose effect has not been systematically isolated. We first show that short-context post-training alone, using standard GRPO without any length-aware objective, already induces substantial reasoning compression-but at the cost of increasingly unstable training dynamics and accuracy degradation. To address this, we propose Step-level Advantage Selection (SAS), which operates at the reasoning-step level and assigns a zero advantage to low-confidence steps in correct rollouts and to high-confidence steps in verifier-failed rollouts, where failures often arise from truncation or verifier issues rather than incorrect reasoning. Across diverse mathematical and general reasoning benchmarks, SAS improves average Pass@1 accuracy by 0.86 points over the strongest length-aware baseline while reducing average reasoning length by 16.3%, yielding a better accuracy-efficiency trade-off. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_24003 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Stabilizing Efficient Reasoning with Step-Level Advantage Selection Wang, Han Yu, Xiaodong Wu, Jialian Liu, Jiang Sun, Ximeng Bansal, Mohit Liu, Zicheng Computation and Language Machine Learning Large language models (LLMs) achieve strong reasoning performance by allocating substantial computation at inference time, often generating long and verbose reasoning traces. While recent work on efficient reasoning reduces this overhead through length-based rewards or pruning, many approaches are post-trained under a much shorter context window than base-model training, a factor whose effect has not been systematically isolated. We first show that short-context post-training alone, using standard GRPO without any length-aware objective, already induces substantial reasoning compression-but at the cost of increasingly unstable training dynamics and accuracy degradation. To address this, we propose Step-level Advantage Selection (SAS), which operates at the reasoning-step level and assigns a zero advantage to low-confidence steps in correct rollouts and to high-confidence steps in verifier-failed rollouts, where failures often arise from truncation or verifier issues rather than incorrect reasoning. Across diverse mathematical and general reasoning benchmarks, SAS improves average Pass@1 accuracy by 0.86 points over the strongest length-aware baseline while reducing average reasoning length by 16.3%, yielding a better accuracy-efficiency trade-off. |
| title | Stabilizing Efficient Reasoning with Step-Level Advantage Selection |
| topic | Computation and Language Machine Learning |
| url | https://arxiv.org/abs/2604.24003 |