Sparse Inter-Layer Dependencies of Transformer FFN Neurons
Not on the map. Why?
Abstract (arXiv)
Feedforward network (FFN) blocks account for a large fraction of the parameters and computation in Transformer architectures, yet their internal structure remains difficult to interpret due to the additive superposition induced by the residual stream. We examine whether the activation of an FFN neuron can be explained by a sparse set of preceding neuron activations and attention outputs. We introduce a training-free attribution method that estimates the relative influence of upstream neurons and attention outputs on a target neuron's activation. Empirically, across models and layers, we find that small subsets of preceding activations and attention outputs suffice to preserve neuron activations with high fidelity when all remaining inputs are masked with their average values. Effective sparsity is even greater when accounting for the inherent activation sparsity of upstream layers. Moreover, applying the neuron-specific masks in all layers simultaneously, such that the induced deviations propagate through the network, leaves model perplexity largely unchanged at moderate sparsity levels. These results demonstrate that, despite dense parameterization, FFNs exhibit sparse and structured inter-layer dependencies at the neuron level. Our method provides a practical, scalable tool for circuit-level interpretability and identifies candidate sparse pathways with potential implications for efficient inference.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 31 of its 38 references that are in the map. First posted on arXiv 13 Jul 2026.
Builds on
31 of 38 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2017Learning Important Features Through Propagating Activation Differencescited by 1,454
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,307
- 2016Understanding intermediate layers using linear classifier probescited by 1,279
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2022Toy Models of Superpositioncited by 928
19 more
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2021Knowledge Neurons in Pretrained Transformerscited by 590
- 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 522
- 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2022Extracting Latent Steering Vectors from Pretrained Language Modelscited by 217
- 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
- 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2024AttnLRP: Attention-Aware Layer-Wise Relevance Propagation for Transformerscited by 116
- 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 100
- 2024Information Flow Routes: Automatically Interpreting Language Models at Scalecited by 92
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 91
- 2023Neurons in Large Language Models: Dead, N-gram, Positionalcited by 88
- 2023The MiniPile Challenge for Data-Efficient Language Modelscited by 74
- 2024GPT-2 Through the Lens of Vector Symbolic Architecturescited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Affinity-Aware Sharding for Delayed Tensor Parallelismcited by 0
- 2026Affinity-Aware Sharding for Delayed Tensor Parallelism12 Sep 2026