Skip to content

Interior interpretability with attention rollout: contraction and propagation profiles in Transformers

Jul 2026 · arXiv.org · Vol abs/2607.22367 · 0 citations · 41 references
Computer Science

TL;DR

Attention rollout is used here as a diagnostic of attention-mediated propagation, not as a causal explanation or faithful attribution of the complete Transformer, but as a structural interpretation to the corresponding rollout propagation profile.

Abstract

Feature-attribution methods assign scores relating input variables to a model's output, but do not by themselves characterize how explicitly defined interaction operators compose across its intermediate layers. We introduce \emph{interior interpretability}, a propagation-based perspective on internal model organization, and instantiate it for tabular Transformers using attention rollout. We interpret rollout as a row-stochastic operator encoding attention-mediated propagation between feature tokens. By applying classical Doeblin--Dobrushin contraction theory, we show that a rollout operator with a small Dobrushin coefficient is quantitatively close to a rank-one stochastic matrix whose common row is determined by its normalized column sums. This result gives a structural interpretation to the corresponding rollout propagation profile. In Transformers trained for metabolomic age prediction, the measured rollout contraction strengthens with depth. Trained and randomly initialized models also exhibit different propagation profiles, although the present experiments do not establish the predictive relevance of individual rollout-ranked variables. Exploratory comparisons with PCA and GradientExplainer approximations to SHAP reveal localized agreement among highly ranked variables but weak agreement across complete rankings. Attention rollout is therefore used here as a diagnostic of attention-mediated propagation, not as a causal explanation or faithful attribution of the complete Transformer.

View source

Similar papers

#machine learning Preprint Sep 2026

LLMs as Feature Engineers for Text-and-Tabular Prediction

An iterative framework that automates the extraction of interpretable, schema-bound categorical features from unstructured text for tabular prediction models that guarantees instance-level interpretability and provides a fully transparent, semantic audit trail for every prediction.

Merwan Barlier, Blaž Škrlj · 1 citation
Preprint Aug 2026

Attention-Path Fragility as an Uncertainty Signal in Large Language Models

It is proposed that a model's uncertainty about a token is reflected not only in the breadth of its output distribution but also in whether a confident prediction is \emph{fragile} under perturbation of its attention pathways, a training-free estimator that masks attention heads and measures the BALD mutual information...

Minsoo Kim, Sungyoung Ji, Kisung Moon et al. · 0 citations
Preprint Aug 2026

Circuit Condensation: Post-Training that Concentrates a Behavior's Causal Circuit

Circuit Condensation is introduced, which post-trains models to concentrate behaviors into smaller causal graphs, which are smaller than the strongest frozen baseline in 30 of 32 settings, and shows that weight updates, rather than search alone, drive the reduction.

Sailesh I. S. Kumar · 0 citations
#machine learning Preprint Sep 2026

Scalable Attribution and Control of Model Behavior During Training

The Batch-Space Ghost (BS-Ghost) algorithm makes these scores practical inside the training loop through shared computation in batch space, without storing model-sized example gradients, and demonstrates that BGU identifies data that causally shapes final behavior.

S. Abdelghafar · 0 citations

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