From Long to Short: LLMs Excel at Trimming Own Reasoning Chains

Wei Han, Geng Zhan, Sicheng Yu, Chenyu Wang, Bryan Hooi
9/7/2025
cs.AIcs.CL

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

O1/R1 style large reasoning models (LRMs) signal a substantial leap forward over conventional instruction-following LLMs. By applying test-time scaling to generate extended reasoning paths, they establish many SOTAs across a wide range of complex reasoning tasks. However, recent studies show that LRMs are prone to suffer from overthinking -- the tendency to overcomplicate simple problems, leading to excessive strategy switching and long, convoluted reasoning traces that hinder their interpretability. To mitigate this issue, we conduct a systematic investigation into the reasoning efficiency of a broad set of LRMs and uncover a common dilemma: the difficulty in balancing multiple generation objectives such as correctness and brevity. Based on this discovery, we propose a test-time scaling method, EDIT (Efficient Dynamic Inference Trimming), which efficiently guides LRMs to identify the shortest correct reasoning paths at test time. EDIT employs constraint-guided generation while jointly tracking length and answer distributions under varying constraints, allowing it to select responses that strike an optimal balance between conciseness and correctness. Extensive experiments across diverse models and datasets show that EDIT substantially enhance the reasoning efficiency, producing compact yet informative outputs that improve readability and user experience.

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. 1 weaker match is hidden by default — 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{han2025from,
  title  = {From Long to Short: LLMs Excel at Trimming Own Reasoning Chains},
  author = {Wei Han and Geng Zhan and Sicheng Yu and Chenyu Wang and Bryan Hooi},
  year   = {2025},
  eprint = {2509.06174},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2509.06174v1}
}

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/2509.06174.svg)](https://codeofpaper.com/paper/2509.06174)

Discussion