Dense for the Price of Sparse: Improved Performance of Sparsely Initialized Networks via a Subspace Offset
Not on the map. Why?
Abstract (arXiv)
That neural networks may be pruned to high sparsities and retain high accuracy is well established. Recent research efforts focus on pruning immediately after initialization so as to allow the computational savings afforded by sparsity to extend to the training process. In this work, we introduce a new `DCT plus Sparse' layer architecture, which maintains information propagation and trainability even with as little as 0.01% trainable kernel parameters remaining. We show that standard training of networks built with these layers, and pruned at initialization, achieves state-of-the-art accuracy for extreme sparsities on a variety of benchmark network architectures and datasets. Moreover, these results are achieved using only simple heuristics to determine the locations of the trainable parameters in the network, and thus without having to initially store or compute with the full, unpruned network, as is required by competing prune-at-initialization algorithms. Switching from standard sparse layers to DCT plus Sparse layers does not increase the storage footprint of a network and incurs only a small additional computational overhead.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 21 of its 27 references that are in the map. First posted on arXiv 12 Feb 2021.
Builds on
21 of 27 references.
References · 21
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2020What is the State of Neural Network Pruning?cited by 578
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
9 more
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2019Parameter Efficient Training of Deep Convolutional Neural Networks by Dynamic Sparse Reparameterizationcited by 187
- 2020Pruning Neural Networks at Initialization: Why are We Missing the Mark?cited by 181
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
- 2020Progressive Skeletonization: Trimming more fat from a network at initializationcited by 64
- 2020Pruning Algorithms to Accelerate Convolutional Neural Networks for Edge Applications: A Surveycited by 26
- 2015Caffe con Troll: Shallow Ideas to Speed Up Deep Learningcited by 4
- 2018Deep learning for pedestrians: backpropagation in CNNscited by 3
Built on by
Citing papers per year: 2021: 2; 2022: 3; 2023: 2; 2024: 2.
9 papers.
- 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
- 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
- 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networkscited by 18
- 2021Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsitycited by 14
- 2022Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Surveycited by 12
- 2024Navigating Extremes: Dynamic Sparsity in Large Output Spacescited by 3
- 2023BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardwarecited by 1
- 2023Revisiting Implicit Models: Sparsity Trade-offs Capability in Weight-tied Model for Vision Taskscited by 0
- 2024Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruningcited by 0
- 2024Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning20 Nov 2024
- 2024Navigating Extremes: Dynamic Sparsity in Large Output Spaces5 Nov 2024
- 2023Revisiting Implicit Models: Sparsity Trade-offs Capability in Weight-tied Model for Vision Tasks16 Jul 2023
- 2023BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardware30 Mar 2023
- 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunities13 Oct 2022
- 2022Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks18 Jul 2022
- 2022Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey17 May 2022
- 2021Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity5 Jul 2021
- 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity28 Jun 2021