- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates how to sample diverse reasoning trajectories in latent reasoning with large language models. The experiments show that gains in pass@k, whether achieved through standard sampling or full-chain perturbation, do not translate into improvements in maj@k. Motivated by this finding, the authors propose Single Calibrated Perturbation and provide a theoretical analysis of why pass@k behaves differently in latent reasoning than in explicit chain-of-thought (CoT) reasoning.
Critical strengths
-
The paper addresses a meaningful problem and presents a coherent and thoughtful research approach. It begins with empirical observations, uses these findings to motivate an improved method, and then provides theoretical analysis to explain the underlying mechanisms in greater depth.
-
The paper offers a valuable and insightful analysis of the differences between sampling reasoning trajectories in latent reasoning and in standard chain-of-thought (CoT) reasoning. This comparison provides useful perspectives for future research in the field.
Critical weaknesses
-
The models used in the experiments are somewhat dated and relatively weak. This is a concern because CoT-related experimental results can depend strongly on model capability.
-
My main concern is that, if a model struggles to produce correct answers, sampling multiple CoT trajectories may increase pass@k without improving maj@k. To what extent is this phenomenon specific to perturbations of latent reasoning trajectories, rather than a consequence of limited model capability? Can the proposed method effectively address this underlying issue?
Questions for authors
I find the paper’s analysis of the differences between sampling reasoning trajectories in latent reasoning and in standard chain-of-thought (CoT) reasoning valuable. However, the claim that latent-state perturbations cannot uncover better reasoning trajectories seems overly strong. If the underlying model is sufficiently capable, could such perturbations increase trajectory diversity and also improve maj@k? As noted in the weaknesses section, it remains unclear whether the observed limitation is inherent to latent-state perturbation or reflects the limited capabilities of the models evaluated.
6 comments
Weakness 2: My main concern is that, if a model struggles to produce correct answers, sampling multiple CoT trajectories may increase pass@k without improving maj@k. To what extent is this phenomenon specific to perturbations of latent reasoning trajectories, rather than a consequence of limited model capability? Can the proposed method effectively address this underlying issue?
W2. We thank the reviewer for this valuable comment.
Model capability versus failure of exploration. We revised our manuscript to directly explain the degenerate exploration exhibited by latent perturbation methods, and to show that it stems from the reasoning paradigm, i.e., perturbation-based exploration in latent reasoning, rather than from limited model capability. As in our reply to W1, our dual-mode setting isolates this failure, since the same backbone improves maj@k in its explicit mode but not under latent perturbation. Formally, we characterize in Section 4 how both AGN and MC-dropout switch answers by their margin fragility [1], and we bound their switching probabilities, so the correct answer is one candidate among the alternatives and therefore gains no probability for being correct (Proposition 2, Corollaries 2.1 and 2.2, and Proposition 3 for the full chain). Empirically, the answers induced by latent perturbation remain within the reference support [2] of the original model. In contrast, explicit sampling not only discovers answers outside its support but also improves the majority vote steadily (newly added in Section 3.2, Figure 4). Together, these results demonstrate, both theoretically and empirically, the degenerate exploration that we observe.
Can the proposed method address this issue? We proposed the single calibrated perturbation as a control, to show that full-chain perturbation is not necessary given the degenerate exploration of the latent models in our study. With this experiment, we demonstrated that the answer distribution of full-chain perturbation can be recovered by a single calibrated perturbation (Section 3.4). In this revision, Corollary 2.2 and the Proposition 3 we added predict this behavior for both AGN and MC-dropout: to first order, within each method, full-chain perturbation and a single perturbation move the answer margins in the same way. We additionally verify our theoretical bounds by comparing the switching rates they predict with those observed under full-chain AGN, which closely match (new Appendix G). Accordingly, we establish that perturbation methods for unconstrained-thought models cannot be directly used to perform latent PTTS.
[1] Jeremy M. Cohen, Elan Rosenfeld, and J. Zico Kolter. Certified Adversarial Robustness via Randomized Smoothing. ICML 2019.
[2] John Hewitt, Christopher D. Manning, and Percy Liang. Truncation Sampling as Language Model Desmoothing. Findings of EMNLP 2022.
Question 1: I find the paper’s analysis of the differences between sampling reasoning trajectories in latent reasoning and in standard chain-of-thought (CoT) reasoning valuable. However, the claim that latent-state perturbations cannot uncover better reasoning trajectories seems overly strong. If the underlying model is sufficiently capable, could such perturbations increase trajectory diversity and also improve maj@k? As noted in the weaknesses section, it remains unclear whether the observed limitation is inherent to latent-state perturbation or reflects the limited capabilities of the models evaluated.
Q1. We thank the reviewer for raising this question about our main claim that latent-state perturbations cannot uncover better reasoning trajectories. As discussed in our reply to W2, we formally model this failure (Section 4) and connect it to the literature on adversarial and random perturbations [1, 2]: a perturbation switches the answer when it crosses the decision boundary of an alternative (new Figure 6, Appendix B.5), so the induced answers are governed by their margin fragility. We verified these claims experimentally with the answer-overlap analysis (Section 3.2, new Figure 4) and with a comparison of the predicted and observed switching rates (new Appendix G).
With regard to model capability, our replies to W1 and W2 show that the same backbone improves maj@k in its explicit mode but not under latent perturbation, and that this failure holds for every unconstrained-thought model we tested, from 124M to 3B parameters (Section 3.2, Appendix E).
[1] Seyed-Mohsen Moosavi-Dezfooli, Alhussein Fawzi, and Pascal Frossard. DeepFool: A Simple and Accurate Method to Fool Deep Neural Networks. CVPR 2016.
[2] Alhussein Fawzi, Seyed-Mohsen Moosavi-Dezfooli, and Pascal Frossard. Robustness of Classifiers: From Adversarial to Random Noise. NeurIPS 2016.
W1. We appreciate the valuable comment of the reviewer and the interest in our work. We agree that the models we evaluate are relatively small, with backbones from 124M to 3B parameters (Appendix E). These are the scales at which current latent reasoning models are released and evaluated by prior work, so our setting matches theirs [1, 2, 3, 4]. Our results nevertheless show a fundamental distinction between the two reasoning paradigms. With dual-mode models, we compare both paradigms on the same backbone. The same model shows signs of exploration in its explicit mode, with maj@k above its greedy accuracy, yet fails to improve maj@k under latent perturbation (Section 3.2). This failure holds for every unconstrained-thought model we tested, regardless of its size. Since the explicit and latent modes share one backbone, model capability alone cannot explain the gap, which instead points to how latent perturbation explores. Our reply to W2 further clarifies the degenerate exploration that we observe and formalize.
[1] Shibo Hao, Sainbayar Sukhbaatar, DiJia Su, Xian Li, Zhiting Hu, Jason Weston, and Yuandong Tian. Training Large Language Models to Reason in a Continuous Latent Space. arXiv:2412.06769, 2025.
[2] Zhenyi Shen, Hanqi Yan, Linhai Zhang, Zhanghao Hu, Yali Du, and Yulan He. CODI: Compressing Chain-of-Thought into Continuous Space via Self-Distillation. arXiv:2502.21074, 2025.
[3] Xilin Wei, Xiaoran Liu, Yuhang Zang, Xiaoyi Dong, Yuhang Cao, Jiaqi Wang, Xipeng Qiu, and Dahua Lin. SIM-CoT: Supervised Implicit Chain-of-Thought. arXiv:2509.20317, 2025.
[4] Runyang You, Yongqi Li, Meng Liu, Wenjie Wang, Liqiang Nie, and Wenjie Li. Parallel Test-Time Scaling for Latent Reasoning Models. arXiv:2510.07745, 2026.