mlsanityData to 14 Oct 2026

DART: Distilling Autoregressive Reasoning to Silent Thought

arXiv 2506.11752 ↗First posted 13 Jun 2025cs.CLcited by 3

On the map: LLM reasoning → Prompting and chain-of-thought reasoning

Abstract (arXiv)

Chain-of-Thought (CoT) reasoning has significantly advanced Large Language Models (LLMs) in solving complex tasks. However, its autoregressive paradigm leads to significant computational overhead, hindering its deployment in latency-sensitive applications. To address this, we propose DART (Distilling Autoregressive Reasoning to Silent Thought), a self-distillation framework that enables LLMs to replace autoregressive CoT with non-autoregressive Silent Thought (ST). Specifically, DART introduces two training pathways: the CoT pathway for traditional reasoning and the ST pathway for generating answers directly from a few ST tokens. The ST pathway utilizes a lightweight Reasoning Evolvement Module (REM) to align its hidden states with the CoT pathway, enabling the ST tokens to evolve into informative embeddings. During inference, only the ST pathway is activated, leveraging evolving ST tokens to deliver the answer directly. Extensive experimental results demonstrate that DART offers significant performance gains compared with existing non-autoregressive baselines without extra inference latency, serving as a feasible alternative for efficient reasoning.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Placed in Prompting and chain-of-thought reasoning, one of 17 directions in LLM reasoning. Builds on 13 of its 23 references that are in the map. First posted on arXiv 13 Jun 2025.

Builds on

13 of 23 references.

Closest ancestors · 5

Same direction, newest first

  1. 2025CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillation28 Feb
  2. 2024Training Large Language Models to Reason in a Continuous Latent Space9 Dec
  3. 2024From Explicit CoT to Implicit CoT: Learning to Internalize CoT Step by Step23 May
  4. 2024Chain of Thought Empowers Transformers to Solve Inherently Serial Problems20 Feb
  5. 2023Towards Revealing the Mystery behind Chain of Thought: A Theoretical Perspective24 May

Other references · 8

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  3. 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
  4. 2021Are NLP Models really able to Solve Simple Math Word Problems?cited by 878
  5. 2025Stop Overthinking: A Survey on Efficient Reasoning for Large Language Modelscited by 464
  6. 2016Solving General Arithmetic Word Problemscited by 360
  7. 2023Think before you speak: Training Language Models With Pause Tokenscited by 264
  8. 2024Compressed Chain of Thought: Efficient Reasoning Through Dense Representationscited by 201

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026CASE: Causal Alignment and Structural Enforcement for Improving Chain-of-Thought Faithfulness
  2. 2025DART: Difficulty-Adaptive Reasoning Truncation for Efficient Large Language Models
  3. 2026From Chain-of-Thought to Loops: Non-Autoregressive Latent Reasoning via Looped Transformers
  4. 2026Learning from Partial Chain-of-Thought via Truncated-Reasoning Self-Distillation
  5. 2026Tyler: Typed Latent Reasoning for Language Models -- When to Think, What to Compute, and How Much to Allocate
  6. 2026S3-CoT: Self-Sampled Succinct Reasoning Enables Efficient Chain-of-Thought LLMs
  7. 2026Latent Reasoning with Normalizing Flows
  8. 2026D-COT: Disciplined Chain-of-Thought Learning for Efficient Reasoning in Small Language Models