{"total":58,"rows":[{"id":"2112.11446","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","created":"2021-12-08","cited_by_count":1202,"area":null},{"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":"2303.00566","title":"Structured Pruning for Deep Convolutional Neural Networks: A survey","created":"2023-03-01","cited_by_count":122,"area":null},{"id":"2204.00595","title":"Monarch: Expressive Structured Matrices for Efficient and Accurate Training","created":"2022-04-01","cited_by_count":106,"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":"2210.04092","title":"Advancing Model Pruning via Bi-level Optimization","created":"2022-10-08","cited_by_count":56,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"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":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","cited_by_count":36,"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":"2210.09223","title":"CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models","created":"2022-10-14","cited_by_count":20,"area":null},{"id":"2305.19454","title":"Dynamic Sparsity Is Channel-Level Sparsity Learner","created":"2023-05-30","cited_by_count":18,"area":null},{"id":"2408.09966","title":"Mask in the Mirror: Implicit Sparsification","created":"2024-08-19","cited_by_count":14,"area":null},{"id":"2206.00395","title":"Optimization with Access to Auxiliary Information","created":"2022-06-01","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.04852","title":"SparseProp: Efficient Sparse Backpropagation for Faster Training of Neural Networks","created":"2023-02-09","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":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2404.04748","title":"Multilingual Brain Surgeon: Large Language Models Can be Compressed Leaving No Language Behind","created":"2024-04-06","cited_by_count":11,"area":null},{"id":"2408.12568","title":"Pruning By Explaining Revisited: Optimizing Attribution Methods to Prune CNNs and Transformers","created":"2024-08-22","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":"2308.02060","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","created":"2023-08-03","cited_by_count":10,"area":null},{"id":"2204.08274","title":"Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime","created":"2022-04-11","cited_by_count":9,"area":null},{"id":"2408.17163","title":"The Iterative Optimal Brain Surgeon: Faster Sparse Recovery by Leveraging Second-Order Information","created":"2024-08-30","cited_by_count":8,"area":null},{"id":"2207.14200","title":"CrAM: A Compression-Aware Minimizer","created":"2022-07-28","cited_by_count":7,"area":null},{"id":"2504.05346","title":"Thanos: A Block-wise Pruning Algorithm for Efficient Large Language Model Compression","created":"2025-04-06","cited_by_count":7,"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":"2506.06866","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","created":"2025-06-07","cited_by_count":5,"area":null},{"id":"2311.01544","title":"Divergent Token Metrics: Measuring degradation to prune away LLM components -- and optimize quantization","created":"2023-11-02","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":"2210.05279","title":"Zeroth-Order Hard-Thresholding: Gradient Error vs. Expansivity","created":"2022-10-11","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":"2306.07030","title":"Resource Efficient Neural Networks Using Hessian Based Pruning","created":"2023-06-12","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":"2509.23898","title":"Differentiable Sparsity via $D$-Gating: Simple and Versatile Structured Penalization","created":"2025-09-28","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":"2310.04519","title":"SPADE: Sparsity-Guided Debugging for Deep Neural Networks","created":"2023-10-06","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":"2501.12486","title":"The Journey Matters: Average Parameter Count over Pre-training Unifies Sparse and Dense Scaling Laws","created":"2025-01-21","cited_by_count":2,"area":null},{"id":"2505.19349","title":"DECA: A Near-Core LLM Decompression Accelerator Grounded on a 3D Roofline Model","created":"2025-05-25","cited_by_count":2,"area":null},{"id":"2506.07854","title":"Residual Reweighted Conformal Prediction for Graph Neural Networks","created":"2025-06-09","cited_by_count":2,"area":null},{"id":"2204.07412","title":"End-to-End Sensitivity-Based Filter Pruning","created":"2022-04-15","cited_by_count":1,"area":null},{"id":"2207.00670","title":"DRESS: Dynamic REal-time Sparse Subnets","created":"2022-07-01","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":"2406.02773","title":"Cyclic Sparse Training: Is it Enough?","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2502.11439","title":"An Efficient Sparse Fine-Tuning with Low Quantization Error via Neural Network Pruning","created":"2025-02-17","cited_by_count":1,"area":null},{"id":"2210.11114","title":"Pruning by Active Attention Manipulation","created":"2022-10-20","cited_by_count":0,"area":null},{"id":"2310.18542","title":"End-to-end Feature Selection Approach for Learning Skinny Trees","created":"2023-10-28","cited_by_count":0,"area":null},{"id":"2312.06872","title":"ELSA: Partial Weight Freezing for Overhead-Free Sparse Network Deployment","created":"2023-12-11","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.14398","title":"Regularized Adaptive Momentum Dual Averaging with an Efficient Inexact Subproblem Solver for Training Structured Neural Network","created":"2024-03-21","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":"2605.21104","title":"HORST: Composing Optimizer Geometries for Sparse Transformer Training","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2606.14346","title":"Squeeze-Release: Iterative Pruning with Exact Structural Minimization","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2609.04271","title":"Quantum-Assisted Memory-Efficient Training for Parameter-Intensive Wi-Fi-Based Human Activity Recognition","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}