2026· Annual Meeting of the Association for Computational Linguistics· pp. 26779-26799· 0 citations· 42 references
Computer Science
TL;DR
Overall, the findings establish that optimizing the thought process structure refines reasoning efficacy, with computational efficiency emerging as a derivative benefit of a clearer thought process.
Abstract
Large language models exhibit strong reasoning capabilities but often require significant computational resources due to verbose, un-structured Chain-of-Thought outputs. Recent approaches guide reasoning length through to-ken penalties or truncation, risking the omission of necessary steps. We posit that conciseness should be an emergent property of structured thought, rather than a result of artificially forced brevity. To this end, we first demonstrate that Attribute-Guided Prompting , a lightweight zero-shot strategy, improves reasoning performance while reducing inference cost. Building on this foundation, we introduce C ontro l led A ttribute-Driven R easoning O ptimization ( CLARO ), a reinforcement learning framework designed to internalize these benefits. CLARO guides models to embed high-quality structural attributes, such as read-ability, math density, syntactic compression, and low redundancy, within a user-defined to-ken budget. The proposed method outperforms state-of-the-art baselines across diverse benchmarks, yielding accuracy gains of up to 63.6%, demonstrating that guiding generated output language structure enhances reasoning. Overall, our findings establish that optimizing the thought process structure refines reasoning efficacy, with computational efficiency emerging as a derivative benefit of a clearer thought process. Code and models are available at https://github.com/odedsc/CLARO .
This work proposes ChainPrune, a novel reasoning path semantic structural optimization method to efficiently and controllably synthesize self-generated high-quality training data and incorporates a DPO-based preference learning method combined with supervised loss, effectively mitigating false reward suppression.
Weihang Pan, Zhengxu Yu, Yuxiang Zhang et al.· 1 citation
OS-Pruner is a lightweight plug-in framework that formulates chain-of-thought pruning as an optimal stopping problem that achieves 20-60\% reduction in generation length with minimal accuracy sacrifice on diverse reasoning benchmarks and base models.
Mohammed Ehab, Aymane El Gadarri, Vivek F. Farias et al.· arXiv.org· 0 citations
This work presents a theoretical framework that reveals how reasoning steps can amplify error through three failure modes: incorrect sub-task decomposition, incorrect sub-task solving, and incorrect final answer summarization, and introduces structured interventions that adapt CoT generation according to the identified...
Haibo Jin, Peiyan Zhang, Man Luo et al.· Neural Information Processin...· 1 citation
This paper proposes LoRE, a novel two-stage training framework for e-commerce search relevance, which outperforms GPT-5 by 29.1% in Macro-F1 and achieving a relative 27% online gain, offering a vital reference for industrial domain-specific post-training post-training.
Chenji Lu, Zhuo Chen, Hui Zhao et al.· Annual Meeting of the Associ...· 0 citations
A systematic study of different intervention strategies: zero-shot chain of thought, symbolic representation, activation-steering, and supervised fine-tuning along with prompting optimization during inference, which achieves the best performance with the largest model.
A. Chowdhury, Vlad Pavlovich, Julius Dunfoy et al.· SemEval@ACL· 1 citation
The Powered Length Penalty (PLP) is proposed, an adaptive regularizer that penalizes redundancy in short sequences while gradually reducing penalties for longer sequences, preserving deep reasoning.
Ze-Hui Ling, De-Shu Chen, Hong-Wei Zhang et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.