.png){kind=icon}
.png){kind=icon}
Return
Pruning at Initialization – A Sketching Perspective
.png){kind=icon}
PRE
AI
DOI：10.1109/TPAMI.2025.3598343.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The lottery ticket hypothesis (LTH) has increased attention to pruning neural networks at initialization. We study this problem in the linear setting. We show that finding a sparse mask at initialization is equivalent to the sketching problem introduced for efficient matrix multiplication. This gives us tools to analyze the LTH problem and gain insights into it. Specifically, using the mask found at initialization, we bound the approximation error of the pruned linear model at the end of training. We theoretically justify previous empirical evidence that the search for sparse networks may be data independent. By using the sketching perspective, we suggest a generic improvement to existing algorithms for pruning at initialization, which we show to be beneficial in the data-independent case.
Keywords:
Deep neural networks
machine learning
pruning at initialization
sketching
unsupervised learning
Journal
IF:
18.6
Papers:
831
Citations:
9.8W