Skip to content
Conference Open access

CLARO: Controlled Attribute-Driven Reasoning Optimization for Efficient Chain-of-Thought

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 .

Read PDF

Similar papers

Preprint Aug 2026

ChainPrune: Evaluating and Reducing Redundancy in Long Chain-of-Thought Reasoning

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
Preprint Jul 2026

OS-Pruner: Pruning Chains-of-Thought of Reasoning Models via Optimal Stopping

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. · 0 citations
2025

Evaluating the Inductive Abilities of Large Language Models: Why Chain-of-Thought Reasoning Sometimes Hurts More Than Helps

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 failure types.

Haibo Jin, Peiyan Zhang, Man Luo et al. · 1 citation
Conference Open access 2026

LoRE: Enhancing Search Relevance with Progressive Chain-of-Thought and Preference Alignment

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. · 0 citations
Open access 2026

AbstractReasoner at SemEval-2026 Task 11: Reducing Content Effects via Knowledge Distillation and Structured Reasoning Prompts

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. · 1 citation

Sprint or Delve: A Distribution-Aware Approach to Efficient Reasoning

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.

Zehui Ling, Deshu Chen, Hongwei Zhang et al. · 0 citations