These results show that evaluating only a final checkpoint can obscure both when counterfactual responsiveness changes and what the latent states contribute, and show that high task accuracy can coexist with low counterfactual responsiveness.
Abstract
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.
The Distributional Answer Commitment Score (DACS) is proposed, a distributional confidence estimator that measures the entropy of the model's probability distribution over answer commitment at each reasoning step to capture how concentrated the model's answer belief is without requiring ground-truth answers or task-spe...
Zhao-Han Zhang, Jun-Jie Liu, Chengzhengxu Li et al.· 0 citations
Long-context reasoning faces two complementary bottlenecks: retaining evidence across long inputs and sustaining computation across many reasoning steps. Existing approaches largely address them separately, with external memory extending access to distant evidence and latent reasoning compressing multi-step computation...
Xiao-Qiang Wang, Suyuchen Wang, Bang Liu· 1 citation
This work uses synthetic multi-hop lookup tasks to measure faithfulness causally at the activation level, specifically on self-generated reasoning, and aims to measure faithfulness causally at the activation level, specifically on self-generated reasoning.
It is found that full trajectories provide only limited benefit, while partial trajectories are effective even under heavy truncation, and training LLMs using endpoints leads to consistent changes in reasoning behavior, and that it also benefits post-training methods based on reinforcement learning or on-policy distill...
Jaehui Hwang, Sangdoo Yun, Byeongho Heo et al.· 0 citations
Results show that a conceptually coherent chain and a correct final answer do not by themselves establish multi-hop reasoning, and introduce REALHOP, a diagnose-construct-verify framework that rebinds entities, factorizes selected relations, adds complete competing paths, and places evidence at traceable locations.
Ji-Hua Tao, Xiao-Kun Yuan, Yao-Ming Li et al.· 0 citations
Large language models increasingly rely on long chain-of-thought (CoT) trajectories for complex reasoning, but autoregressive generation brings substantial memory and inference costs. Latent reasoning models (LRMs) offer a more efficient alternative by compressing intermediate reasoning into a small number of continuou...
Shao-Long Chen, Ang Li, Ming-Jie Li et al.· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduAug 27, 2026
A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.