Latent reasoning has been recently proposed as a reasoning paradigm and performs multi-step reasoning through generating steps in the latent space instead of the textual space. This paradigm enables reasoning beyond discrete language tokens by performing multi-step computation in continuous latent spaces. Although there have been numerous studies focusing on improving the performance of latent reasoning, its internal mechanisms remain not fully investigated. In this work, we conduct a comprehensive analysis of latent reasoning methods to better understand the role and behavior of latent representation in the process. We identify two key issues across latent reasoning methods with different levels of supervision. First, we observe pervasive shortcut behavior, where they achieve high accuracy without relying on latent reasoning. Second, we examine the hypothesis that latent reasoning supports BFS-like exploration in latent space, and find that while latent representations can encode multiple possibilities, the reasoning process does not faithfully implement structured search, but instead exhibits implicit pruning and compression. Finally, our findings reveal a trade-off associated with supervision strength: stronger supervision mitigates shortcut behavior but restricts the ability of latent representations to maintain diverse hypotheses, whereas weaker supervision allows richer latent representations at the cost of increased shortcut behavior.
Figures & tables
Figure 1: Performance of different methods across different numbers of latent steps
Figure 2: Tokens with Top-10 Attention Score for an Example in ProsQA Dataset
Figure 3: Tokens with Top-10 Attention Score for an Example in GSM8K Dataset
Coconut
CODI
CoLAR
SIM-CoT
Standard CoT
Model
Setting
GSM8K
ProsQA
GSM8K
ProsQA
GSM8K
ProsQA
GSM8K
ProsQA
GSM8K
ProsQA
Llama
clean
36.97%
99.40%
55.57%
100.00%
25.23%
98.20%
56.03%
100.00%
61.74%
90.60%
Llama
noise
20.61%
99.40%
27.45%
99.60%
3.32%
60.92%
10.08%
97.60%
0.03%
0.40%
GPT
clean
34.09%
97.80%
43.59%
80.80%
18.44%
77.52%
42.23%
80.60%
43.56%
81.00%
GPT
noise
3.79%
89.00%
8.87%
80.80%
2.84%
46.80%
7.05%
75.60%
0.08%
0.00%
Table 1: Performance under clean inputs vs. noise perturbations for different implicit/explicit reasoning methods.
# prefix step
Latent reasoning (next)
Latent reasoning (final)
Explicit reasoning (next)
Explicit reasoning (final)
avg
median
min
max
avg
median
min
max
avg
median
min
max
avg
median
min
max
1
18.75
14
1
87
28.35
23
1
95
3.68
2
1
87
9.32
4
1
95
2
20.38
15
1
89
25.50
19
1
96
3.31
1
1
65
6.59
2
1
99
3
20.00
13
1
97
21.82
13
1
96
2.73
1
1
80
4.17
1
1
90
4
17.22
10
1
92
17.74
10
1
94
2.01
1
1
60
2.42
1
1
70
5
15.84
9
1
91
15.84
9
1
91
1.27
1
1
27
1.37
1
1
50
Table 2: Distribution of possibilities of final results with various numbers of prefix steps
Implicit
Explicit
# prefix step
Pass@100
Maj@100
Pass@100
Maj@100
1
82.34%
44.20%
62.17%
44.12%
2
78.62%
41.70%
55.34%
44.05%
3
75.74%
39.95%
48.30%
42.71%
4
70.36%
39.73%
45.87%
43.52%
5
69.07%
39.42%
44.05%
43.59%
Table 3: Comparison between implicit and explicit results across different prefix steps.
Distribution of possibilities
Performance
avg
median
min
max
acc (greedy)
Pass@100
majority vote
Improved Coconut
15.84
9
1
91
34.09%
69.07%
39.42%
CODI
12.96
6
1
83
43.59%
70.43%
42.23%
SIM-CoT
13.57
7
1
89
42.23%
69.60%
43.21%
CoLAR
3.21
1
1
45
18.44%
23.28%
18.42%
Table 4: Distribution of possibilities and performance across methods (GPT-2)
llama
Distribution of possibilities
Performance
avg
median
min
max
acc (greedy)
majority vote
Pass@100
Improved Coconut
10.0
5
1
84
39.68%
40.21%
59.00%
CODI
6.39
2
1
67
55.41%
55.57%
73.84%
SIM-CoT
7.46
2
1
65
56.01%
55.50%
72.93%
CoLAR
7.63
2
1
73
25.48%
25.70%
33.21%
Table 5: Distribution of possibilities and performance across methods ( LLaMA3.2-1B ).
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
Coconut
+ Cross-stage data reuse
+ Next-step-only supervision
+ Both
Clean
97.80%
97.40%
93.60%
93.60%
Noise
97.80%
94.80%
93.80%
4.40%
Appendix
Table 6: Performance under clean and noisy latent for different variants of Coconut.
Latent Chain-of-Thought (CoT) internalizes reasoning within continuous hidden states, offering a promising alternative to verbose discrete reasoning traces. However, robust latent reasoning remains difficult because outcome supervision provides weak learning signals and leaves latent trajectories prone to semantic drift. In this work, we analyze Latent CoT from an information-theoretic perspective and identify this failure as a dual collapse: gradient attenuation along the optimization path and representational drift in the latent space. We further decompose process supervision into two complementary dimensions: Trajectory Supervision, which injects dense stepwise reasoning signals, and Space Supervision, which preserves the semantic structure of the latent manifold. Our analysis shows that rigid geometric compression can collapse the reasoning space, whereas generative reconstruction provides a more flexible semantic anchor that better preserves information capacity. To measure these effects, we introduce the Unified Latent Probe (ULP), which quantifies the mutual information between latent trajectories and explicit reasoning steps. Experiments reveal a clear Information-Performance Binding: reasoning accuracy depends on the information fidelity preserved in the latent chain. These findings provide a principled framework for latent reasoning supervision and suggest shifting from geometric imitation toward mutual information maximization. Our code is available at this repository.
Xinghao Chen, Chak Tou Leong, Wenjin Guo +3
Ningbo Institute of Digital Twin, Eastern Institute of Technology, Ningbo, China · Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China.
Latent reasoning performs multi-step inference in continuous hidden states, promising more compact and efficient reasoning. However, these opaque states raise a question of faithfulness: whether the latent reasoning steps drive the final answer. Prior work studies this question at selected checkpoints and reports several unfaithful behaviors. This endpoint view leaves how evidence of faithfulness evolves during training unexamined. We track behavioral and activation-based evidence across training using verified counterfactual edits and interventions on the latent reasoning states. We find that high task accuracy can coexist with low counterfactual responsiveness: as accuracy improves, responsiveness can decline, and different latent reasoning approaches follow distinct trajectories. On ProsQA, output sensitivity to norm-noise replacement declines alongside counterfactual responsiveness, although the result depends on the replacement. Across separately trained binary-choice and open-ended GSM settings, intervention sensitivity follows opposite trajectories. These results show that evaluating only a final checkpoint can obscure both when counterfactual responsiveness changes and what the latent states contribute.
Hengyu Jin, Shu Yang, Di Wang
Tongji University · Provable Responsible AI and Data Analytics (PRADA) Lab · King Abdullah University of Science and Technology
Latent visual reasoning aims to mimic human's imagination process by meditating through hidden states of Multimodal Large Language Models. While recognized as a promising paradigm for visual reasoning, the underlying mechanisms driving its effectiveness remain unclear. Motivated to demystify the true source of its efficacy, we investigate the validity of latent reasoning using Causal Mediation Analysis. We model the process as a causal chain: the input as the treatment, the latent tokens as the mediator, and the final answer as the outcome. Our findings uncover two critical disconnections: (a) Input-Latent Disconnect: dramatic perturbations on the input result in negligible changes to the latent tokens, suggesting that latent tokens do not effectively attend to the input sequence. (b) Latent-Answer Disconnect: perturbations on the latent tokens yield minimal impact on the final answer, indicating the limited causal effect latent tokens imposing on the outcome. Furthermore, extensive probing analysis reveals that latent tokens encode limited visual information and exhibit high similarity. Consequently, we challenge the necessity of latent reasoning and propose a straightforward alternative named CapImagine, which teaches the model to explicitly imagine using text. Experiments on vision-centric benchmarks show that CapImagine significantly outperforms complex latent-space baselines, highlighting the superior potential of visual reasoning through explicit imagination.
You Li, Chi Chen, Yanghao Li +4
School of Computer Science and Technology, Beijing Jiao-tong University · Key Laboratory of Big Data & Artificial Intelli-gence in Transportation (Beijing Jiaotong University), Ministry of Education · Tsinghua University