{"total":151,"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":"2205.13147","title":"Matryoshka Representation Learning","created":"2022-05-26","cited_by_count":282,"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":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"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":"2310.07707","title":"MatFormer: Nested Transformer for Elastic Inference","created":"2023-10-11","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":"2106.03517","title":"Top-KAST: Top-K Always Sparse Training","created":"2021-06-07","cited_by_count":79,"area":null},{"id":"2103.03014","title":"Lost in Pruning: The Effects of Pruning Neural Networks beyond Test Accuracy","created":"2021-03-04","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":"2106.12379","title":"AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks","created":"2021-06-23","cited_by_count":59,"area":null},{"id":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2107.03356","title":"M-FAC: Efficient Matrix-Free Approximations of Second-Order Information","created":"2021-07-07","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":"2110.00296","title":"Powerpropagation: A sparsity inducing weight reparameterisation","created":"2021-10-01","cited_by_count":49,"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":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2101.07577","title":"Learnable Embedding Sizes for Recommender Systems","created":"2021-01-19","cited_by_count":42,"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":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","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":"2111.05685","title":"Efficient Neural Network Training via Forward and Backward Propagation Sparsification","created":"2021-11-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":"2310.02556","title":"NOLA: Compressing LoRA using Linear Combination of Random Basis","created":"2023-10-04","cited_by_count":29,"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.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":"2210.02412","title":"Why Random Pruning Is All We Need to Start Sparse","created":"2022-10-05","cited_by_count":26,"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":"2104.15023","title":"Post-training deep neural network pruning via layer-wise calibration","created":"2021-04-30","cited_by_count":24,"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":"2405.16534","title":"Pruning for Robust Concept Erasing in Diffusion Models","created":"2024-05-26","cited_by_count":22,"area":"diffusion"},{"id":"2310.04621","title":"Model Compression in Practice: Lessons Learned from Practitioners Creating On-device Machine Learning Experiences","created":"2023-10-06","cited_by_count":21,"area":null},{"id":"2209.08554","title":"Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptions","created":"2022-09-18","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":"2301.09254","title":"Learning to Linearize Deep Neural Networks for Secure and Efficient Private Inference","created":"2023-01-23","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":"2310.18608","title":"Embedding in Recommender Systems: A Survey","created":"2023-10-28","cited_by_count":20,"area":null},{"id":"2406.07831","title":"ALPS: Improved Optimization for Highly Sparse One-Shot Pruning for Large Language Models","created":"2024-06-12","cited_by_count":19,"area":null},{"id":"2209.04766","title":"Towards Sparsification of Graph Neural Networks","created":"2022-09-11","cited_by_count":18,"area":null},{"id":"2307.08045","title":"Beyond Classical Attention: Quantum Attention for Scalable Computation","created":"2023-07-16","cited_by_count":18,"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":"2108.08532","title":"An Information Theory-inspired Strategy for Automatic Network Pruning","created":"2021-08-19","cited_by_count":17,"area":null},{"id":"2210.01212","title":"spred: Solving $L_1$ Penalty with SGD","created":"2022-10-03","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":"2205.11921","title":"Compression-aware Training of Neural Networks using Frank-Wolfe","created":"2022-05-24","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":"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":"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":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2502.02496","title":"Deep Weight Factorization: Sparse Learning Through the Lens of Artificial Symmetries","created":"2025-02-04","cited_by_count":14,"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.04852","title":"SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks","created":"2023-02-09","cited_by_count":13,"area":null},{"id":"2501.13492","title":"Quantized Spike-driven Transformer","created":"2025-01-23","cited_by_count":13,"area":null},{"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":"2211.02206","title":"Soft Masking for Cost-Constrained Channel Pruning","created":"2022-11-04","cited_by_count":12,"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":"2106.06955","title":"Towards Understanding Iterative Magnitude Pruning: Why Lottery Tickets Win","created":"2021-06-13","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":"2304.12622","title":"Bias in Pruned Vision Models: In-Depth Analysis and Countermeasures","created":"2023-04-25","cited_by_count":11,"area":null},{"id":"2403.07094","title":"FALCON: FLOP-Aware Combinatorial Optimization for Neural Network Pruning","created":"2024-03-11","cited_by_count":11,"area":null},{"id":"2405.16057","title":"SPP: Sparsity-Preserved Parameter-Efficient Fine-Tuning for Large Language Models","created":"2024-05-25","cited_by_count":11,"area":null},{"id":"2104.08700","title":"Lottery Jackpots Exist in Pre-trained Models","created":"2021-04-18","cited_by_count":10,"area":null},{"id":"2201.05842","title":"UDC: Unified DNAS for Compressible TinyML Models","created":"2022-01-15","cited_by_count":10,"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":"2207.04089","title":"SInGE: Sparsity via Integrated Gradients Estimation of Neuron Relevance","created":"2022-07-08","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":"2205.14107","title":"Spartan: Differentiable Sparsity via Regularized Transportation","created":"2022-05-27","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":"2106.01487","title":"LLC: Accurate, Multi-purpose Learnt Low-dimensional Binary Codes","created":"2021-06-02","cited_by_count":7,"area":null},{"id":"2207.14200","title":"CrAM: A Compression-Aware Minimizer","created":"2022-07-28","cited_by_count":7,"area":null},{"id":"2202.01290","title":"Cyclical Pruning for Sparse Neural Networks","created":"2022-02-02","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":"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":"2412.07268","title":"PTSBench: A Comprehensive Post-Training Sparsity Benchmark Towards Algorithms and Models","created":"2024-12-10","cited_by_count":5,"area":null},{"id":"2412.14714","title":"Holistic Adversarially Robust Pruning","created":"2024-12-19","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":"2504.02168","title":"MDP: Multidimensional Vision Model Pruning with Latency Constraint","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2506.06866","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2106.14126","title":"AdaptCL: Efficient Collaborative Learning with Dynamic and Adaptive Pruning","created":"2021-06-27","cited_by_count":4,"area":null},{"id":"2204.01390","title":"A Comprehensive Survey on Automated Machine Learning for Recommendations","created":"2022-04-04","cited_by_count":4,"area":null},{"id":"2304.13718","title":"Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Models","created":"2023-04-26","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":"2404.02424","title":"Rethinking Pruning for Vision-Language Models: Strategies for Effective Sparsity and Performance Restoration","created":"2024-04-03","cited_by_count":4,"area":"lr"},{"id":"2405.18400","title":"Superposed Decoding: Multiple Generations from a Single Autoregressive Inference Pass","created":"2024-05-28","cited_by_count":4,"area":null},{"id":"2406.12079","title":"Multi-Dimensional Pruning: Joint Channel, Layer and Block Pruning with Latency Constraint","created":"2024-06-17","cited_by_count":4,"area":null},{"id":"2406.17335","title":"A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems","created":"2024-06-25","cited_by_count":4,"area":null},{"id":"2406.19301","title":"MCNC: Manifold-Constrained Reparameterization for Neural Compression","created":"2024-06-27","cited_by_count":4,"area":null},{"id":"2410.10714","title":"SeedLM: Compressing LLM Weights into Seeds of Pseudo-Random Generators","created":"2024-10-14","cited_by_count":4,"area":null},{"id":"2105.01064","title":"Alternate Model Growth and Pruning for Efficient Training of Recommendation Systems","created":"2021-05-04","cited_by_count":3,"area":null},{"id":"2202.09284","title":"Amenable Sparse Network Investigator","created":"2022-02-18","cited_by_count":3,"area":null},{"id":"2306.07030","title":"Resource Efficient Neural Networks Using Hessian Based Pruning","created":"2023-06-12","cited_by_count":3,"area":null},{"id":"2405.05808","title":"Fast and Controllable Post-training Sparsity: Learning Optimal Sparsity Allocation with Global Constraint in Minutes","created":"2024-05-09","cited_by_count":3,"area":null}],"next_cursor":"100"}