mlsanityData to 14 Oct 2026

Markovian Circuit Tracing for Transformer State Dynamic

arXiv 2605.20824 ↗First posted 20 May 2026cs.LGcited by 0

On the map: Mechanistic interpretability → Circuits and mechanistic analysis

Abstract (arXiv)

Many sequence computations are easier to study as movement through internal states than as isolated local circuits. We introduce Markovian Circuit Tracing (MCT), a diagnostic pipeline for testing whether transformer activations contain coarse state-transition structure. The benchmark uses synthetic Hidden Markov Model (HMM) tasks where latent states, transition matrices, Bayesian belief vectors, Bayes-optimal predictions, and forced-state counterfactual targets are known exactly. Across six HMM families and three seeds per family, tiny causal transformers learn near-Bayes next-token predictors, with mean excess loss over Bayes of 0.0138. Residual activations contain partial Bayesian belief information in this controlled synthetic benchmark. State abstractions extracted from these activations recover coarse transition signal, strongest in persistent and lower-state regimes, and weaker in ambiguous-emission and six-state regimes. The clearest result comes from state forcing. Patching a recovered-state centroid reduces KL to the exact HMM counterfactual target from 0.1957 in the unpatched model to 0.0532 on average, beating wrong-state, mean-activation, random-activation, and shuffled-label controls. The contribution is a controlled benchmark and evaluation framework for transformer state-dynamics interpretability, with MCT as a simple reference pipeline

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 9 of its 25 references that are in the map. First posted on arXiv 20 May 2026.

Builds on

9 of 25 references.

Closest ancestors · 2

Same direction, newest first

  1. 2023Towards Automated Circuit Discovery for Mechanistic Interpretability28 Apr
  2. 2023Progress measures for grokking via mechanistic interpretability12 Jan

Other references · 7

  1. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  2. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
  3. 2016Understanding intermediate layers using linear classifier probescited by 1,353
  4. 2021Probing Classifiers: Promises, Shortcomings, and Advancescited by 876
  5. 2019Designing and Interpreting Probes with Control Taskscited by 640
  6. 2021Causal Abstractions of Neural Networkscited by 422
  7. 2018Interpreting recurrent neural networks behaviour via excitable network attractorscited by 15

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Measuring Uncertainty in Transformer Circuits with Effective Information Consistency
  2. 2025Two-Scale Latent Dynamics for Recurrent-Depth Transformers
  3. 2026Conditional Co-Ablation: Recovering Self-Repair Backups in Transformer Circuits
  4. 2025Dynamical Properties of Tokens in Self-Attention and Effects of Positional Encoding
  5. 2024Transformer Circuit Faithfulness Metrics are not Robust
  6. 2026CircuitProbe: Predicting Reasoning Circuits in Transformers via Stability Zone Detection
  7. 2026Training Trajectories Determine Circuit Removability in Annealable Soft-Prior Transformers
  8. 2025Finite State Automata Inside Transformers with Chain-of-Thought: A Mechanistic Study on State Tracking