paper-with-me

Papers

OSSuM: A Gradient-Free Approach For Pruning Neural Networks At Initialization

2021-09-29 · Vinu Sankar Sadasivan, Jayesh Malaviya, Anirban Dasgupta

Pruning overparameterized neural networks to obtain memory-and-compute-efficient sparse networks is an active area of research. Recent works attempt to prune neural networks at initialization to design sparse networks that can be trained efficiently. In this paper we propose One-Shot Supermasking (OSSuM), a gradient-free, compute-efficient technique to efficiently prune neurons in fully-connected networks. In theory we frame this problem as a neuron subset selection problem, wherein we prune neurons to obtain a better accuracy by optimizing on the cross-entropy loss. In our experiments we show that OSSuM can perform similar to gradient-based pruning techniques at initialization, prior to training. For example, OSSuM can achieve a test set accuracy of $82.4\%$ on MNIST by pruning a 2-layer fully-connected neural network at initialization with just a single forward-pass over the training data. Further, we empirically demonstrate that OSSuM can be used to efficiently prune trained networks as well. We also propose various variants of OSSuM that can be used to prune deeper neural networks.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Test 설명 없음
Pruning 설명 없음

Similar Papers 제목 키워드 기반

A Signal Propagation Perspective for Pruning Neural Networks at Initialization

2019-06-14 · ICLR 2020 1 · Namhoon Lee, Thalaiyasingam Ajanthan, Stephen Gould, Philip H. S. Torr

Network pruning is a promising avenue for compressing deep neural networks. A typical approach to pruning starts by training a model and then removing redundant parameters while minimizing the impact on what is learned. …

image-classificationImage ClassificationNetwork PruningSensitivity

Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability

2023-05-31 · Robert Tjarko Lange, Henning Sprekeler

Is the lottery ticket phenomenon an idiosyncrasy of gradient-based training or does it generalize to evolutionary optimization? In this paper we establish the existence of highly sparse trainable initializations for evol…

Inductive BiasLinear Mode ConnectivityNetwork Pruning

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

2022-05-17 · Paul Wimmer, Jens Mehnert, Alexandru Paul Condurache

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 b…

Model CompressionSurvey

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 외

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 …

Lottery Tickets with Nonzero Biases

2021-10-21 · Jonas Fischer, Advait Gadhikar, Rebekka Burkholz

The strong lottery ticket hypothesis holds the promise that pruning randomly initialized deep neural networks could offer a computationally efficient alternative to deep learning with stochastic gradient descent. Common …