mlsanityData to 7 Oct 2026

Weight Reparametrization for Budget-Aware Network Pruning

arXiv 2107.03909 ↗First posted 8 Jul 2021cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

Pruning seeks to design lightweight architectures by removing redundant weights in overparameterized networks. Most of the existing techniques first remove structured sub-networks (filters, channels,...) and then fine-tune the resulting networks to maintain a high accuracy. However, removing a whole structure is a strong topological prior and recovering the accuracy, with fine-tuning, is highly cumbersome. In this paper, we introduce an "end-to-end" lightweight network design that achieves training and pruning simultaneously without fine-tuning. The design principle of our method relies on reparametrization that learns not only the weights but also the topological structure of the lightweight sub-network. This reparametrization acts as a prior (or regularizer) that defines pruning masks implicitly from the weights of the underlying network, without increasing the number of training parameters. Sparsity is induced with a budget loss that provides an accurate pruning. Extensive experiments conducted on the CIFAR10 and the TinyImageNet datasets, using standard architectures (namely Conv4, VGG19 and ResNet18), show compelling results without fine-tuning.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 25 references that are in the map. First posted on arXiv 8 Jul 2021.

Builds on

20 of 25 references.

References · 20

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  4. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
  5. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  7. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  8. 2014FitNets: Hints for Thin Deep Netscited by 1,619
  9. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  10. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  11. 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
  12. 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
8 more
  1. 2017Deep Mutual Learningcited by 621
  2. 2019Improved Knowledge Distillation via Teacher Assistantcited by 567
  3. 2019Variational Information Distillation for Knowledge Transfercited by 321
  4. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  5. 2013Predicting Parameters in Deep Learningcited by 223
  6. 2015Structured Pruning of Deep Convolutional Neural Networkscited by 148
  7. 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
  8. 2019Differentiable Mask for Pruning Convolutional and Recurrent Networkscited by 10

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.