Diffused Redundancy in Pre-trained Representations
On the map: Mechanistic interpretability → Sparse autoencoder training and evaluation
Abstract (arXiv)
Representations learned by pre-training a neural network on a large dataset are increasingly used successfully to perform a variety of downstream tasks. In this work, we take a closer look at how features are encoded in such pre-trained representations. We find that learned representations in a given layer exhibit a degree of diffuse redundancy, ie, any randomly chosen subset of neurons in the layer that is larger than a threshold size shares a large degree of similarity with the full layer and is able to perform similarly as the whole layer on a variety of downstream tasks. For example, a linear probe trained on 20% of randomly picked neurons from the penultimate layer of a ResNet50 pre-trained on ImageNet1k achieves an accuracy within 5% of a linear probe trained on the full layer of neurons for downstream CIFAR10 classification. We conduct experiments on different neural architectures (including CNNs and Transformers) pre-trained on both ImageNet1k and ImageNet21k and evaluate a variety of downstream tasks taken from the VTAB benchmark. We find that the loss and dataset used during pre-training largely govern the degree of diffuse redundancy and the "critical mass" of neurons needed often depends on the downstream task, suggesting that there is a task-inherent redundancy-performance Pareto frontier. Our findings shed light on the nature of representations learned by pre-trained deep neural networks and suggest that entire layers might not be necessary to perform many downstream tasks. We investigate the potential for exploiting this redundancy to achieve efficient generalization for downstream tasks and also draw caution to certain possible unintended consequences. Our code is available at urlhttps://github.com/nvedant07/diffused-redundancy.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Sparse autoencoder training and evaluation, one of 13 directions in Mechanistic interpretability. Builds on 44 of its 70 references that are in the map. First posted on arXiv 31 May 2023.
Builds on
44 of 70 references.
Closest ancestors · 1
Same direction, newest first
- 2022Toy Models of Superposition21 Sep
Other references · 43
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2016Understanding intermediate layers using linear classifier probescited by 1,353
31 more
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,319
- 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,254
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2020Concept Bottleneck Modelscited by 1,032
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2019Big Transfer (BiT): General Visual Representation Learningcited by 769
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
- 2019Green AIcited by 627
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 569
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2018A Survey on Deep Transfer Learningcited by 419
- 2014Understanding Deep Image Representations by Inverting Themcited by 403
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 370
- 2021ResNet strikes back: An improved training procedure in timmcited by 368
- 2015Understanding Neural Networks Through Deep Visualizationcited by 334
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 316
- 2018Slimmable Neural Networkscited by 305
- 2018Improving fairness in machine learning systems: What do industry practitioners need?cited by 262
- 2017Learning to Prune Deep Neural Networks via Layer-wise Optimal Brain Surgeoncited by 221
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
- 2020To be Robust or to be Fair: Towards Fairness in Adversarial Trainingcited by 137
- 2018A Unified Approach to Quantifying Algorithmic Unfairness: Measuring Individual & Group Unfairness via Inequality Indicescited by 97
- 2015Reducing Overfitting in Deep Networks by Decorrelating Representationscited by 94
- 2021Leveraging Sparse Linear Layers for Debuggable Deep Networkscited by 82
- 2018Fairness and Accountability Design Needs for Algorithmic Support in High-Stakes Public Sector Decision-Makingcited by 67
- 2020Fairness Through Robustness: Investigating Robustness Disparity in Deep Learningcited by 56
- 2023CFA: Class-wise Calibrated Fair Adversarial Trainingcited by 53
- 2022Measuring Representational Robustness of Neural Networks Through Shared Invariancescited by 11
Built on by
Citing papers per year: 2024: 1; 2025: 3; 2026: 1.
5 papers.
- 2024Understanding Visual Feature Reliance through the Lens of Complexitycited by 15
- 2025Merging Feed-Forward Sublayers for Compressed Transformerscited by 1
- 2025DOTResize: Reducing LLM Width via Discrete Optimal Transport-based Neuron Mergingcited by 1
- 2025Redundancy as a Structural Information Principle for Learning and Generalizationcited by 0
- 2026Select, Hypothesize and Verify: Towards Verified Neuron Concept Interpretationcited by 0
- 2026Select, Hypothesize and Verify: Towards Verified Neuron Concept Interpretation26 Mar 2026
- 2025Redundancy as a Structural Information Principle for Learning and Generalization13 Oct 2025
- 2025DOTResize: Reducing LLM Width via Discrete Optimal Transport-based Neuron Merging6 Jul 2025
- 2025Merging Feed-Forward Sublayers for Compressed Transformers10 Jan 2025
- 2024Understanding Visual Feature Reliance through the Lens of Complexity8 Jul 2024
Similar, not cited
Close in wording, no citation either way
- 2026Rescuing Points Trapped Inside Incorrect Decision Regions: A target for Evaluating and Improving Forward-Forward Learning
- 2023Do text-free diffusion models learn discriminative visual representations?
- 2025Optimal Depth of Neural Networks
- 2026Residual-Stream Burden Shapes Representation Learning in Diffusion Transformers
- 2026The Triangle of Similarity: A Multi-Faceted Framework for Comparing Neural Network Representations
- 2026Loss-Invariant Projections as Passive Probes of Learned Representations
- 2021Representation Consolidation for Training Expert Students
- 2024Identifying Sub-networks in Neural Networks via Functionally Similar Representations