mlsanityData to 14 Oct 2026

Weight Concentration Regularization for Improving Pruning Robustness Under High Sparsity

arXiv 2511.14282 ↗First posted 18 Nov 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep neural networks achieve outstanding performance across vision and language tasks, yet their large parameter counts limit deployment in resource-constrained settings. One-shot pruning reduces model size without retraining, but models trained with standard objectives often suffer substantial accuracy drops under aggressive sparsity. Prior work mitigates this drop along two directions: regularizers such as ℓ1 and DeepHoyer that shape the weight distribution during training, and pruning-robust optimizers such as SAM, CrAM, and S2SAM that flatten the loss landscape. However, existing regularizers either shrink all weights uniformly (ℓ1) or induce scale-invariant sparsity (DeepHoyer), without concentrating weight energy onto a small set of informative parameters. We propose a Weight Concentration Regularizer (WCR), a training-time regularizer that amplifies the magnitude of a small subset of parameters while driving the remainder toward zero, so that magnitude pruning predominantly removes parameters with negligible functional contribution. We provide a convergence analysis and evaluate WCR on LLM fine-tuning, image classification, and medical segmentation, demonstrating consistent improvements in pruning robustness across architectures and compatibility with existing pruning-robust optimizers.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 37 references that are in the map. First posted on arXiv 18 Nov 2025.

Builds on

27 of 37 references.

References · 27

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
  4. 2024The Llama 3 Herd of Modelscited by 14,715
  5. 2024Qwen2.5 Technical Reportcited by 4,942
  6. 2016Wide Residual Networkscited by 3,070
  7. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  8. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  9. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  10. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
  11. 2016Pruning Filters for Efficient ConvNetscited by 1,143
  12. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
15 more
  1. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  2. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
  3. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 702
  4. 2018Rethinking the Value of Network Pruningcited by 599
  5. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
  6. 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 479
  7. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  8. 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
  9. 2019On the Linear Speedup Analysis of Communication Efficient Momentum SGD for Distributed Non-Convex Optimizationcited by 180
  10. 2023Handbook of Convergence Theorems for (Stochastic) Gradient Methodscited by 163
  11. 2019Association of genomic subtypes of lower-grade gliomas with shape features automatically extracted by a deep learning algorithmcited by 77
  12. 2018Can We Gain More from Orthogonality Regularizations in Training Deep CNNs?cited by 62
  13. 2017All You Need is Beyond a Good Init: Exploring Better Solution for Training Extremely Deep Convolutional Neural Networks with Orthonormality and Modulationcited by 58
  14. 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
  15. 2022Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Modelscited by 20

Built on by

Not cited yet.