Skip to content

Final Checkpoints Are Not Enough: Analyzing Latent Reasoning Faithfulness Along Training Trajectories

Jul 2026 · arXiv.org · Vol abs/2607.06648 · 1 citation · 32 references
Computer Science

TL;DR

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.

View source

Similar papers

#natural language process... Preprint Sep 2026

When Confidence Rises Too Early: Detecting Shortcut Reasoning via Premature Answer Commitment

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
#natural language process... Preprint Sep 2026

LatentHarness: Learning Latent Actions for Memory and Reasoning via Counterfactual Policy Distillation

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
#artificial intelligence Preprint Sep 2026

Are Stated Reasoning Steps Causally Load-Bearing?

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.

Abhiram Bhupatiraju, Rayan Nyaupane · 0 citations
#natural language process... Preprint Sep 2026

Revisiting Complete Reasoning Traces for Post-Training

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
#artificial intelligence Preprint Sep 2026

REALHOP: Rethinking Multi-Hop Reasoning Evaluation via Behavioral Auditing

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
#machine learning Preprint Sep 2026

Assessing Adversarial Robustness of Latent Reasoning Models

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 Aug 27, 2026

Looking beyond natural sequences

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.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.