A benchmark shows most time-series Transformers tolerate about 50% unstructured pruning without clear accuracy loss, while structured pruning rarely delivers meaningful inference speedups.
Recent Advances on Neural Network Pruning at Initialization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Neural network pruning typically removes connections or neurons from a pretrained converged model; while a new pruning paradigm, pruning at initialization (PaI), attempts to prune a randomly initialized network. This paper offers the first survey concentrated on this emerging pruning fashion. We first introduce a generic formulation of neural network pruning, followed by the major classic pruning topics. Then, as the main body of this paper, a thorough and structured literature review of PaI methods is presented, consisting of two major tracks (sparse training and sparse selection). Finally, we summarize the surge of PaI compared to PaT and discuss the open problems. Apart from the dedicated literature review, this paper also offers a code base for easy sanity-checking and benchmarking of different PaI methods.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A Comparative Study of Pruning Methods in Transformer-based Time Series Forecasting
A benchmark shows most time-series Transformers tolerate about 50% unstructured pruning without clear accuracy loss, while structured pruning rarely delivers meaningful inference speedups.