From independent patches to coordinated attention: Controlling information flow in vision transformers
Not on the map. Why?
Abstract (arXiv)
We make the information transmitted by attention an explicit, measurable quantity in vision transformers. By inserting variational information bottlenecks on all attention-mediated writes to the residual stream -- without other architectural changes -- we train models with an explicit information cost and obtain a controllable spectrum from independent patch processing to fully expressive global attention. On ImageNet-100, we characterize how classification behavior and information routing evolve across this spectrum, and provide initial insights into how global visual representations emerge from local patch processing by analyzing the first attention heads that transmit information. By biasing learning toward solutions with constrained internal communication, our approach yields models that are more tractable for mechanistic analysis and more amenable to control.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 34 of its 49 references that are in the map. First posted on arXiv 4 Feb 2026.
Builds on
34 of 49 references.
References · 34
- 2017Attention Is All You Needcited by 59,932
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
- 2019RandAugment: Practical automated data augmentation with a reduced search spacecited by 2,261
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2017Deep Setscited by 1,394
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2019Contrastive Multiview Codingcited by 1,297
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2020Concept Bottleneck Modelscited by 1,022
- 2021Scaling Vision Transformerscited by 993
- 2016Deep Variational Information Bottleneckcited by 915
22 more
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2018This Looks Like That: Deep Learning for Interpretable Image Recognitioncited by 731
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
- 2022What learning algorithm is in-context learning? Investigations with linear modelscited by 671
- 2020Transformer Interpretability Beyond Attention Visualizationcited by 620
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 359
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
- 2023Similarity of Neural Network Models: A Survey of Functional and Representational Measurescited by 128
- 2021IA-RED2: Interpretability-Aware Redundancy Reduction for Vision Transformerscited by 127
- 2024AttnLRP: Attention-Aware Layer-Wise Relevance Propagation for Transformerscited by 116
- 2020Restricting the Flow: Information Bottlenecks for Attributioncited by 110
- 2023What Do Self-Supervised Vision Transformers Learn?cited by 90
- 2024How to think step-by-step: A mechanistic understanding of chain-of-thought reasoningcited by 53
- 2022Learning to Estimate Shapley Values with Vision Transformerscited by 44
- 2025From Colors to Classes: Emergence of Concepts in Vision Transformerscited by 23
- 2023Information decomposition in complex systems via machine learningcited by 9
- 2022Interpretability with full complexity by constraining feature informationcited by 7
- 2025Comprehensive Information Bottleneck for Unveiling Universal Attribution to Interpret Vision Transformerscited by 6
- 2024Comparing the information content of probabilistic representation spacescited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.