{"total":240,"rows":[{"id":"2306.11695","title":"A Simple and Effective Pruning Approach for Large Language Models","created":"2023-06-20","cited_by_count":800,"area":null},{"id":"2301.12900","title":"DepGraph: Towards Any Structural Pruning","created":"2023-01-30","cited_by_count":203,"area":null},{"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.04010","title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","created":"2021-02-08","cited_by_count":179,"area":null},{"id":"2204.00408","title":"Structured Pruning Learns Compact and Accurate Models","created":"2022-04-01","cited_by_count":170,"area":null},{"id":"2110.07560","title":"Composable Sparse Fine-Tuning for Cross-Lingual Transfer","created":"2021-10-14","cited_by_count":144,"area":null},{"id":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"area":null},{"id":"2102.06790","title":"A Unified Lottery Ticket Hypothesis for Graph Neural Networks","created":"2021-02-12","cited_by_count":118,"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":"2106.10404","title":"Sparse Training via Boosting Pruning Plasticity with Neuroregeneration","created":"2021-06-19","cited_by_count":84,"area":null},{"id":"2206.12562","title":"PLATON: Pruning Large Transformer Models with Upper Confidence Bound of Weight Importance","created":"2022-06-25","cited_by_count":79,"area":null},{"id":"2107.07467","title":"Only Train Once: A One-Shot Neural Network Training And Pruning Framework","created":"2021-07-15","cited_by_count":70,"area":null},{"id":"2111.05754","title":"Prune Once for All: Sparse Pre-Trained Language Models","created":"2021-11-10","cited_by_count":66,"area":null},{"id":"2103.05579","title":"hls4ml: An Open-Source Codesign Workflow to Empower Scientific Low-Power Machine Learning Devices","created":"2021-03-09","cited_by_count":62,"area":null},{"id":"2106.09129","title":"A Winning Hand: Compressing Deep Networks Can Improve Out-Of-Distribution Robustness","created":"2021-06-16","cited_by_count":62,"area":null},{"id":"2105.01029","title":"Initialization and Regularization of Factorized Neural Layers","created":"2021-05-03","cited_by_count":58,"area":"distill"},{"id":"2105.12002","title":"Super Tickets in Pre-Trained Language Models: From Model Compression to Improving Generalization","created":"2021-05-25","cited_by_count":56,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2106.05933","title":"PARP: Prune, Adjust and Re-Prune for Self-Supervised Speech Recognition","created":"2021-06-10","cited_by_count":53,"area":null},{"id":"2107.00166","title":"Sanity Checks for Lottery Tickets: Does Your Winning Ticket Really Win the Jackpot?","created":"2021-07-01","cited_by_count":52,"area":null},{"id":"2106.04217","title":"Dynamic Sparse Training for Deep Reinforcement Learning","created":"2021-06-08","cited_by_count":49,"area":null},{"id":"2112.05588","title":"Copy, Right? A Testing Framework for Copyright Protection of Deep Learning Models","created":"2021-12-10","cited_by_count":46,"area":"safety"},{"id":"2402.05964","title":"A Survey on Transformer Compression","created":"2024-02-05","cited_by_count":46,"area":null},{"id":"2104.11832","title":"Playing Lottery Tickets with Vision and Language","created":"2021-04-23","cited_by_count":45,"area":null},{"id":"2105.01571","title":"Effective Sparsification of Neural Networks with Global Sparsity Constraint","created":"2021-05-03","cited_by_count":45,"area":null},{"id":"2202.03335","title":"Membership Inference Attacks and Defenses in Neural Network Pruning","created":"2022-02-07","cited_by_count":45,"area":"safety"},{"id":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"area":null},{"id":"2106.03795","title":"Heavy Tails in SGD and Compressibility of Overparametrized Neural Networks","created":"2021-06-07","cited_by_count":44,"area":null},{"id":"2205.13574","title":"Pruning has a disparate impact on model accuracy","created":"2022-05-26","cited_by_count":44,"area":null},{"id":"2202.09844","title":"Sparsity Winning Twice: Better Robust Generalization from More Efficient Training","created":"2022-02-20","cited_by_count":41,"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":"2104.08682","title":"Rethinking Network Pruning -- under the Pre-train and Fine-tune Paradigm","created":"2021-04-18","cited_by_count":40,"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":"2202.08132","title":"Prospect Pruning: Finding Trainable Weights at Initialization using Meta-Gradients","created":"2022-02-16","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":"2106.00134","title":"GANs Can Play Lottery Tickets Too","created":"2021-05-31","cited_by_count":32,"area":null},{"id":"2303.06862","title":"OTOV2: Automatic, Generic, User-Friendly","created":"2023-03-13","cited_by_count":32,"area":null},{"id":"2210.13738","title":"Pruning's Effect on Generalization Through the Lens of Training and Regularization","created":"2022-10-25","cited_by_count":31,"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":"2210.04457","title":"XPrompt: Exploring the Extreme of Prompt Tuning","created":"2022-10-10","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":"2110.14068","title":"Drawing Robust Scratch Tickets: Subnetworks with Inborn Robustness Are Found within Randomly Initialized Networks","created":"2021-10-26","cited_by_count":29,"area":null},{"id":"2202.04736","title":"Coarsening the Granularity: Towards Structurally Sparse Lottery Tickets","created":"2022-02-09","cited_by_count":27,"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":"2206.08684","title":"Sparse Double Descent: Where Network Pruning Aggravates Overfitting","created":"2022-06-17","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":"2406.05233","title":"Federated LoRA with Sparse Communication","created":"2024-06-07","cited_by_count":26,"area":null},{"id":"2103.00397","title":"Data-Efficient GAN Training Beyond (Just) Augmentations: A Lottery Ticket Perspective","created":"2021-02-28","cited_by_count":25,"area":null},{"id":"2105.03193","title":"Network Pruning That Matters: A Case Study on Retraining Variants","created":"2021-05-07","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":"2302.05601","title":"Pruning Deep Neural Networks from a Sparsity Perspective","created":"2023-02-11","cited_by_count":25,"area":null},{"id":"2302.09632","title":"HomoDistil: Homotopic Task-Agnostic Distillation of Pre-trained Transformers","created":"2023-02-19","cited_by_count":25,"area":"distill"},{"id":"2305.02538","title":"Cuttlefish: Low-Rank Model Training without All the Tuning","created":"2023-05-04","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":"2310.07999","title":"LEMON: Lossless model expansion","created":"2023-10-12","cited_by_count":23,"area":"lr"},{"id":"2102.11068","title":"Lottery Ticket Preserves Weight Correlation: Is It Desirable or Not?","created":"2021-02-19","cited_by_count":22,"area":null},{"id":"2402.14700","title":"Unveiling Linguistic Regions in Large Language Models","created":"2024-02-22","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":"2205.12694","title":"Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Models","created":"2022-05-25","cited_by_count":20,"area":null},{"id":"2210.09223","title":"CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models","created":"2022-10-14","cited_by_count":20,"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":"2407.20584","title":"Pruning Large Language Models with Semi-Structural Adaptive Sparse Training","created":"2024-07-30","cited_by_count":20,"area":null},{"id":"2102.07804","title":"Scaling Up Exact Neural Network Compression by ReLU Stability","created":"2021-02-15","cited_by_count":19,"area":null},{"id":"2105.14797","title":"RED : Looking for Redundancies for Data-Free Structured Compression of Deep Neural Networks","created":"2021-05-31","cited_by_count":19,"area":null},{"id":"2110.01397","title":"RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Merging","created":"2021-09-30","cited_by_count":19,"area":null},{"id":"2402.04744","title":"Progressive Gradient Flow for Robust N:M Sparsity Training in Transformers","created":"2024-02-07","cited_by_count":18,"area":null},{"id":"2105.14713","title":"1xN Pattern for Pruning Convolutional Neural Networks","created":"2021-05-31","cited_by_count":16,"area":null},{"id":"2203.07808","title":"Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNs","created":"2022-03-15","cited_by_count":16,"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":"2205.11921","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","created":"2022-05-24","cited_by_count":16,"area":null},{"id":"2207.12534","title":"Trainability Preserving Neural Pruning","created":"2022-07-25","cited_by_count":16,"area":null},{"id":"2211.03013","title":"Robust Lottery Tickets for Pre-trained Language Models","created":"2022-11-06","cited_by_count":16,"area":null},{"id":"2301.05219","title":"Why is the State of Neural Network Pruning so Confusing? On the Fairness, Comparison Setup, and Trainability in Network Pruning","created":"2023-01-12","cited_by_count":16,"area":null},{"id":"2205.11819","title":"Quarantine: Sparsity Can Uncover the Trojan Attack Trigger for Free","created":"2022-05-24","cited_by_count":15,"area":null},{"id":"2212.08066","title":"Mod-Squad: Designing Mixture of Experts As Modular Multi-Task Learners","created":"2022-12-15","cited_by_count":15,"area":"moe"},{"id":"2305.18383","title":"A Three-regime Model of Network Pruning","created":"2023-05-28","cited_by_count":15,"area":null},{"id":"2402.19262","title":"Masks, Signs, And Learning Rate Rewinding","created":"2024-02-29","cited_by_count":15,"area":null},{"id":"2110.05667","title":"Why Lottery Ticket Wins? A Theoretical Perspective of Sample Complexity on Pruned Neural Networks","created":"2021-10-12","cited_by_count":14,"area":null},{"id":"2312.15230","title":"PERP: Rethinking the Prune-Retrain Paradigm in the Era of LLMs","created":"2023-12-23","cited_by_count":14,"area":"lr"},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2410.10862","title":"Superficial Safety Alignment Hypothesis","created":"2024-10-07","cited_by_count":14,"area":"alignment"},{"id":"2111.11153","title":"Plant 'n' Seek: Can You Find the Winning Ticket?","created":"2021-11-22","cited_by_count":13,"area":null},{"id":"2209.14624","title":"Is Complexity Required for Neural Network Pruning? A Case Study on Global Magnitude Pruning","created":"2022-09-29","cited_by_count":13,"area":null},{"id":"2302.06058","title":"Bi-directional Masks for Efficient N:M Sparse Training","created":"2023-02-13","cited_by_count":13,"area":null},{"id":"2404.05621","title":"MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning","created":"2024-04-08","cited_by_count":13,"area":"mllm"},{"id":"2109.14960","title":"Prune Your Model Before Distill It","created":"2021-09-30","cited_by_count":12,"area":"distill"},{"id":"2111.00843","title":"How I Learned to Stop Worrying and Love Retraining","created":"2021-11-01","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":"2402.01876","title":"Ultrafast jet classification on FPGAs for the HL-LHC","created":"2024-02-02","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":"2303.08595","title":"Automatic Attention Pruning: Improving and Automating Model Pruning using Attentions","created":"2023-03-14","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":"2411.18376","title":"Preserving Deep Representations In One-Shot Pruning: A Hessian-Free Second-Order Optimization Framework","created":"2024-11-27","cited_by_count":11,"area":null},{"id":"2103.06002","title":"Robustness to Pruning Predicts Generalization in Deep Neural Networks","created":"2021-03-10","cited_by_count":10,"area":null},{"id":"2109.10795","title":"Neural network relief: a pruning algorithm based on neural activity","created":"2021-09-22","cited_by_count":10,"area":null},{"id":"2404.06498","title":"Simultaneous linear connectivity of neural networks modulo permutation","created":"2024-04-09","cited_by_count":10,"area":null},{"id":"2203.10991","title":"Minimum Variance Unbiased N:M Sparsity for the Neural Gradients","created":"2022-03-21","cited_by_count":9,"area":null}],"next_cursor":"100"}