paper-with-me

Papers

Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradients

2022-02-16 · ICLR 2022 4 · Milad Alizadeh, Shyam A. Tailor, Luisa M Zintgraf, Joost van Amersfoort, Sebastian Farquhar, Nicholas Donald Lane, Yarin Gal

Pruning neural networks at initialization would enable us to find sparse models that retain the accuracy of the original network while consuming fewer computational resources for training and inference. However, current methods are insufficient to enable this optimization and lead to a large degradation in model performance. In this paper, we identify a fundamental limitation in the formulation of current methods, namely that their saliency criteria look at a single step at the start of training without taking into account the trainability of the network. While pruning iteratively and gradually has been shown to improve pruning performance, explicit consideration of the training stage that will immediately follow pruning has so far been absent from the computation of the saliency criterion. To overcome the short-sightedness of existing methods, we propose Prospect Pruning (ProsPr), which uses meta-gradients through the first few steps of optimization to determine which weights to prune. ProsPr combines an estimate of the higher-order effects of pruning on the loss and the optimization trajectory to identify the trainable sub-network. Our method achieves state-of-the-art pruning performance on a variety of vision classification tasks, with less data and in a single shot compared to existing pruning-at-initialization methods.

📄 PDF Abstract BibTeX arXiv:2202.08132

Code (1)

mil-ad/prospr 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Rare Gems: Finding Lottery Tickets at Initialization

2022-02-24 · Kartik Sreenivasan, Jy-yong Sohn, Liu Yang, Matthew Grinde 외

Large neural networks can be pruned to a small fraction of their original size, with little loss in accuracy, by following a time-consuming "train, prune, re-train" approach. Frankle & Carbin conjecture that we can avoid…

The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networks

2018-03-09 · ICLR 2019 5 · Jonathan Frankle, Michael Carbin

Neural network pruning techniques can reduce the parameter counts of trained networks by over 90%, decreasing storage requirements and improving computational performance of inference without compromising accuracy. Howev…

Network Pruning

Pruning neural networks without any data by iteratively conserving synaptic flow

2020-06-09 · NeurIPS 2020 12 · Hidenori Tanaka, Daniel Kunin, Daniel L. K. Yamins, Surya Ganguli

Pruning the parameters of deep neural networks has generated intense interest due to potential savings in time, memory and energy both during training and at test time. Recent works have identified, through an expensive …

Towards Data-Agnostic Pruning At Initialization: What Makes a Good Sparse Mask?

2023-09-21 · NeurIPS 2023 11

Pruning at initialization (PaI) aims to remove weights of neural networks before training in pursuit of training efficiency besides the inference. While off-the-shelf PaI methods manage to find trainable subnetworks that…

Why is Pruning at Initialization Immune to Reinitializing and Shuffling?

2021-07-05 · Sahib Singh, Rosanne Liu

Recent studies assessing the efficacy of pruning neural networks methods uncovered a surprising finding: when conducting ablation studies on existing pruning-at-initialization methods, namely SNIP, GraSP, SynFlow, and ma…