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. |
Similar Papers
SoftCoT: Soft Chain-of-Thought for Efficient Reasoning with LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to continuous-space reasoning focus on hard token decoding and suffer from catastrophic forgetting. |
| Approach: | They propose a method that generates instance-specific soft thought tokens as the initial chain of thoughts and maps them into the LLM’s representation space via a trainable projection module. |
| Outcome: | The proposed method improves LLM reasoning performance through supervised, parameter-efficient fine-tuning. |
SpecCoT: Accelerating Chain-of-Thought Reasoning through Speculative Exploration (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Large Reasoning Models suffer from high inference latency due to lengthy reasoning chains. |
| Approach: | They propose a collaborative framework that combines large and small models for effective reasoning. |
| Outcome: | The proposed framework reduces inference latency by 1.7-4.1 while maintaining comparable accuracy to standard large model inference. |
GCoT-Decoding: Unlocking Deep Reasoning Paths for Universal Question Answering (2026.findings-acl)
Copied to clipboard
| Challenge: | Recent work on Chain-of-Thought reasoning requires manual prompts to guide the model. |
| Approach: | They propose a general decoding strategy that generates CoT-style reasoning paths without prompts. |
| Outcome: | The proposed method maintains strong performance on fixed and free QA tasks and achieves significant improvements on free qa. |
Pru-CoT: Towards Efficient Reasoning Distillation via Pruning Chain-of-Thought (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing heuristics fail to capture global causal logic due to rigid rules and limited search spaces. |
| Approach: | They propose a framework that extracts the essential logical structure from reasoning chains. |
| Outcome: | Experiments show that Pru-CoT models generate more compact reasoning paths compared to models trained on verbose data. |
Recursion of Thought: A Divide-and-Conquer Approach to Multi-Context Reasoning with Language Models (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to generate intermediate steps (CoT) are limited by the maximum context size due to various reasons. |
| Approach: | They propose a new inference framework that introduces several special tokens that the models can output to trigger context-related operations. |
| Outcome: | Extensive experiments with multiple architectures including GPT-3 show that the proposed framework significantly improves LMs’ inference capability. |
Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions (2023.acl-long)
Copied to clipboard
| Challenge: | Large language models generate natural language reasoning steps or Chains-of-Thoughts when prompted appropriately. |
| Approach: | They propose a new approach that interleaves retrieval with steps (sentences) in a CoT and uses retrieved results to improve CoT. |
| Outcome: | The proposed approach improves retrieval and downstream QA significantly on four datasets. |
Fine-Tuning on Diverse Reasoning Chains Drives Within-Inference CoT Refinement in LLMs (2025.acl-long)
Copied to clipboard
| Challenge: | Existing approaches to generate multiple independent CoTs, combining them through ensembling or other post-hoc strategies, have been shown to be effective in boosting performance. |
| Approach: | They propose a method where LLMs are fine-tuned to generate a sequence of Diverse Chains of Thought (DCoT) within a single inference step. |
| Outcome: | The proposed model can generate multiple chains of thought within a single inference step without external feedback. |
Graph-Based Chain-of-Thought Pruning for Reducing Redundant Reflections in Reasoning LLMs (2026.findings-acl)
Copied to clipboard
Hongyuan Yuan, Xinran He, Run Shao, Bolei He, Xianwei Xue, Mengke Chen, Qiutong Pan, Haiwei Wang, Haifeng Li
| Challenge: | Extending CoT through RL can induce undesirable thinking patterns such as overthinking . prior work has focused on inefficient reflection, which manifests in two problematic patterns: Indiscriminate Reflection and Repetitive Reflectione . |
| Approach: | They propose a graph-based approach to optimize CoT by pruning each linear CoT into a directed acyclic graph with explicit dependency edges. |
| Outcome: | The proposed approach reduces the average reasoning tokens by 42% while maintaining or improving 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. |
Think Faster Than Words: Efficient LLM Chain-of-Thought Reasoning via Dynamic Shortcut Decoding (2026.acl-long)
Copied to clipboard
| Challenge: | Existing methods that prune or employ early stopping to reduce latency often compromise reasoning reliability. |
| Approach: | They propose a shortcut decoding framework that integrates probes over internal hidden states with step-level entropy to detect convergence of reasoning during generation and adaptively selects between a fast-exit path and a stability-verified path to remove redundant steps while preserving answer correctness. |
| Outcome: | The proposed framework reduces token usage by approximately 35% and maintains accuracy comparable to full CoT decoding. |