SPOT: Span-level Pause-of-Thought for Efficient and Interpretable Latent Reasoning in Large Language Models
On the map: LLM reasoning → Test-time compute and efficient thinking
Abstract (arXiv)
Explicit Chain-of-Thought improves the reasoning performance of large language models but often incurs high inference cost due to verbose token-level traces. While recent approaches reduce this overhead via concise prompting or step pruning, they largely truncate what the model says rather than internalize what the model thinks. Latent reasoning offers a promising alternative by performing computation in the hidden space, yet prior methods face two critical challenges. Many existing approaches rely on rigid point-to-point alignment, forcing a latent token to approximate the final representation of a reasoning step, which can be insufficient to capture the dense, variable-length semantics of an entire reasoning segment. Furthermore, these methods often suffer from a lack of interpretability: latent states are commonly produced by unconstrained optimization or embedding mixing, yielding vectors that are difficult to decode or audit under the pretrained language head. We propose SPOT, a flexible framework that compresses explicit CoT into compact latent pause tokens without enforcing a fixed response template. At the core of SPOT is Span-level Semantic Alignment, a Sinkhorn optimal-transport objective that softly matches each pause token to the semantics of an entire reasoning segment, overcoming the rigidity of step-end alignment. To further improve interpretability, SPOT introduces a Frozen-Head Decoding Constraint that keeps latent states directly decodable as token distributions under the frozen pretrained LM head, enabling readable keyword interpretations of latent thoughts. Experiments on reasoning benchmarks demonstrate that SPOT improves accuracy by 2.3 points on average while reducing generated tokens by 37.5% and provides faithful semantic interpretations of the latent reasoning process.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 19 of its 44 references that are in the map. First posted on arXiv 6 Mar 2026.
Builds on
19 of 44 references.
Closest ancestors · 9
Same direction, newest first
- 2025SpiralThinker: Latent Reasoning through an Iterative Process with Text-Latent Interleaving12 Nov
- 2025LLM Latent Reasoning as Chain of Superposition17 Oct
- 2025PEAR: Phase Entropy Aware Reward for Efficient Reasoning9 Oct
- 2025Making Slow Thinking Faster: Compressing LLM Chain-of-Thought via Step Entropy5 Aug
- 2025ConciseHint: Boosting Efficient Reasoning via Continuous Concise Hints during Generation23 Jun
- 2025Dynamic Early Exit in Reasoning Models22 Apr
- 2025LightThinker: Thinking Step-by-Step Compression21 Feb
- 2024Compressed Chain of Thought: Efficient Reasoning Through Dense Representations17 Dec
- 2023Think before you speak: Training Language Models With Pause Tokens3 Oct
Other references · 10
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2025CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillationcited by 216
- 2025Sketch-of-Thought: Efficient LLM Reasoning with Adaptive Cognitive-Inspired Sketchingcited by 116
- 2025Implicit Reasoning in Large Language Models: A Comprehensive Surveycited by 42
- 2024Thinking Tokens for Language Modelingcited by 23
- 2025System-1.5 Reasoning: Traversal in Language and Latent Spaces with Dynamic Shortcutscited by 23
- 2025Concise Reasoning, Big Gains: Pruning Long Reasoning Trace with Difficulty-Aware Promptingcited by 13
- 2025LLMTM: Benchmarking and Optimizing LLMs for Temporal Motif Analysis in Dynamic Graphscited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2026Tyler: Typed Latent Reasoning for Language Models -- When to Think, What to Compute, and How Much to Allocate
- 2025R-Capsule: Compressing High-Level Plans for Efficient Large Language Model Reasoning
- 2026Latent Thought Flow: Efficient Latent Reasoning in Large Language Models
- 2026Latent Recurrent Thoughts: Recurrent Refinement of Proposed Latents for Reasoning with Frozen LLMs
- 2026SeLaR: Selective Latent Reasoning in Large Language Models
- 2026A*-Thought-V2: Efficient Latent Reasoning via Geometric Dynamics of LLM
- 2026What Matters for Latent Reasoning with Flow Matching
- 2026Why Struggle with Continuous Latents? Interpretable Discrete Latent Reasoning via Rendered Compression