Entropy Reveals Block Importance in Masked Self-Supervised Vision Transformers
Not on the map. Why?
Abstract (arXiv)
Masked self-supervised vision transformers have become a dominant pretraining paradigm, yet their substantial model size poses significant challenges for resource-constrained deployment and efficient transfer learning. A fundamental question remains: are all transformer blocks equally important for downstream performance? In this paper, we show that block importance in masked self-supervised vision transformers can be accurately estimated without access to any data. Our key finding is that the information entropy of pretrained block weights strongly correlates with oracle sensitivity obtained via iterative block removal and finetuning. This observation enables Gardener, a data-free, one-shot, block-level pruning principle that identifies redundant blocks through simple information-theoretic measurements. We evaluate Gardener on VideoMAE-B across multiple pruning ratios and downstream video recognition benchmarks. Despite its negligible computational overhead, Gardener consistently matches or outperforms existing data-free pruning baselines and closely approaches sensitivity-based pruning. Remarkably, even after pruning up to 91.7% of blocks, the pruned model retains competitive transfer performance. Our results reveal substantial block-level redundancy in masked self-supervised vision transformers and demonstrate that information-theoretic analysis offers a principled and efficient pathway for model compression and resource-efficient transfer learning.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 3 Feb 2026.
Builds on
18 of 26 references.
References · 18
- 2017Attention Is All You Needcited by 59,932
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2017The Kinetics Human Action Video Datasetcited by 1,894
- 2022VideoMAE: Masked Autoencoders are Data-Efficient Learners for Self-Supervised Video Pre-Trainingcited by 1,305
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2017Variational Dropout Sparsifies Deep Neural Networkscited by 265
6 more
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Block Pruning For Faster Transformerscited by 176
- 2016Information Dropout: Learning Optimal Representations Through Noisy Computationcited by 131
- 2018Faster gaze prediction with dense networks and Fisher pruningcited by 92
- 2023Unified Data-Free Compression: Pruning and Quantization without Fine-Tuningcited by 22
- 2024Language Models as Zero-shot Lossless Gradient Compressors: Towards General Neural Parameter Prior Modelscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Does the VGGT Family Need All Its Layers?cited by 0
- 2026Does the VGGT Family Need All Its Layers?29 Sep 2026