Picking Winning Tickets Before Training by Preserving Gradient Flow
Not on the map. Why?
Abstract (arXiv)
Overparameterization has been shown to benefit both the optimization and generalization of neural networks, but large networks are resource hungry at both training and test time. Network pruning can reduce test-time resource requirements, but is typically applied to trained networks and therefore cannot avoid the expensive training process. We aim to prune networks at initialization, thereby saving resources at training time as well. Specifically, we argue that efficient training requires preserving the gradient flow through the network. This leads to a simple but effective pruning criterion we term Gradient Signal Preservation (GraSP). We empirically investigate the effectiveness of the proposed method with extensive experiments on CIFAR-10, CIFAR-100, Tiny-ImageNet and ImageNet, using VGGNet and ResNet architectures. Our method can prune 80% of the weights of a VGG-16 network on ImageNet at initialization, with only a 1.6% drop in top-1 accuracy. Moreover, our method achieves significantly better performance than the baseline at extreme sparsity levels.
Key facts. Cited by 467 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 81; 2022: 92; 2023: 87; 2024: 90; 2025: 73; 2026: 44.
467 papers.
Sort:
By area:
- 2023Model Sparsity Can Simplify Machine Unlearningcited by 206
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 168
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2021How Powerful are Performance Predictors in Neural Architecture Search?cited by 88
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
38 more
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
- 2022SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapterscited by 83
- 2021MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edgecited by 77
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2021Zen-NAS: A Zero-Shot NAS for High-Performance Deep Image Recognitioncited by 71
- 2021Only Train Once: A One-Shot Neural Network Training And Pruning Frameworkcited by 70
- 2021Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracycited by 62
- 2023Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMscited by 61
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 60
- 2021Initialization and Regularization of Factorized Neural Layerscited by 58
- 2023ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradientscited by 57
- 2021Multi-Prize Lottery Ticket Hypothesis: Finding Accurate Binary Neural Networks by Pruning A Randomly Weighted Networkcited by 55
- 2022SparCL: Sparse Continual Learning on the Edgecited by 55
- 2022Advancing Model Pruning via Bi-level Optimizationcited by 55
- 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 54
- 2023LoRAPrune: Structured Pruning Meets Low-Rank Parameter-Efficient Fine-Tuningcited by 53
- 2021Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?cited by 52
- 2021Multi-Modal Temporal Attention Models for Crop Mapping from Satellite Time Seriescited by 49
- 2021Meta-Learning Sparse Implicit Neural Representationscited by 48
- 2021Playing Lottery Tickets with Vision and Languagecited by 45
- 2021Effective Sparsification of Neural Networks with Global Sparsity Constraintcited by 45
- 2021Efficient Lottery Ticket Finding: Less Data is Morecited by 44
- 2021Heavy Tails in SGD and Compressibility of Overparametrized Neural Networkscited by 44
- 2021Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsitycited by 44
- 2023The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Mattercited by 42
- 2021Recent Advances on Neural Network Pruning at Initializationcited by 41
- 2022Sparsity Winning Twice: Better Robust Generalization from More Efficient Trainingcited by 41
- 2022The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networkscited by 41
- 2023Scaling Laws for Sparsely-Connected Foundation Modelscited by 41
- 2022Structural Pruning via Latency-Saliency Knapsackcited by 40
- 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
- 2021Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AIcited by 38
- 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
- 2023A Survey on Efficient Training of Transformerscited by 37
- 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
50 most cited of 467 All 467 (JSON)
- 2026Dissecting Representation Structure in Vision Transformers: A Rigorous Architectural Study8 Oct 2026
- 2026Prediction-powered Neural Architecture Search1 Oct 2026
- 2026Beyond Sparsity: Weight Location and Network Context in Pruned MRI Reconstruction25 Sep 2026
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning21 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distances14 Sep 2026
- 2026CoRA-NAS: Coarse Ranking and Anchor-Residual Refinement for Neural Architecture Search10 Sep 2026
- 2026Physics-Informed Foresight Pruning for Sparse PINN Solvers of Nonlinear PDEs26 Aug 2026
- 2026Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimation25 Aug 2026
- 2026Bi-EZP: LLM-Guided Bilevel Program Evolution for Ensemble Zero-Cost Proxy Discovery22 Aug 2026
- 2026Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth17 Aug 2026
- 2026Activation-Energy Pruning for Spiking Neural Networks: Unsupervised Personalization via Spike-Count Saliency11 Aug 2026
38 more
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Models7 Aug 2026
- 2026Lottery Tickets Are Not Deployment Tickets29 Jul 2026
- 2026FedASAP: Activation Statistics-driven Structured Adaptive Pruning for Efficient Personalized Federated Learning for Lesion Segmentation on brain MRI20 Jul 2026
- 2026Double-Scoring: Reliable Extraction of Strong Lottery Tickets15 Jul 2026
- 2026Aurora: A Leverage-Aware Spectral Optimizer26 Jun 2026
- 2026InTrain: Intrinsic Trainability for Zero-Cost Neural Architecture Search17 Jun 2026
- 2026Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning10 Jun 2026
- 2026Can We Predict The Human Preference For Text-to-Image Content Prior To Generation And Is It Even Useful To Do So?3 Jun 2026
- 2026Beyond Structural Symmetries: Linear Mode Connectivity via Neuron Identifiability3 Jun 2026
- 2026Toy Combinatorial Interpretability Models Reveal Lottery Tickets in Early Feature Space18 May 2026
- 2026Turning Stale Gradients into Stable Gradients: Coherent Coordinate Descent with Implicit Landscape Smoothing for Lightweight Zeroth-Order Optimization14 May 2026
- 2026Not How Many, But Which: Parameter Placement in Low-Rank Adaptation12 May 2026
- 2026Zero-Shot Neural Network Evaluation with Sample-Wise Activation Patterns8 May 2026
- 2026FED-FSTQ: Fisher-Guided Token Quantization for Communication-Efficient Federated Fine-Tuning of LLMs on Edge Devices28 Apr 2026
- 2026FedProxy: Federated Fine-Tuning of LLMs via Proxy SLMs and Heterogeneity-Aware Fusion21 Apr 2026
- 2026Efficient Search of Implantable Adaptive Cells for Medical Image Segmentation16 Apr 2026
- 2026Heterogeneous Connectivity in Sparse Networks: Fan-in Profiles, Gradient Hierarchy, and Topological Equilibria12 Apr 2026
- 2026Engineering Resource-constrained Software Systems with DNN Components: a Concept-based Pruning Approach11 Apr 2026
- 2026Growing Networks with Autonomous Pruning20 Mar 2026
- 2026Mix-and-Match Pruning: Globally Guided Layer-Wise Sparsification of DNNs17 Mar 2026
- 2026ZO-SAM: Zero-Order Sharpness-Aware Minimization for Efficient Sparse Training13 Mar 2026
- 2026Alternating Gradient Flow Utility: A Unified Metric for Structural Pruning and Dynamic Routing in Deep Networks12 Mar 2026
- 2026HiPP-Prune: Hierarchical Preference-Conditioned Structured Pruning for Vision-Language Models6 Mar 2026
- 2026Bayesian Lottery Ticket Hypothesis21 Feb 2026
- 2026RNM-TD3: N:M Semi-structured Sparse Reinforcement Learning From Scratch16 Feb 2026
- 2026Pruning at Initialisation through the lens of Graphon Limit: Convergence, Expressivity, and Generalisation6 Feb 2026
- 2026It's Not a Lottery, It's a Race: Understanding How Gradient Descent Adapts the Network's Capacity to the Task4 Feb 2026
- 2026Topology-Aware Revival for Efficient Sparse Training4 Feb 2026
- 2026Towards Compact and Robust DNNs via Compression-aware Sharpness Minimization28 Jan 2026
- 2026Post-Training Neural Network Pruning using Graph Curvature22 Jan 2026
- 2026Spectral Complex Autoencoder Pruning: A Fidelity-Guided Criterion for Extreme Structured Channel Compression14 Jan 2026
- 2026Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Masking7 Jan 2026
- 2025TPV: Parameter Perturbations Through the Lens of Test Prediction Variance11 Dec 2025
- 2025Renormalizable Spectral-Shell Dynamics as the Origin of Neural Scaling Laws11 Dec 2025
- 2025Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search8 Dec 2025
- 2025Neural expressiveness for beyond importance model compression6 Dec 2025
- 2025Data Curation Through the Lens of Spectral Dynamics: Static Limits, Dynamic Acceleration, and Practical Oracles2 Dec 2025
- 2025Weight Concentration Regularization for Improving Pruning Robustness Under High Sparsity18 Nov 2025
50 newest of 467 All 467 (JSON)
- 2023DeepPCR: Parallelizing Sequential Operations in Neural Networkscited by 9
- 2025Continual Unlearning for Text-to-Image Diffusion Models: A Regularization Perspectivecited by 9
- 2025Pruning for Sparse Diffusion Models based on Gradient Flowcited by 5
- 2025Towards efficient quantum algorithms for diffusion probabilistic modelscited by 4
- 2024Efficient Training with Denoised Neural Weightscited by 2
- 2025Sparse-to-Sparse Training of Diffusion Modelscited by 1
- 2026Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Maskingcited by 1
- 2026Can We Predict The Human Preference For Text-to-Image Content Prior To Generation And Is It Even Useful To Do So?cited by 0
- 2026Can We Predict The Human Preference For Text-to-Image Content Prior To Generation And Is It Even Useful To Do So?3 Jun 2026
- 2026Forget-It-All: Multi-Concept Machine Unlearning via Concept-Aware Neuron Masking7 Jan 2026
- 2025Continual Unlearning for Text-to-Image Diffusion Models: A Regularization Perspective11 Nov 2025
- 2025Sparse-to-Sparse Training of Diffusion Models30 Apr 2025
- 2025Towards efficient quantum algorithms for diffusion probabilistic models20 Feb 2025
- 2025Pruning for Sparse Diffusion Models based on Gradient Flow16 Jan 2025
- 2024Efficient Training with Denoised Neural Weights16 Jul 2024
- 2023DeepPCR: Parallelizing Sequential Operations in Neural Networks28 Sep 2023
- 2023ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Modelscited by 19
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruningcited by 13
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristicscited by 4
- 2025Safe Vision-Language Models via Unsafe Weights Manipulationcited by 1
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Modelscited by 1
- 2026HiPP-Prune: Hierarchical Preference-Conditioned Structured Pruning for Vision-Language Modelscited by 0
- 2026Prune Once: Retraining-Free Task-Agnostic Pruning for Vision-Language Models7 Aug 2026
- 2026HiPP-Prune: Hierarchical Preference-Conditioned Structured Pruning for Vision-Language Models6 Mar 2026
- 2025Safe Vision-Language Models via Unsafe Weights Manipulation14 Mar 2025
- 2024F3OCUS -- Federated Finetuning of Vision-Language Foundation Models with Optimal Client Layer Updating Strategy via Multi-objective Meta-Heuristics17 Nov 2024
- 2024MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning8 Apr 2024
- 2023ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Models4 Oct 2023
- 2025ResMoE: Space-efficient Compression of Mixture of Experts LLMs via Residual Restorationcited by 12
- 2023MLP Fusion: Towards Efficient Fine-tuning of Dense and Mixture-of-Experts Language Modelscited by 6
- 2025GuiLoMo: Allocating Expert Number and Rank for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectorscited by 6
- 2025GuiLoMo: Allocating Expert Number and Rank for LoRA-MoE via Bilevel Optimization with GuidedSelection Vectors17 Jun 2025
- 2025ResMoE: Space-efficient Compression of Mixture of Experts LLMs via Residual Restoration10 Mar 2025
- 2023MLP Fusion: Towards Efficient Fine-tuning of Dense and Mixture-of-Experts Language Models18 Jul 2023
- 2023LEMON: Lossless model expansioncited by 23
- 2023LEMON: Lossless model expansion12 Oct 2023
- 2023Model Sparsity Can Simplify Machine Unlearningcited by 206
- 2023Model Sparsity Can Simplify Machine Unlearning11 Apr 2023
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2021Zero-Cost Proxies for Lightweight NAScited by 194
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Neural Architecture Search on ImageNet in Four GPU Hours: A Theoretically Inspired Perspectivecited by 168
- 2023Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsitycited by 163
- 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
- 2023Structured Pruning for Deep Convolutional Neural Networks: A surveycited by 122
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2021How Powerful are Performance Predictors in Neural Architecture Search?cited by 88
- 2022The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Trainingcited by 85
- 2021Sparse Training via Boosting Pruning Plasticity with Neuroregenerationcited by 83
12 most cited of 442 All 442 (JSON)
- 2026Dissecting Representation Structure in Vision Transformers: A Rigorous Architectural Study8 Oct 2026
- 2026Prediction-powered Neural Architecture Search1 Oct 2026
- 2026Beyond Sparsity: Weight Location and Network Context in Pruned MRI Reconstruction25 Sep 2026
- 2026Artificial Structure Function Search: Preserving Artificial Functional Connectivity for Structured Pruning21 Sep 2026
- 2026Unified Response Geometry for Structured Pruning16 Sep 2026
- 2026Optimal Pruning for Neural Architectures using Fisher Information Distances14 Sep 2026
- 2026CoRA-NAS: Coarse Ranking and Anchor-Residual Refinement for Neural Architecture Search10 Sep 2026
- 2026Physics-Informed Foresight Pruning for Sparse PINN Solvers of Nonlinear PDEs26 Aug 2026
- 2026Resource-Efficient Pruning for Transformer via Low-Rank Importance Estimation25 Aug 2026
- 2026Bi-EZP: LLM-Guided Bilevel Program Evolution for Ensemble Zero-Cost Proxy Discovery22 Aug 2026
- 2026Breaking the Compression Barrier: Cross-Architecture Compression Boundary Learning via Reverse Regrowth17 Aug 2026
- 2026Activation-Energy Pruning for Spiking Neural Networks: Unsupervised Personalization via Spike-Count Saliency11 Aug 2026
12 newest of 442 All 442 (JSON)