Learning Sparse Neural Networks with Identity Layers
Not on the map. Why?
Abstract (arXiv)
The sparsity of Deep Neural Networks is well investigated to maximize the performance and reduce the size of overparameterized networks as possible. Existing methods focus on pruning parameters in the training process by using thresholds and metrics. Meanwhile, feature similarity between different layers has not been discussed sufficiently before, which could be rigorously proved to be highly correlated to the network sparsity in this paper. Inspired by interlayer feature similarity in overparameterized models, we investigate the intrinsic link between network sparsity and interlayer feature similarity. Specifically, we prove that reducing interlayer feature similarity based on Centered Kernel Alignment (CKA) improves the sparsity of the network by using information bottleneck theory. Applying such theory, we propose a plug-and-play CKA-based Sparsity Regularization for sparse network training, dubbed CKA-SR, which utilizes CKA to reduce feature similarity between layers and increase network sparsity. In other words, layers of our sparse network tend to have their own identity compared to each other. Experimentally, we plug the proposed CKA-SR into the training process of sparse network training methods and find that CKA-SR consistently improves the performance of several State-Of-The-Art sparse training methods, especially at extremely high sparsity. Code is included in the supplementary materials.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 43 of its 59 references that are in the map. First posted on arXiv 14 Jul 2023.
Builds on
43 of 59 references.
References · 43
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2022A ConvNet for the 2020scited by 3,545
31 more
- 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
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Searching for MobileNetV3cited by 1,984
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2021Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNetcited by 1,096
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2015Deep Learning and the Information Bottleneck Principlecited by 793
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2021Do Vision Transformers See Like Convolutional Neural Networks?cited by 671
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 318
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 241
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
- 2019Winning the Lottery with Continuous Sparsificationcited by 99
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2020Sanity-Checking Pruning Methods: Random Tickets can Win the Jackpotcited by 66
- 2018Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representationcited by 62
- 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
- 2019Discovering Neural Wiringscited by 56
- 2022Dual Lottery Ticket Hypothesiscited by 27
- 2020Knapsack Pruning with Inner Distillationcited by 20
- 2021An Information Theory-inspired Strategy for Automatic Network Pruningcited by 17
Built on by
Not cited yet.