Why Random Pruning Is All We Need to Start Sparse

• Published in: arXiv.org
• Main Authors: Gadhikar, Advait, Mukherjee, Sohom, Burkholz, Rebekka
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 31.05.2023
• Subjects: Algorithms; Image classification; Masks; Neural networks; Sparsity; Target masking
• ISSN: 2331-8422

Random masks define surprisingly effective sparse neural network models, as has been shown empirically. The resulting sparse networks can often compete with dense architectures and state-of-the-art lottery ticket pruning algorithms, even though they do not rely on computationally expensive prune-train iterations and can be drawn initially without significant computational overhead. We offer a theoretical explanation of how random masks can approximate arbitrary target networks if they are wider by a logarithmic factor in the inverse sparsity \(1 / \log(1/\text{sparsity})\). This overparameterization factor is necessary at least for 3-layer random networks, which elucidates the observed degrading performance of random networks at higher sparsity. At moderate to high sparsity levels, however, our results imply that sparser networks are contained within random source networks so that any dense-to-sparse training scheme can be turned into a computationally more efficient sparse-to-sparse one by constraining the search to a fixed random mask. We demonstrate the feasibility of this approach in experiments for different pruning methods and propose particularly effective choices of initial layer-wise sparsity ratios of the random source network. As a special case, we show theoretically and experimentally that random source networks also contain strong lottery tickets.