iterative magnitude pruning

Fast Track to Winning Tickets: Repowering One-Shot Pruning for Graph Neural Networks AAAI 2025 Masks, Signs, And Learning Rate Rewinding ICLR 2024 Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging ICLR 2024 Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruning ICLR 2024 Instant Soup: Cheap Pruning Ensembles in A Single Pass Can Draw Lottery Tickets from Large Models ICML 2023 Quantifying lottery tickets under label noise: accuracy, calibration, and complexity UAI 2023 The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter NeurIPS 2023 Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask? ICLR 2023 Advancing Model Pruning via Bi-level Optimization NeurIPS 2022 Analyzing Lottery Ticket Hypothesis from PAC-Bayesian Theory Perspective NeurIPS 2022 Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets ICML 2022 Dual Lottery Ticket Hypothesis ICLR 2022 Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks NeurIPS 2022 On Lottery Tickets and Minimal Task Representations in Deep Reinforcement Learning ICLR 2022 Universality of Winning Tickets: A Renormalization Group Perspective ICML 2022 Winning Lottery Tickets in Deep Generative Models AAAI 2021 Linear Mode Connectivity and the Lottery Ticket Hypothesis ICML 2020