mlsanityData to 7 Oct 2026

Certified Mechanistic Interpretability: Lifting Single-Input Findings to Bounded Neighbourhoods

arXiv 2609.26112 ↗First posted 17 Aug 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Mechanistic interpretability reverse-engineers transformer circuits one input at a time, leaving observed mechanisms without guarantees over bounded input neighbourhoods. We address this gap with a framework based on constrained polynomial-zonotope (CPZ) propagation that lifts mechanistic-interpretability observations from a single input to certified statements over a bounded set of perturbations. Three internal-attention queries (top-k stability, evidence mass, and attention entropy) are formulated as tractable programs over the simplex of attention weights, and CPZ propagation through transformer blocks is shown to preserve the softmax simplex and the LayerNorm zero-mean identity exactly. A recursive Jacobian zonotope construction extends the same certificates across layer depth by linearising the block stack at the input and avoids per-layer generator growth. We instantiate the framework on transformer attention; the resulting certificates offer a way to sharpen mechanistic statements that single-input inspection cannot resolve on its own, and to inform downstream decisions in regimes where empirical heuristics may be misleading.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 28 references that are in the map. First posted on arXiv 17 Aug 2026.

Builds on

17 of 28 references.

References · 17

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
  2. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  3. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  4. 2022In-context Learning and Induction Headscited by 930
  5. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  6. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  7. 2018On the Effectiveness of Interval Bound Propagation for Training Verifiably Robust Modelscited by 322
  8. 2016Adversarial Training Methods for Semi-Supervised Text Classificationcited by 280
  9. 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
  10. 2020The Lipschitz Constant of Self-Attentioncited by 171
  11. 2019Branch and Bound for Piecewise Linear Neural Network Verificationcited by 138
  12. 2020Robustness Verification for Transformerscited by 76
5 more
  1. 2020Verification of Deep Convolutional Neural Networks Using ImageStarscited by 75
  2. 2018RecurJac: An Efficient Recursive Algorithm for Bounding Jacobian Matrix of Neural Networks and Its Applicationscited by 27
  3. 2022Open- and Closed-Loop Neural Network Verification using Polynomial Zonotopescited by 24
  4. 2024Compact Proofs of Model Performance via Mechanistic Interpretabilitycited by 17
  5. 2025Data-Driven Nonconvex Reachability Analysis using Exact Multiplicationcited by 2

Built on by

Not cited yet.