mlsanityData to 7 Oct 2026

Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey

arXiv 2205.08099 ↗First posted 17 May 2022cs.LG cs.CV stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

State-of-the-art deep learning models have a parameter count that reaches into the billions. Training, storing and transferring such models is energy and time consuming, thus costly. A big part of these costs is caused by training the network. Model compression lowers storage and transfer costs, and can further make training more efficient by decreasing the number of computations in the forward and/or backward pass. Thus, compressing networks also at training time while maintaining a high performance is an important research topic. This work is a survey on methods which reduce the number of trained weights in deep learning models throughout the training. Most of the introduced methods set network parameters to zero which is called pruning. The presented pruning approaches are categorized into pruning at initialization, lottery tickets and dynamic sparse training. Moreover, we discuss methods that freeze parts of a network at its random initialization. By freezing weights, the number of trainable parameters is shrunken which reduces gradient computations and the dimensionality of the model's optimization space. In this survey we first propose dimensionality reduced training as an underlying mathematical model that covers pruning and freezing during training. Afterwards, we present and discuss different dimensionality reduced training methods.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 146 of its 208 references that are in the map. First posted on arXiv 17 May 2022.

Builds on

146 of 208 references.

References · 146

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  5. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  6. 2016Wide Residual Networkscited by 3,057
  7. 2019XLNet: Generalized Autoregressive Pretraining for Language Understandingcited by 2,801
  8. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  9. 2018Deep contextualized word representationscited by 2,285
  10. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  11. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  12. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
38 more
  1. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  2. 2015Spatial Transformer Networkscited by 1,423
  3. 2019Energy and Policy Considerations for Deep Learning in NLPcited by 1,242
  4. 2016Group Equivariant Convolutional Networkscited by 1,154
  5. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  6. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  7. 2019Big Transfer (BiT): General Visual Representation Learningcited by 766
  8. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  9. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  10. 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
  11. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
  12. 2019Green AIcited by 620
  13. 2018Exploring the Limits of Weakly Supervised Pretrainingcited by 604
  14. 2018Rethinking the Value of Network Pruningcited by 595
  15. 2020What is the State of Neural Network Pruning?cited by 578
  16. 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
  17. 2015BinaryConnect: Training Deep Neural Networks with binary weights during propagationscited by 571
  18. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  19. 2015Variational Dropout and the Local Reparameterization Trickcited by 489
  20. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
  21. 2019The State of Sparsity in Deep Neural Networkscited by 471
  22. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
  23. 2019Likelihood Ratios for Out-of-Distribution Detectioncited by 451
  24. 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
  25. 2020Meta Pseudo Labelscited by 372
  26. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  27. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  28. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
  29. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  30. 2015Norm-Based Capacity Control in Neural Networkscited by 299
  31. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
  32. 2020The Lottery Ticket Hypothesis for Pre-trained BERT Networkscited by 275
  33. 2018LQ-Nets: Learned Quantization for Highly Accurate and Compact Deep Neural Networkscited by 272
  34. 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
  35. 2018Learning Overparameterized Neural Networks via Stochastic Gradient Descent on Structured Datacited by 260
  36. 2015Tensorizing Neural Networkscited by 246
  37. 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
  38. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236

50 most cited of 146 All 146 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 4; 2025: 3; 2026: 1.

12 papers.