{"total":83,"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":"2310.05175","title":"Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity","created":"2023-10-08","cited_by_count":165,"area":null},{"id":"2207.03620","title":"More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsity","created":"2022-07-07","cited_by_count":142,"area":null},{"id":"2309.15698","title":"Deep Model Fusion: A Survey","created":"2023-09-27","cited_by_count":91,"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":"2206.00187","title":"DisPFL: Towards Communication-Efficient Personalized Federated Learning via Decentralized Sparse Training","created":"2022-06-01","cited_by_count":74,"area":null},{"id":"2210.05177","title":"Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approach","created":"2022-10-11","cited_by_count":70,"area":null},{"id":"2310.01382","title":"Compressing LLMs: The Truth is Rarely Pure and Never Simple","created":"2023-10-02","cited_by_count":62,"area":null},{"id":"2112.09824","title":"Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Better","created":"2021-12-18","cited_by_count":55,"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":"2306.03805","title":"The Emergence of Essential Sparsity in Large Pre-trained Models: The Weights that Matter","created":"2023-06-06","cited_by_count":42,"area":null},{"id":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","cited_by_count":41,"area":null},{"id":"2305.02299","title":"Dynamic Sparse Training with Structured Sparsity","created":"2023-05-03","cited_by_count":38,"area":null},{"id":"2206.06662","title":"Learning Best Combination for Efficient N:M Sparsity","created":"2022-06-14","cited_by_count":32,"area":null},{"id":"2111.05685","title":"Efficient Neural Network Training via Forward and Backward Propagation Sparsification","created":"2021-11-10","cited_by_count":30,"area":null},{"id":"2206.01299","title":"Fine-tuning Language Models over Slow Networks using Activation Compression with Guarantees","created":"2022-06-02","cited_by_count":30,"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":"2303.10464","title":"SPDF: Sparse Pre-training and Dense Fine-tuning for Large Language Models","created":"2023-03-18","cited_by_count":28,"area":null},{"id":"2303.02141","title":"Sparsity May Cry: Let Us Fail (Current) Sparse Neural Networks Together!","created":"2023-03-03","cited_by_count":27,"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":"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":"2602.10825","title":"Flow caching for autoregressive video generation","created":"2026-02-11","cited_by_count":25,"area":null},{"id":"2212.09840","title":"Dynamic Sparse Network for Time Series Classification: Learning What to \"see''","created":"2022-12-19","cited_by_count":22,"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":"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":"2305.19454","title":"Dynamic Sparsity Is Channel-Level Sparsity Learner","created":"2023-05-30","cited_by_count":18,"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":"2312.04727","title":"E2ENet: Dynamic Sparse Feature Fusion for Accurate and Efficient 3D Medical Image Segmentation","created":"2023-12-07","cited_by_count":16,"area":null},{"id":"2211.16667","title":"Dynamic Sparse Training via Balancing the Exploration-Exploitation Trade-off","created":"2022-11-30","cited_by_count":15,"area":null},{"id":"2305.18383","title":"A Three-regime Model of Network Pruning","created":"2023-05-28","cited_by_count":15,"area":null},{"id":"2211.15335","title":"You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets","created":"2022-11-28","cited_by_count":14,"area":null},{"id":"2303.01201","title":"Average of Pruning: Improving Performance and Stability of Out-of-Distribution Detection","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":"2302.13019","title":"A Unified Framework for Soft Threshold Pruning","created":"2023-02-25","cited_by_count":12,"area":null},{"id":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2310.16391","title":"Winning Prize Comes from Losing Tickets: Improve Invariant Learning by Exploring Variant Parameters for Out-of-Distribution Generalization","created":"2023-10-25","cited_by_count":12,"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":"2308.02060","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","created":"2023-08-03","cited_by_count":10,"area":null},{"id":"2206.02976","title":"Recall Distortion in Neural Network Pruning and the Undecayed Pruning Algorithm","created":"2022-06-07","cited_by_count":9,"area":null},{"id":"2212.01076","title":"Are Straight-Through gradients and Soft-Thresholding all you need for Sparse Training?","created":"2022-12-02","cited_by_count":9,"area":null},{"id":"2301.07966","title":"Getting Away with More Network Pruning: From Sparsity to Geometry and Linear Regions","created":"2023-01-19","cited_by_count":8,"area":null},{"id":"2302.14670","title":"Balanced Training for Sparse GANs","created":"2023-02-28","cited_by_count":8,"area":null},{"id":"2303.11525","title":"Sparse-IFT: Sparse Iso-FLOP Transformations for Maximizing Training Efficiency","created":"2023-03-21","cited_by_count":8,"area":null},{"id":"2505.01731","title":"Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models","created":"2025-05-03","cited_by_count":8,"area":null},{"id":"2201.13361","title":"Signing the Supermask: Keep, Hide, Invert","created":"2022-01-31","cited_by_count":7,"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":"2205.15322","title":"Superposing Many Tickets into One: A Performance Booster for Sparse Neural Network Training","created":"2022-05-30","cited_by_count":6,"area":null},{"id":"2408.14398","title":"On the Limitations of Language Targeted Pruning: Investigating the Calibration Language Impact in Multilingual LLM Pruning","created":"2024-08-26","cited_by_count":6,"area":null},{"id":"2201.12826","title":"OptG: Optimizing Gradient-driven Criteria in Network Sparsity","created":"2022-01-30","cited_by_count":5,"area":null},{"id":"2306.05056","title":"Magnitude Attention-based Dynamic Pruning","created":"2023-06-08","cited_by_count":5,"area":null},{"id":"2502.15790","title":"Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representations","created":"2025-02-18","cited_by_count":5,"area":null},{"id":"2306.17504","title":"Systematic Investigation of Sparse Perturbed Sharpness-Aware Minimization Optimizer","created":"2023-06-30","cited_by_count":4,"area":null},{"id":"2501.19107","title":"Brain network science modelling of sparse neural networks enables Transformers and LLMs to perform as fully connected","created":"2025-01-31","cited_by_count":4,"area":null},{"id":"2504.21414","title":"Adapting In-Domain Few-Shot Segmentation to New Domains without Source Domain Retraining","created":"2025-04-30","cited_by_count":4,"area":null},{"id":"2301.00335","title":"Pruning Before Training May Improve Generalization, Provably","created":"2023-01-01","cited_by_count":3,"area":null},{"id":"2308.14969","title":"Uncovering the Hidden Cost of Model Compression","created":"2023-08-29","cited_by_count":3,"area":null},{"id":"2312.05479","title":"Exploring Sparsity in Graph Transformers","created":"2023-12-09","cited_by_count":3,"area":null},{"id":"2512.03834","title":"Lean Unet: A Compact Model for Image Segmentation","created":"2025-12-03","cited_by_count":3,"area":null},{"id":"2602.03535","title":"Sparse Training of Neural Networks based on Multilevel Mirror Descent","created":"2026-02-03","cited_by_count":3,"area":null},{"id":"2211.08544","title":"Exploiting the Partly Scratch-off Lottery Ticket for Quantization-Aware Training","created":"2022-11-12","cited_by_count":2,"area":null},{"id":"2311.16141","title":"Brain-Inspired Efficient Pruning: Exploiting Criticality in Spiking Neural Networks","created":"2023-11-05","cited_by_count":2,"area":null},{"id":"2311.17493","title":"Towards Higher Ranks via Adversarial Weight Pruning","created":"2023-11-29","cited_by_count":2,"area":null},{"id":"2312.03044","title":"REST: Enhancing Group Robustness in DNNs through Reweighted Sparse Training","created":"2023-12-05","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":"2210.14012","title":"Gradient-based Weight Density Balancing for Robust Dynamic Sparse Training","created":"2022-10-25","cited_by_count":1,"area":null},{"id":"2304.01086","title":"Self-building Neural Networks","created":"2023-04-03","cited_by_count":1,"area":null},{"id":"2305.18382","title":"Adaptive Sparsity Level during Training for Efficient Time Series Forecasting with Transformers","created":"2023-05-28","cited_by_count":1,"area":null},{"id":"2306.05612","title":"Spatial Re-parameterization for N:M Sparsity","created":"2023-06-09","cited_by_count":1,"area":null},{"id":"2401.06898","title":"Always-Sparse Training by Growing Connections with Guided Stochastic Exploration","created":"2024-01-12","cited_by_count":1,"area":null},{"id":"2403.19969","title":"Separate, Dynamic and Differentiable (SMART) Pruner for Block/Output Channel Pruning on Computer Vision Tasks","created":"2024-03-29","cited_by_count":1,"area":null},{"id":"2405.01775","title":"Torch2Chip: An End-to-end Customizable Deep Neural Network Compression and Deployment Toolkit for Prototype Hardware Accelerator Design","created":"2024-05-02","cited_by_count":1,"area":null},{"id":"2406.03879","title":"Decay Pruning Method: Smooth Pruning With a Self-Rectifying Procedure","created":"2024-06-06","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":"2502.03658","title":"Advancing Weight and Channel Sparsification with Enhanced Saliency","created":"2025-02-05","cited_by_count":1,"area":null},{"id":"2510.10136","title":"PermLLM: Learnable Channel Permutation for N:M Sparse Large Language Models","created":"2025-10-11","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":"2212.06144","title":"Optimizing Learning Rate Schedules for Iterative Pruning of Deep Neural Networks","created":"2022-12-09","cited_by_count":0,"area":null},{"id":"2402.17902","title":"SequentialAttention++ for Block Sparsification: Differentiable Pruning Meets Combinatorial Optimization","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2403.00952","title":"MediSwift: Efficient Sparse Pre-trained Biomedical Language Models","created":"2024-03-01","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":"2504.05349","title":"Hyperflux: Pruning Reveals Importance","created":"2025-04-06","cited_by_count":0,"area":null},{"id":"2508.09471","title":"EGGS-PTP: An Expander-Graph Guided Structured Post-training Pruning Method for Large Language Models","created":"2025-08-13","cited_by_count":0,"area":null},{"id":"2610.02524","title":"BaCP: Backbone Contrastive Pruning for Preserving Representations in Extremely Sparse Neural Networks","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}