Time-for-Accuracy: Formalizing Chain-of-Thought as an Expansion of Logical Depth (2026.findings-acl)
Copied to clipboard
| Challenge: | Chain-of-thought (CoT) prompting can improve multi-step reasoning, but it is unclear what kind of additional sequential computation longer traces actually enable. |
| Approach: | They propose a deletion-based measure of step necessity under a specified inference interface to operationalize realized depth beyond raw length. |
| Outcome: | The proposed method combines effective logical depth with Bennett's logical depth to show that it is more efficient than a linear model. |
Similar Papers
Valid Necessary: Diagnosing Latent Inefficiency in Chain-of-Thought (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing reasoning step evaluators fail to distinguish “valid but inefficient” reasoning steps from necessary reasoning. |
| Approach: | They propose a training-free metric that identifies low-utility steps and a post-hoc compression strategy to quantify their impact on token usage. |
| Outcome: | The proposed metric reduces token consumption by 31–53% while maintaining accuracy at substantially higher compression rates. |
Towards Understanding Chain-of-Thought Prompting: An Empirical Study of What Matters (2023.acl-long)
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting can dramatically improve the multi-step reasoning abilities of large language models (LLMs). |
| Approach: | They propose to use Chain-of-Thought (CoT) prompting to encourage the LLM to generate intermediate rationales for solving a problem by providing a series of reasoning steps in the demonstrations. |
| Outcome: | The proposed model can generate coherent lines of reasoning even with invalid demonstrations while still generating coherent lines during inference. |
The Impact of Reasoning Step Length on Large Language Models (2024.findings-acl)
Copied to clipboard
| Challenge: | Long reasoning steps in LLMs improve reasoning abilities, but the correlation between their effectiveness and the length of reasoning steps remains largely unknown. |
| Approach: | They conducted experiments that expand and compress the rationale reasoning steps within CoT demonstrations while keeping all other factors constant. |
| Outcome: | The results show that lengthening the reasoning steps in prompts significantly enhances LLMs’ reasoning abilities across multiple datasets. |
Chain-of-Probe: Examining the Necessity and Accuracy of CoT Step-by-Step (2025.findings-naacl)
Copied to clipboard
Zezhong Wang, Xingshan Zeng, Weiwen Liu, Yufei Wang, Liangyou Li, Yasheng Wang, Lifeng Shang, Xin Jiang, Qun Liu, Kam-Fai Wong
| Challenge: | Current research found the issue of Early Answering in large language models where the models already have an answer before generating the Chain-of-Thought (CoT). |
| Approach: | They propose a method to probe changes in confidence during the model’s reasoning and prioritize answers with correct reasoning among multiple candidates. |
| Outcome: | The proposed method reveals that in a significant number of question-answer cases, CoT appears to be unnecessary and this necessity correlates with the simplicity of the task, defined by the reasoning steps required. |
Markov Chain of Thought for Efficient Mathematical Reasoning (2025.naacl-long)
Copied to clipboard
| Challenge: | Existing studies have sought to enhance the mathematical reasoning capabilities of large language models. |
| Approach: | They propose a Markov Chain of Thought (MCoT) that compresses previous reasoning steps into a simplified question. |
| Outcome: | The proposed method improves efficiency and maintains comparable accuracy. |
Explainable Chain-of-Thought Reasoning: An Empirical Analysis on State-Aware Reasoning Dynamics (2025.findings-emnlp)
Copied to clipboard
Sheldon Yu, Yuxin Xiong, Junda Wu, Xintong Li, Tong Yu, Xiang Chen, Ritwik Sinha, Jingbo Shang, Julian McAuley
| Challenge: | Recent advances in chain-of-thought prompting have demonstrated the ability of large language models to perform multi-step reasoning. |
| Approach: | They propose a framework to analyze latent dynamics of CoT trajectories for interpretability . they segment generated CoT into discrete reasoning steps and abstract each step into a spectral embedding based on token-level Gram matrices . |
| Outcome: | The proposed framework segments generated CoT steps into discrete reasoning steps, abstracts each step into a spectral embedding based on token-level Gram matrices, and clusters these embeddements into semantically meaningful latent states. |
Deciphering the Factors Influencing the Efficacy of Chain-of-Thought: Probability, Memorization, and Noisy Reasoning (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) prompting has been shown to enhance the multi-step reasoning capabilities of Large Language Models (LLMs). |
| Approach: | They propose to use CoT prompting to analyze a symbolic reasoning task where letters are shifted forward some number of steps in the alphabet. |
| Outcome: | The proposed model performs well on a symbolic reasoning task, with three LLMs performing the task using CoT prompts. |
Enhancing Chain-of-Thoughts Prompting with Iterative Bootstrapping in Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Chain-of-thought (CoT) prompting is a technique to enhance the reasoning abilities of Large language models (LLMs) however, the reasoning chains of demonstrations are observed to be prone to errors, which can lead to incorrect reasoning during inference. |
| Approach: | They propose an iterative bootstrapping technique to enhance the reasoning abilities of Large language models (LLMs) by generating a series of reasoning steps to obtain the answer, and using the reasoning chains as exemplars to demonstrate the task. |
| Outcome: | The proposed method improves the performance of Large language models (LLMs) on three reasoning tasks on ten datasets. |
ETR: Entropy Trend Reward for Efficient Chain-of-Thought Reasoning (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods to shorten CoTs use length penalties or global entropy reduction . Existing approaches to CoT reasoning have significant practical drawbacks . |
| Approach: | They propose a method that shortens CoTs by length penalties or global entropy reduction . they integrate ETR into Group Relative Policy Optimization and evaluate it . |
| Outcome: | The proposed objective improves accuracy–efficiency trade-off by +9.9% while reducing CoT length by 67% across four benchmarks. |
DiffCoT: Diffusion-styled Chain-of-Thought Reasoning in LLMs (2026.findings-acl)
Copied to clipboard
| Challenge: | Chain-of-Thought (CoT) reasoning improves multi-step mathematical problem solving in large language models but is vulnerable to exposure bias and error accumulation. |
| Approach: | They propose a diffusion-styled CoT framework that reformulates CoT reasoning as an iterative denoising process. |
| Outcome: | The proposed framework outperforms existing methods on three multi-step CoT reasoning benchmarks. |