Efficient Multi-Prize Lottery Tickets: Enhanced Accuracy, Training, and Inference Speed
Not on the map. Why?
Abstract (arXiv)
Recently, Diffenderfer and Kailkhura proposed a new paradigm for learning compact yet highly accurate binary neural networks simply by pruning and quantizing randomly weighted full precision neural networks. However, the accuracy of these multi-prize tickets (MPTs) is highly sensitive to the optimal prune ratio, which limits their applicability. Furthermore, the original implementation did not attain any training or inference speed benefits. In this report, we discuss several improvements to overcome these limitations. We show the benefit of the proposed techniques by performing experiments on CIFAR-10.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 9 references that are in the map. First posted on arXiv 26 Sep 2022.
Builds on
6 of 9 references.
References · 6
- 2019What's Hidden in a Randomly Weighted Neural Network?cited by 236
- 2020Rethinking the Hyperparameters for Fine-tuningcited by 69
- 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
- 2021Powerpropagation: A sparsity inducing weight reparameterisationcited by 49
- 2019PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devicescited by 48
- 2021Unsupervised Finetuningcited by 6
Built on by
Not cited yet.