{"total":63,"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":"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":"2310.02025","title":"DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Training","created":"2023-10-03","cited_by_count":76,"area":null},{"id":"2106.02890","title":"Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?","created":"2021-06-05","cited_by_count":75,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"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":"2104.05641","title":"Generalization bounds via distillation","created":"2021-04-12","cited_by_count":34,"area":null},{"id":"2202.12002","title":"Rare Gems: Finding Lottery Tickets at Initialization","created":"2022-02-24","cited_by_count":34,"area":null},{"id":"2110.11395","title":"SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning","created":"2021-10-19","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":"2210.02412","title":"Why Random Pruning Is All We Need to Start Sparse","created":"2022-10-05","cited_by_count":26,"area":null},{"id":"2403.04861","title":"A Survey of Lottery Ticket Hypothesis","created":"2024-03-07","cited_by_count":24,"area":null},{"id":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"area":null},{"id":"2205.02321","title":"Most Activation Functions Can Win the Lottery Without Excessive Depth","created":"2022-05-04","cited_by_count":21,"area":null},{"id":"2206.10451","title":"Winning the Lottery Ahead of Time: Efficient Early Network Pruning","created":"2022-06-21","cited_by_count":21,"area":null},{"id":"2205.02343","title":"Convolutional and Residual Networks Provably Contain Lottery Tickets","created":"2022-05-04","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":"2107.02306","title":"Connectivity Matters: Neural Network Pruning Through the Lens of Effective Sparsity","created":"2021-07-05","cited_by_count":14,"area":null},{"id":"2303.00912","title":"Parameter Sharing with Network Pruning for Scalable Multi-Agent Deep Reinforcement Learning","created":"2023-03-02","cited_by_count":14,"area":null},{"id":"2111.11153","title":"Plant 'n' Seek: Can You Find the Winning Ticket?","created":"2021-11-22","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":"2203.14328","title":"On the Neural Tangent Kernel Analysis of Randomly Pruned Neural Networks","created":"2022-03-27","cited_by_count":9,"area":null},{"id":"2306.05857","title":"How Sparse Can We Prune A Deep Network: A Fundamental Limit Perspective","created":"2023-06-09","cited_by_count":9,"area":null},{"id":"2308.07163","title":"HyperSparse Neural Networks: Shifting Exploration to Exploitation through Adaptive Regularization","created":"2023-08-14","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":"2203.02549","title":"Structured Pruning is All You Need for Pruning CNNs at Initialization","created":"2022-03-04","cited_by_count":7,"area":null},{"id":"2407.01320","title":"Increasing Model Capacity for Free: A Simple Strategy for Parameter Efficient Fine-tuning","created":"2024-07-01","cited_by_count":6,"area":null},{"id":"2410.08540","title":"Kaleidoscope: Learnable Masks for Heterogeneous Multi-agent Reinforcement Learning","created":"2024-10-11","cited_by_count":6,"area":null},{"id":"2504.12801","title":"Sign-In to the Lottery: Reparameterizing Sparse Training From Scratch","created":"2025-04-17","cited_by_count":6,"area":null},{"id":"2101.02338","title":"Max-Affine Spline Insights Into Deep Network Pruning","created":"2021-01-07","cited_by_count":5,"area":null},{"id":"2110.11150","title":"Lottery Tickets with Nonzero Biases","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2211.17180","title":"Nonlinear Advantage: Trained Networks Might Not Be As Complex as You Think","created":"2022-11-30","cited_by_count":4,"area":null},{"id":"2212.08311","title":"Can We Find Strong Lottery Tickets in Generative Models?","created":"2022-12-16","cited_by_count":4,"area":null},{"id":"2308.06755","title":"Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining","created":"2023-08-13","cited_by_count":4,"area":null},{"id":"2202.00834","title":"Nonlinear Initialization Methods for Low-Rank Neural Networks","created":"2022-02-02","cited_by_count":3,"area":null},{"id":"2301.00335","title":"Pruning Before Training May Improve Generalization, Provably","created":"2023-01-01","cited_by_count":3,"area":null},{"id":"2310.13183","title":"Breaking through Deterministic Barriers: Randomized Pruning Mask Generation and Selection","created":"2023-10-19","cited_by_count":3,"area":null},{"id":"2403.00258","title":"\"Lossless\" Compression of Deep Neural Networks: A High-dimensional Neural Tangent Kernel Approach","created":"2024-03-01","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":"2412.18184","title":"Unified Stochastic Framework for Neural Network Quantization and Pruning","created":"2024-12-24","cited_by_count":3,"area":null},{"id":"2209.05683","title":"One-shot Network Pruning at Initialization with Discriminative Image Patches","created":"2022-09-13","cited_by_count":2,"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":"2305.17559","title":"Pruning at Initialization -- A Sketching Perspective","created":"2023-05-27","cited_by_count":2,"area":null},{"id":"2408.03913","title":"AdapMTL: Adaptive Pruning Framework for Multitask Learning Model","created":"2024-08-07","cited_by_count":2,"area":null},{"id":"2410.16151","title":"Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance","created":"2024-10-21","cited_by_count":2,"area":null},{"id":"2411.07066","title":"Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Training","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2107.01808","title":"Why is Pruning at Initialization Immune to Reinitializing and Shuffling?","created":"2021-07-05","cited_by_count":1,"area":null},{"id":"2111.02399","title":"Learning Pruned Structure and Weights Simultaneously from Scratch: an Attention based Approach","created":"2021-11-01","cited_by_count":1,"area":null},{"id":"2207.04227","title":"On the Robustness and Anomaly Detection of Sparse Neural Networks","created":"2022-07-09","cited_by_count":1,"area":null},{"id":"2406.02773","title":"Cyclic Sparse Training: Is it Enough?","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2502.11450","title":"What Scalable Second-Order Information Knows for Pruning at Initialization","created":"2025-02-17","cited_by_count":1,"area":null},{"id":"2511.03983","title":"TwIST: Rigging the Lottery in Transformers with Independent Subnetwork Training","created":"2025-11-06","cited_by_count":1,"area":null},{"id":"2209.13378","title":"Neural Network Panning: Screening the Optimal Sparse Network Before Training","created":"2022-09-27","cited_by_count":0,"area":null},{"id":"2301.11063","title":"Rewarded meta-pruning: Meta Learning with Rewards for Channel Pruning","created":"2023-01-26","cited_by_count":0,"area":null},{"id":"2307.07389","title":"Learning Sparse Neural Networks with Identity Layers","created":"2023-07-14","cited_by_count":0,"area":null},{"id":"2307.08013","title":"Revisiting Implicit Models: Sparsity Trade-offs Capability in Weight-tied Model for Vision Tasks","created":"2023-07-16","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":"2602.06675","title":"Pruning at Initialisation through the lens of Graphon Limit: Convergence, Expressivity, and Generalisation","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2603.19759","title":"Growing Networks with Autonomous Pruning","created":"2026-03-20","cited_by_count":0,"area":null},{"id":"2606.29119","title":"Knowing in Advance When an Evolutionary Outer Loop Will Not Help: A Pre-Registered Cheap-Baseline Screening Rule","created":"2026-06-28","cited_by_count":0,"area":null}],"next_cursor":null}