{"total":449,"rows":[{"id":"2301.00774","title":"SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shot","created":"2023-01-02","cited_by_count":1121,"area":null},{"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":"2103.16716","title":"BASE Layers: Simplifying Training of Large, Sparse Models","created":"2021-03-30","cited_by_count":320,"area":null},{"id":"2104.08378","title":"Accelerating Sparse Deep Neural Networks","created":"2021-04-16","cited_by_count":223,"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":"2208.03306","title":"Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Models","created":"2022-08-05","cited_by_count":191,"area":null},{"id":"2106.04533","title":"Chasing Sparsity in Vision Transformers: An End-to-End Exploration","created":"2021-06-08","cited_by_count":183,"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":"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":"2106.08962","title":"Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better","created":"2021-06-16","cited_by_count":154,"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":"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":"2102.08124","title":"Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Masks","created":"2021-02-16","cited_by_count":103,"area":null},{"id":"2110.12894","title":"The Efficiency Misnomer","created":"2021-10-25","cited_by_count":98,"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":"2210.04284","title":"SparseAdapter: An Easy Approach for Improving the Parameter-Efficiency of Adapters","created":"2022-10-09","cited_by_count":83,"area":null},{"id":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79,"area":null},{"id":"2110.14032","title":"MEST: Accurate and Fast Memory-Economic Sparse Training Framework on the Edge","created":"2021-10-26","cited_by_count":79,"area":null},{"id":"2110.13981","title":"CHIP: CHannel Independence-based Pruning for Compact Neural Networks","created":"2021-10-26","cited_by_count":78,"area":null},{"id":"2112.00029","title":"Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Models","created":"2021-11-30","cited_by_count":76,"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":"2201.05125","title":"GradMax: Growing Neural Networks using Gradient Information","created":"2022-01-13","cited_by_count":66,"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":"2206.10369","title":"The State of Sparse Training in Deep Reinforcement Learning","created":"2022-06-17","cited_by_count":61,"area":null},{"id":"2310.08915","title":"Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs","created":"2023-10-13","cited_by_count":61,"area":null},{"id":"2303.14177","title":"Scaling Expert Language Models with Unsupervised Domain Discovery","created":"2023-03-24","cited_by_count":60,"area":null},{"id":"2106.12379","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","created":"2021-06-23","cited_by_count":59,"area":null},{"id":"2403.15447","title":"Decoding Compressed Trust: Scrutinizing the Trustworthiness of Efficient LLMs Under Compression","created":"2024-03-18","cited_by_count":57,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"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":"2209.09476","title":"SparCL: Sparse Continual Learning on the Edge","created":"2022-09-20","cited_by_count":55,"area":null},{"id":"2402.15751","title":"Sparse MeZO: Less Parameters for Better Performance in Zeroth-Order LLM Fine-Tuning","created":"2024-02-24","cited_by_count":54,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"area":null},{"id":"2106.04217","title":"Dynamic Sparse Training for Deep Reinforcement Learning","created":"2021-06-08","cited_by_count":49,"area":null},{"id":"2110.00296","title":"Powerpropagation: A sparsity inducing weight reparameterisation","created":"2021-10-01","cited_by_count":49,"area":null},{"id":"2105.09259","title":"Learning Language Specific Sub-network for Multilingual Machine Translation","created":"2021-05-19","cited_by_count":48,"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":"2110.03036","title":"The Low-Resource Double Bind: An Empirical Study of Pruning for Low-Resource Machine Translation","created":"2021-10-06","cited_by_count":47,"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":"2402.16880","title":"BESA: Pruning Large Language Models with Blockwise Parameter-Efficient Sparsity Allocation","created":"2024-02-18","cited_by_count":45,"area":null},{"id":"2106.03225","title":"Efficient Lottery Ticket Finding: Less Data is More","created":"2021-06-06","cited_by_count":44,"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":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"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":"2103.06460","title":"Recent Advances on Neural Network Pruning at Initialization","created":"2021-03-11","cited_by_count":41,"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":"2307.06440","title":"No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Models","created":"2023-07-12","cited_by_count":41,"area":null},{"id":"2302.14623","title":"Fast as CHITA: Neural Network Pruning with Combinatorial Optimization","created":"2023-02-28","cited_by_count":40,"area":null},{"id":"2111.06061","title":"Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AI","created":"2021-11-11","cited_by_count":39,"area":null},{"id":"2206.09117","title":"NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networks","created":"2022-06-18","cited_by_count":39,"area":null},{"id":"2302.01107","title":"A Survey on Efficient Training of Transformers","created":"2023-02-02","cited_by_count":39,"area":null},{"id":"2305.02299","title":"Dynamic Sparse Training with Structured Sparsity","created":"2023-05-03","cited_by_count":38,"area":null},{"id":"2401.10440","title":"Breaking the Curse of Multilinguality with Cross-lingual Expert Language Models","created":"2024-01-19","cited_by_count":38,"area":null},{"id":"2203.14509","title":"Automated Progressive Learning for Efficient Training of Vision Transformers","created":"2022-03-28","cited_by_count":37,"area":null},{"id":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","cited_by_count":36,"area":null},{"id":"2410.10912","title":"AlphaPruning: Using Heavy-Tailed Self Regularization Theory for Improved Layer-wise Pruning of Large Language Models","created":"2024-10-14","cited_by_count":36,"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":"2201.11380","title":"Achieving Personalized Federated Learning with Sparse Local Models","created":"2022-01-27","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":"2205.15043","title":"RLx2: Training a Sparse Deep Reinforcement Learning Model from Scratch","created":"2022-05-30","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":"2501.06842","title":"SPAM: Spike-Aware Adam with Momentum Reset for Stable LLM Training","created":"2025-01-12","cited_by_count":28,"area":null},{"id":"2203.04248","title":"Dual Lottery Ticket Hypothesis","created":"2022-03-08","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":"2101.08837","title":"Time-Correlated Sparsification for Communication-Efficient Federated Learning","created":"2021-01-21","cited_by_count":26,"area":null},{"id":"2101.09048","title":"Selfish Sparse RNN Training","created":"2021-01-22","cited_by_count":26,"area":null},{"id":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26,"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":"2302.01172","title":"STEP: Learning N:M Structured Sparsity Masks from Scratch with Precondition","created":"2023-02-02","cited_by_count":26,"area":null},{"id":"2401.16405","title":"Scaling Sparse Fine-Tuning to Large Language Models","created":"2024-01-29","cited_by_count":26,"area":null},{"id":"2102.08329","title":"An Information-Theoretic Justification for Model Pruning","created":"2021-02-16","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":"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":"2301.10936","title":"PIT: Optimization of Dynamic Sparse Deep Learning Models via Permutation Invariant Transformation","created":"2023-01-26","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":"2305.02538","title":"Cuttlefish: Low-Rank Model Training without All the Tuning","created":"2023-05-04","cited_by_count":25,"area":null},{"id":"2312.08656","title":"MaxK-GNN: Extremely Fast GPU Kernel Design for Accelerating Graph Neural Networks Training","created":"2023-12-14","cited_by_count":25,"area":null},{"id":"2111.11802","title":"Pruning Self-attentions into Convolutional Layers in Single Path","created":"2021-11-23","cited_by_count":24,"area":null},{"id":"2211.14133","title":"PipeFisher: Efficient Training of Large Language Models Using Pipelining and Fisher Information Matrices","created":"2022-11-25","cited_by_count":24,"area":null},{"id":"2310.08670","title":"Every Parameter Matters: Ensuring the Convergence of Federated Learning with Dynamic Heterogeneous Models Reduction","created":"2023-10-12","cited_by_count":24,"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":"2305.02190","title":"Rethinking Graph Lottery Tickets: Graph Sparsity Matters","created":"2023-05-03","cited_by_count":23,"area":null},{"id":"2306.03693","title":"ESL-SNNs: An Evolutionary Structure Learning Strategy for Spiking Neural Networks","created":"2023-06-06","cited_by_count":23,"area":null},{"id":"2312.01397","title":"Visual Prompting Upgrades Neural Network Sparsification: A Data-Model Perspective","created":"2023-12-03","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":"2205.08957","title":"Meta-Learning Sparse Compression Networks","created":"2022-05-18","cited_by_count":22,"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":"2206.01278","title":"Lottery Tickets on a Data Diet: Finding Initializations with Sparse Trainable Networks","created":"2022-06-02","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":"2106.09269","title":"Pruning Randomly Initialized Neural Networks with Iterative Randomization","created":"2021-06-17","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}],"next_cursor":"100"}