Just Enough Thinking: Efficient Reasoning with Adaptive Length Penalties Reinforcement Learning

Violet Xiang, Chase Blagden, Rafael Rafailov, Nathan Lile, Sang Truong +2 more
6/5/2025
cs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Large reasoning models (LRMs) achieve higher performance on challenging reasoning tasks by generating more tokens at inference time, but this verbosity often wastes computation on easy problems. Existing solutions, including supervised finetuning on shorter traces, user-controlled budgets, or RL with uniform penalties, either require data curation, manual configuration, or treat all problems alike regardless of difficulty. We introduce Adaptive Length Penalty (ALP), a reinforcement learning objective tailoring generation length to per-prompt solve rate. During training, ALP monitors each prompt's online solve rate through multiple rollouts and adds a differentiable penalty whose magnitude scales inversely with that rate, so confident (easy) prompts incur a high cost for extra tokens while hard prompts remain unhindered. Posttraining DeepScaleR-1.5B with ALP cuts average token usage by 50\% without significantly dropping performance. Relative to fixed-budget and uniform penalty baselines, ALP redistributes its reduced budget more intelligently by cutting compute on easy prompts and reallocating saved tokens to difficult ones, delivering higher accuracy on the hardest problems with higher cost.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{xiang2025just,
  title  = {Just Enough Thinking: Efficient Reasoning with Adaptive Length Penalties Reinforcement Learning},
  author = {Violet Xiang and Chase Blagden and Rafael Rafailov and Nathan Lile and Sang Truong and Chelsea Finn and Nick Haber},
  year   = {2025},
  eprint = {2506.05256},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.05256v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.05256.svg)](https://codeofpaper.com/paper/2506.05256)

Discussion