The Information Pathways Hypothesis: Transformers are Dynamic Self-Ensembles
Not on the map. Why?
Abstract (arXiv)
Transformers use the dense self-attention mechanism which gives a lot of flexibility for long-range connectivity. Over multiple layers of a deep transformer, the number of possible connectivity patterns increases exponentially. However, very few of these contribute to the performance of the network, and even fewer are essential. We hypothesize that there are sparsely connected sub-networks within a transformer, called information pathways which can be trained independently. However, the dynamic (i.e., input-dependent) nature of these pathways makes it difficult to prune dense self-attention during training. But the overall distribution of these pathways is often predictable. We take advantage of this fact to propose Stochastically Subsampled self-Attention (SSA) - a general-purpose training strategy for transformers that can reduce both the memory and computational cost of self-attention by 4 to 8 times during training while also serving as a regularization method - improving generalization over dense training. We show that an ensemble of sub-models can be formed from the subsampled pathways within a network, which can achieve better performance than its densely attended counterpart. We perform experiments on a variety of NLP, computer vision and graph learning tasks in both generative and discriminative settings to provide empirical evidence for our claims and show the effectiveness of the proposed method.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 52 of its 73 references that are in the map. First posted on arXiv 2 Jun 2023.
Builds on
52 of 73 references.
References · 52
- 2017Attention Is All You Needcited by 60,106
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,304
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,043
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,223
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,549
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,111
- 2016Layer Normalizationcited by 5,624
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,539
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,430
- 2016Gaussian Error Linear Units (GELUs)cited by 3,472
- 2020Longformer: The Long-Document Transformercited by 3,393
38 more
- 2016Pointer Sentinel Mixture Modelscited by 3,047
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,017
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,994
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,835
- 2020Big Bird: Transformers for Longer Sequencescited by 1,681
- 2020Reformer: The Efficient Transformercited by 1,662
- 2020Rethinking Attention with Performerscited by 1,594
- 2019Generating Long Sequences with Sparse Transformerscited by 1,538
- 2019fairseq: A Fast, Extensible Toolkit for Sequence Modelingcited by 1,487
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,469
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,202
- 2016Pruning Filters for Efficient ConvNetscited by 1,138
- 2018Self-Attention with Relative Position Representationscited by 1,116
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,093
- 2016Deep Networks with Stochastic Depthcited by 977
- 2019Are Sixteen Heads Really Better than One?cited by 807
- 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 797
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 707
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 470
- 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 469
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 436
- 2017Snapshot Ensembles: Train 1, get M for freecited by 350
- 2021OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphscited by 329
- 2021Do Transformers Really Perform Bad for Graph Representation?cited by 319
- 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
- 2018Adaptive Input Representations for Neural Language Modelingcited by 226
- 2021Rethinking and Improving Relative Position Encoding for Vision Transformercited by 207
- 2018Character-Level Language Modeling with Deeper Self-Attentioncited by 138
- 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
- 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 113
- 2020Shortformer: Better Language Modeling using Shorter Inputscited by 76
- 2022GRPE: Relative Positional Encoding for Graph Transformercited by 69
- 2016Efficient softmax approximation for GPUscited by 67
- 2021Combiner: Full Attention Transformer with Sparse Computation Costcited by 64
- 2020Scheduled DropHead: A Regularization Method for Transformer Modelscited by 28
- 2021Simple Local Attentions Remain Competitive for Long-Context Taskscited by 25
- 2019DropAttention: A Regularization Method for Fully-Connected Self-Attention Networkscited by 20
50 most cited of 52 All 52 (JSON)
Built on by
Citing papers per year: 2024: 2; 2025: 1; 2026: 1.
4 papers.
- 2024Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformerscited by 12
- 2024Disrupting Diffusion-based Inpainters with Semantic Digressioncited by 8
- 2026FACTUM: Mechanistic Detection of Citation Hallucination in Long-Form RAGcited by 6
- 2025FAS: Fast ANN-SNN Conversion for Spiking Large Language Modelscited by 1
- 2026FACTUM: Mechanistic Detection of Citation Hallucination in Long-Form RAG9 Jan 2026
- 2025FAS: Fast ANN-SNN Conversion for Spiking Large Language Models6 Feb 2025
- 2024Disrupting Diffusion-based Inpainters with Semantic Digression14 Jul 2024
- 2024Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers7 Feb 2024