{"total":77,"rows":[{"id":"2308.06767","title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","created":"2023-08-13","cited_by_count":202,"area":null},{"id":"2102.02887","title":"Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Training","created":"2021-02-04","cited_by_count":110,"area":null},{"id":"2202.02643","title":"The Unreasonable Effectiveness of Random Pruning: Return of the Most Naive Baseline for Sparse Training","created":"2022-02-05","cited_by_count":85,"area":null},{"id":"2201.05125","title":"GradMax: Growing Neural Networks using Gradient Information","created":"2022-01-13","cited_by_count":66,"area":null},{"id":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61,"area":null},{"id":"2106.04217","title":"Dynamic Sparse Training for Deep Reinforcement Learning","created":"2021-06-08","cited_by_count":49,"area":null},{"id":"2401.04679","title":"RoSA: Accurate Parameter-Efficient Fine-Tuning via Robust Adaptation","created":"2024-01-09","cited_by_count":48,"area":null},{"id":"2106.14568","title":"Deep Ensembling with No Overhead for either Training or Testing: The All-Round Blessings of Dynamic Sparsity","created":"2021-06-28","cited_by_count":44,"area":null},{"id":"2103.06460","title":"Recent Advances on Neural Network Pruning at Initialization","created":"2021-03-11","cited_by_count":41,"area":null},{"id":"2210.03044","title":"Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?","created":"2022-10-06","cited_by_count":38,"area":null},{"id":"2305.02299","title":"Dynamic Sparse Training with Structured Sparsity","created":"2023-05-03","cited_by_count":38,"area":null},{"id":"2304.02840","title":"NTK-SAP: Improving neural network pruning by aligning training dynamics","created":"2023-04-06","cited_by_count":30,"area":null},{"id":"2206.12755","title":"Training Your Sparse Neural Network Better with Any Mask","created":"2022-06-26","cited_by_count":26,"area":null},{"id":"2208.04425","title":"Controlled Sparsity via Constrained Optimization or: How I Learned to Stop Tuning Penalties and Love Constraints","created":"2022-08-08","cited_by_count":25,"area":null},{"id":"2302.02596","title":"Ten Lessons We Have Learned in the New \"Sparseland\": A Short Handbook for Sparse Neural Network Researchers","created":"2023-02-06","cited_by_count":25,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2103.16547","title":"The Elastic Lottery Ticket Hypothesis","created":"2021-03-30","cited_by_count":23,"area":null},{"id":"2102.01670","title":"Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimization","created":"2021-02-02","cited_by_count":22,"area":null},{"id":"2306.16788","title":"Sparse Model Soups: A Recipe for Improved Pruning via Model Averaging","created":"2023-06-29","cited_by_count":20,"area":null},{"id":"2207.08629","title":"Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks","created":"2022-07-18","cited_by_count":18,"area":null},{"id":"2306.12230","title":"Fantastic Weights and How to Find Them: Where to Prune in Dynamic Sparse Training","created":"2023-06-21","cited_by_count":17,"area":null},{"id":"2102.01732","title":"Truly Sparse Neural Networks at Scale","created":"2021-02-02","cited_by_count":16,"area":null},{"id":"2405.15743","title":"Sparse maximal update parameterization: A holistic approach to sparse training dynamics","created":"2024-05-24","cited_by_count":16,"area":null},{"id":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","cited_by_count":15,"area":null},{"id":"2103.01636","title":"Sparse Training Theory for Scalable and Efficient Agents","created":"2021-03-02","cited_by_count":13,"area":null},{"id":"2108.06277","title":"Towards Structured Dynamic Sparse Pre-Training of BERT","created":"2021-08-13","cited_by_count":12,"area":null},{"id":"2205.08099","title":"Dimensionality Reduced Training by Pruning and Freezing Parts of a Deep Neural Network, a Survey","created":"2022-05-17","cited_by_count":12,"area":null},{"id":"2106.06955","title":"Towards Understanding Iterative Magnitude Pruning: Why Lottery Tickets Win","created":"2021-06-13","cited_by_count":11,"area":null},{"id":"2208.10842","title":"Lottery Pools: Winning More by Interpolating Tickets without Increasing Training or Inference Cost","created":"2022-08-23","cited_by_count":11,"area":null},{"id":"2209.07617","title":"Training Recipe for N:M Structured Sparsity with Decaying Pruning Mask","created":"2022-09-15","cited_by_count":11,"area":null},{"id":"2410.03030","title":"Dynamic Sparse Training versus Dense Training: The Unexpected Winner in Image Corruption Robustness","created":"2024-10-03","cited_by_count":11,"area":null},{"id":"2407.03086","title":"Effective Heterogeneous Federated Learning via Efficient Hypernetwork-based Weight Generation","created":"2024-07-03","cited_by_count":9,"area":null},{"id":"2110.03210","title":"Universality of Winning Tickets: A Renormalization Group Perspective","created":"2021-10-07","cited_by_count":8,"area":null},{"id":"2303.07200","title":"Supervised Feature Selection with Neuron Evolution in Sparse Neural Networks","created":"2023-03-10","cited_by_count":7,"area":null},{"id":"2402.02855","title":"Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation","created":"2024-02-05","cited_by_count":7,"area":null},{"id":"2506.05977","title":"Mitigating Catastrophic Forgetting with Adaptive Transformer Block Expansion in Federated Fine-Tuning","created":"2025-06-06","cited_by_count":7,"area":null},{"id":"2101.03255","title":"Spending Your Winning Lottery Better After Drawing It","created":"2021-01-08","cited_by_count":5,"area":null},{"id":"2301.03573","title":"Balance is Essence: Accelerating Sparse Training via Adaptive Gradient Correction","created":"2023-01-09","cited_by_count":5,"area":null},{"id":"2401.09986","title":"Improving Local Training in Federated Learning via Temperature Scaling","created":"2024-01-18","cited_by_count":5,"area":null},{"id":"2108.00259","title":"How much pre-training is enough to discover a good subnetwork?","created":"2021-07-31","cited_by_count":4,"area":null},{"id":"2311.12526","title":"Neural Network Pruning by Gradient Descent","created":"2023-11-21","cited_by_count":4,"area":null},{"id":"2105.12920","title":"Search Spaces for Neural Model Training","created":"2021-05-27","cited_by_count":3,"area":null},{"id":"2210.16589","title":"Strong Lottery Ticket Hypothesis with $\\varepsilon$--perturbation","created":"2022-10-29","cited_by_count":3,"area":null},{"id":"2308.08160","title":"Benchmarking Adversarial Robustness of Compressed Deep Learning Models","created":"2023-08-16","cited_by_count":3,"area":null},{"id":"2406.01755","title":"Sparser, Better, Deeper, Stronger: Improving Sparse Training with Exact Orthogonal Initialization","created":"2024-06-03","cited_by_count":3,"area":null},{"id":"2411.03171","title":"Navigating Extremes: Dynamic Sparsity in Large Output Spaces","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2506.08764","title":"On the Stability of the Jacobian Matrix in Deep Neural Networks","created":"2025-06-10","cited_by_count":3,"area":null},{"id":"2507.03117","title":"BLaST: High Performance Inference and Pretraining using BLock Sparse Transformers","created":"2025-07-03","cited_by_count":3,"area":null},{"id":"2305.14852","title":"Sparse Weight Averaging with Multiple Particles for Iterative Magnitude Pruning","created":"2023-05-24","cited_by_count":2,"area":null},{"id":"2305.16886","title":"Understanding Sparse Neural Networks from their Topology via Multipartite Graph Representations","created":"2023-05-26","cited_by_count":2,"area":null},{"id":"2306.00045","title":"Lottery Tickets in Evolutionary Optimization: On Sparse Backpropagation-Free Trainability","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2505.05143","title":"Sparse Training from Random Initialization: Aligning Lottery Ticket Masks using Weight Symmetry","created":"2025-05-08","cited_by_count":2,"area":null},{"id":"2510.17515","title":"The Graphon Limit Hypothesis: Understanding Neural Network Pruning via Infinite Width Analysis","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2108.12056","title":"Continual learning under domain transfer with sparse synaptic bursting","created":"2021-08-26","cited_by_count":1,"area":null},{"id":"2112.04905","title":"i-SpaSP: Structured Neural Pruning via Sparse Signal Recovery","created":"2021-12-07","cited_by_count":1,"area":null},{"id":"2302.11244","title":"Considering Layerwise Importance in the Lottery Ticket Hypothesis","created":"2023-02-22","cited_by_count":1,"area":null},{"id":"2305.10964","title":"Learning Activation Functions for Sparse Neural Networks","created":"2023-05-18","cited_by_count":1,"area":null},{"id":"2310.20203","title":"Importance Estimation with Random Gradient for Neural Network Pruning","created":"2023-10-31","cited_by_count":1,"area":null},{"id":"2403.13204","title":"Diversity-Aware Agnostic Ensemble of Sharpness Minimizers","created":"2024-03-19","cited_by_count":1,"area":null},{"id":"2411.13545","title":"Pushing the Limits of Sparsity: A Bag of Tricks for Extreme Pruning","created":"2024-11-20","cited_by_count":1,"area":null},{"id":"2412.06545","title":"On How Iterative Magnitude Pruning Discovers Local Receptive Fields in Fully Connected Neural Networks","created":"2024-12-09","cited_by_count":1,"area":null},{"id":"2501.15592","title":"Information Consistent Pruning: How to Efficiently Search for Sparse Networks?","created":"2025-01-26","cited_by_count":1,"area":null},{"id":"2504.05357","title":"Find A Winning Sign: Sign Is All We Need to Win the Lottery","created":"2025-04-07","cited_by_count":1,"area":null},{"id":"2505.08793","title":"Onboard Optimization and Learning: A Survey","created":"2025-05-07","cited_by_count":1,"area":null},{"id":"2506.13180","title":"Dynamic Acoustic Model Architecture Optimization in Training for ASR","created":"2025-06-16","cited_by_count":1,"area":null},{"id":"2211.09945","title":"VeriCompress: A Tool to Streamline the Synthesis of Verified Robust Compressed Neural Networks from Scratch","created":"2022-11-17","cited_by_count":0,"area":null},{"id":"2306.13203","title":"Neural Network Pruning for Real-time Polyp Segmentation","created":"2023-06-22","cited_by_count":0,"area":null},{"id":"2407.04075","title":"Sparsest Models Elude Pruning: An Expos\\'e of Pruning's Current Capabilities","created":"2024-07-04","cited_by_count":0,"area":null},{"id":"2407.17412","title":"(PASS) Visual Prompt Locates Good Structure Sparsity through a Recurrent HyperNetwork","created":"2024-07-24","cited_by_count":0,"area":null},{"id":"2505.17909","title":"NeuroTrails: Training with Dynamic Sparse Heads as the Key to Effective Ensembling","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2506.00932","title":"Addressing the Collaboration Dilemma in Low-Data Federated Learning via Transient Sparsity","created":"2025-06-01","cited_by_count":0,"area":null},{"id":"2509.11190","title":"Investigating the Lottery Ticket Hypothesis for Variational Quantum Circuits","created":"2025-09-14","cited_by_count":0,"area":null},{"id":"2512.07142","title":"Winning the Lottery by Preserving Network Training Dynamics with Concrete Ticket Search","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2512.22106","title":"Pruning as a Game: Equilibrium-Driven Sparsification of Neural Networks","created":"2025-12-26","cited_by_count":0,"area":null},{"id":"2605.27541","title":"SparseOpt: Addressing Normalization-induced Gradient Skew in Sparse Training","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.00888","title":"Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2608.18819","title":"A Unifying Relational Perspective on Expressive Lottery Tickets","created":"2026-08-19","cited_by_count":0,"area":null}],"next_cursor":null}