analiza aiqbench
This paper studies whether open-weight language models can cut their own reasoning costs by rewriting earlier reasoning into compact summaries before continuing, without retraining. The results suggest shorter future reasoning and lower agent spending in some settings, but task quality and total time, including the rewrite step, vary by model and compressor. Readers should treat this as promising, model-specific evidence rather than a general fix for reasoning cost.
Why Pay for Long Reasoning When Rewrite Do Trick? Causal Effects of Reasoning History Compaction on Future Generation and Agent Cost
arXiv:2611.03852v1 Announce Type: cross Abstract: Reasoning substantially improves language models' ability to solve difficult problems, but long reasoning traces make these gains expensive. Efficient reasoning should express useful analysis in fewer tokens by reducing repetition and text that adds little value to solving the problem. Progress in proprietary models motivates this goal, yet their hidden scratchpads limit direct study of how it is achieved. We investigate whether open-weight models can generate less verbose reasoning by changing the form of their own earlier thoughts, without retraining. Our intervention rewrites prior reasoning into compact state records before pending tool results are revealed, then compares continuations from original and compact histories. Across the tested models, accepted compact histories usually shorten future reasoning; a coding case study also shows less repeated verification after a shared candidate solution. In software-agent deployments, compaction can reduce total spending, although task quality and rewrite-inclusive time depend on the target and compressor. These findings identify reasoning history as one way to reduce future reasoning-token use and motivate model-specific compaction policies evaluated for both efficiency and retained capability.
Title:Why Pay for Long Reasoning When Rewrite Do Trick? Causal Effects of Reasoning History Compaction on Future Generation and Agent Cost
Abstract:Reasoning substantially improves language models' ability to solve difficult problems, but long reasoning traces make these gains expensive. Efficient reasoning should express useful analysis in fewer tokens by reducing repetition and text that adds little value to solving the problem. Progress in proprietary models motivates this goal, yet their hidden scratchpads limit direct study of how it is achieved. We investigate whether open-weight models can generate less verbose reasoning by changing the form of their own earlier thoughts, without retraining. Our intervention rewrites prior reasoning into compact state records before pending tool results are revealed, then compares continuations from original and compact histories. Across the tested models, accepted compact histories usually shorten future reasoning; a coding case study also shows less repeated verification after a shared candidate solution. In software-agent deployments, compaction can reduce total spending, although task quality and rewrite-inclusive time depend on the target and compressor. These findings identify reasoning history as one way to reduce future reasoning-token use and motivate model-specific compaction policies evaluated for both efficiency and retained capability.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
arXiv:2611.03852 [cs.CL]
(or arXiv:2611.03852v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2611.03852 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
Proceedings of the Second Workshop for REsearch on Agent Language Models (REALM 2026), pp. 1213-1228, 2026
https://doi.org/10.18653/2026.realm-1.84 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 318 cuvinte
Subiecte conexe
Quantum-Geometric Length Scale for Long-distance Squeezing in Bosonic Bogoliubov Systems
arXiv · 25 aug. 2026
Evolutionary One-Step Generators: Fast and Diverse Sampling for Discrete Design
arXiv · 7 oct. 2026
Compress to Remember: Learning Compact Memory via On-Policy Distillation for Long Video Generation
arXiv · 30 sept. 2026
Machine-Learned Compact Subspace Generation for Quantum Selected Configuration Interaction within Density Matrix Embedding Framework
arXiv · 24 iul. 2026