{"total":192,"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":"2401.15024","title":"SliceGPT: Compress Large Language Models by Deleting Rows and Columns","created":"2024-01-26","cited_by_count":385,"area":null},{"id":"2208.11580","title":"Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruning","created":"2022-08-24","cited_by_count":322,"area":null},{"id":"2307.10169","title":"Challenges and Applications of Large Language Models","created":"2023-07-19","cited_by_count":254,"area":null},{"id":"2108.00708","title":"Group Fisher Pruning for Practical Network Compression","created":"2021-08-02","cited_by_count":131,"area":null},{"id":"2110.04869","title":"Global Vision Transformer Pruning with Hessian-Aware Saliency","created":"2021-10-10","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":"2402.09748","title":"Model Compression and Efficient Inference for Large Language Models: A Survey","created":"2024-02-15","cited_by_count":64,"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":"2311.09755","title":"On the Impact of Calibration Data in Post-training Quantization and Pruning","created":"2023-11-16","cited_by_count":58,"area":null},{"id":"2111.13445","title":"How Well Do Sparse Imagenet Models Transfer?","created":"2021-11-26","cited_by_count":50,"area":null},{"id":"2409.17481","title":"MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models","created":"2024-09-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":"2307.02973","title":"Pruning vs Quantization: Which is Better?","created":"2023-07-06","cited_by_count":46,"area":null},{"id":"2309.08520","title":"Scaling Laws for Sparsely-Connected Foundation Models","created":"2023-09-15","cited_by_count":43,"area":null},{"id":"2402.05406","title":"Everybody Prune Now: Structured Pruning of LLMs with only Forward Passes","created":"2024-02-08","cited_by_count":43,"area":null},{"id":"2302.01107","title":"A Survey on Efficient Training of Transformers","created":"2023-02-02","cited_by_count":39,"area":null},{"id":"2402.10193","title":"BitDelta: Your Fine-Tune May Only Be Worth One Bit","created":"2024-02-15","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":"2201.13096","title":"SPDY: Accurate Pruning with Speedup Guarantees","created":"2022-01-31","cited_by_count":36,"area":null},{"id":"2307.07982","title":"A Survey of Techniques for Optimizing Transformer Inference","created":"2023-07-16","cited_by_count":35,"area":null},{"id":"2105.09564","title":"Dual-side Sparse Tensor Core","created":"2021-05-20","cited_by_count":29,"area":null},{"id":"2208.06118","title":"An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformers","created":"2022-08-12","cited_by_count":29,"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":"2304.03589","title":"On Efficient Training of Large-Scale Deep Learning Models: A Literature Review","created":"2023-04-07","cited_by_count":26,"area":null},{"id":"2410.11988","title":"DISP-LLM: Dimension-Independent Structural Pruning for Large Language Models","created":"2024-10-15","cited_by_count":24,"area":null},{"id":"2301.12017","title":"Understanding INT4 Quantization for Transformer Models: Latency Speedup, Composability, and Failure Cases","created":"2023-01-27","cited_by_count":23,"area":null},{"id":"2306.15552","title":"A Survey on Deep Learning Hardware Accelerators for Heterogeneous HPC Platforms","created":"2023-06-27","cited_by_count":21,"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.10727","title":"Boost Vision Transformer with GPU-Friendly Sparsity and Quantization","created":"2023-05-18","cited_by_count":20,"area":null},{"id":"2409.13652","title":"OATS: Outlier-Aware Pruning Through Sparse and Low Rank Decomposition","created":"2024-09-20","cited_by_count":20,"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":"2110.15766","title":"NxMTransformer: Semi-Structured Sparsification for Natural Language Understanding via ADMM","created":"2021-10-28","cited_by_count":19,"area":null},{"id":"2212.00824","title":"On-device Training: A First Overview on Existing Systems","created":"2022-12-01","cited_by_count":19,"area":null},{"id":"2404.01847","title":"Accelerating Transformer Pre-training with 2:4 Sparsity","created":"2024-04-02","cited_by_count":19,"area":null},{"id":"2405.20935","title":"Effective Interplay between Sparsity and Quantization: From Theory to Practice","created":"2024-05-31","cited_by_count":19,"area":null},{"id":"2505.17761","title":"Structured Linear CDEs: Maximally Expressive and Parallel-in-Time Sequence Models","created":"2025-05-23","cited_by_count":18,"area":null},{"id":"2105.11010","title":"Post-Training Sparsity-Aware Quantization","created":"2021-05-23","cited_by_count":17,"area":null},{"id":"2309.10285","title":"Flash-LLM: Enabling Cost-Effective and Highly-Efficient Large Generative Model Inference with Unstructured Sparsity","created":"2023-09-19","cited_by_count":17,"area":null},{"id":"2105.14713","title":"1xN Pattern for Pruning Convolutional Neural Networks","created":"2021-05-31","cited_by_count":16,"area":null},{"id":"2311.09335","title":"Investigating Hallucinations in Pruned Large Language Models for Abstractive Summarization","created":"2023-11-15","cited_by_count":16,"area":null},{"id":"2405.15743","title":"Sparse maximal update parameterization: A holistic approach to sparse training dynamics","created":"2024-05-24","cited_by_count":16,"area":null},{"id":"2112.13896","title":"Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networks","created":"2021-12-27","cited_by_count":15,"area":null},{"id":"2310.15929","title":"E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsity","created":"2023-10-24","cited_by_count":15,"area":null},{"id":"2203.00091","title":"Dynamic N:M Fine-grained Structured Sparse Attention Mechanism","created":"2022-02-28","cited_by_count":14,"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":"2304.14082","title":"JaxPruner: A concise library for sparsity research","created":"2023-04-27","cited_by_count":13,"area":null},{"id":"2310.02065","title":"VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Cores","created":"2023-10-03","cited_by_count":13,"area":null},{"id":"2410.17170","title":"Self-calibration for Language Model Quantization and Pruning","created":"2024-10-22","cited_by_count":13,"area":null},{"id":"2204.12266","title":"Attentive Fine-Grained Structured Sparsity for Image Restoration","created":"2022-04-26","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":"2305.11203","title":"PDP: Parameter-free Differentiable Pruning is All You Need","created":"2023-05-18","cited_by_count":12,"area":null},{"id":"2305.12718","title":"HighLight: Efficient and Flexible DNN Acceleration with Hierarchical Structured Sparsity","created":"2023-05-22","cited_by_count":12,"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":"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":"2203.10991","title":"Minimum Variance Unbiased N:M Sparsity for the Neural Gradients","created":"2022-03-21","cited_by_count":9,"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":"2212.05427","title":"Statistical guarantees for sparse deep learning","created":"2022-12-11","cited_by_count":9,"area":null},{"id":"2302.08687","title":"VEGETA: Vertically-Integrated Extensions for Sparse/Dense GEMM Tile Acceleration on CPUs","created":"2023-02-17","cited_by_count":9,"area":null},{"id":"2503.16672","title":"Accelerating Transformer Inference and Training with 2:4 Activation Sparsity","created":"2025-03-20","cited_by_count":9,"area":null},{"id":"2409.04482","title":"SCARF: Scalable Continual Learning Framework for Memory-efficient Multiple Neural Radiance Fields","created":"2024-09-06","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":"2403.18587","title":"The Impact of Uniform Inputs on Activation Sparsity and Energy-Latency Attacks in Computer Vision","created":"2024-03-27","cited_by_count":7,"area":null},{"id":"2409.01990","title":"Designing Large Foundation Models for Efficient Training and Inference: A Survey","created":"2024-09-03","cited_by_count":7,"area":null},{"id":"2409.09099","title":"S-STE: Continuous Pruning Function for Efficient 2:4 Sparse Pre-training","created":"2024-09-13","cited_by_count":7,"area":null},{"id":"2510.07985","title":"Fewer Weights, More Problems: A Practical Attack on LLM Pruning","created":"2025-10-09","cited_by_count":7,"area":null},{"id":"2506.20194","title":"DuoGPT: Training-free Dual Sparsity through Activation-aware Pruning in LLMs","created":"2025-06-25","cited_by_count":6,"area":null},{"id":"2509.11177","title":"Optimal Brain Restoration for Joint Quantization and Sparsification of LLMs","created":"2025-09-14","cited_by_count":6,"area":null},{"id":"2509.22075","title":"CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learning","created":"2025-09-26","cited_by_count":6,"area":null},{"id":"2309.13015","title":"Efficient N:M Sparse DNN Training Using Algorithm, Architecture, and Dataflow Co-Design","created":"2023-09-22","cited_by_count":5,"area":null},{"id":"2404.11630","title":"SNP: Structured Neuron-level Pruning to Preserve Attention Scores","created":"2024-04-18","cited_by_count":5,"area":null},{"id":"2412.17560","title":"GQSA: Group Quantization and Sparsity for Accelerating Large Language Model Inference","created":"2024-12-23","cited_by_count":5,"area":null},{"id":"2504.21174","title":"Efficient LLMs with AMP: Attention Heads and MLP Pruning","created":"2025-04-29","cited_by_count":5,"area":null},{"id":"2510.12077","title":"Compressibility Measures Complexity: Minimum Description Length Meets Singular Learning Theory","created":"2025-10-14","cited_by_count":5,"area":null},{"id":"2302.07612","title":"Towards Optimal Compression: Joint Pruning and Quantization","created":"2023-02-15","cited_by_count":4,"area":null},{"id":"2309.06047","title":"Real-Time Semantic Segmentation: A Brief Survey & Comparative Study in Remote Sensing","created":"2023-09-12","cited_by_count":4,"area":null},{"id":"2311.04386","title":"Harnessing Manycore Processors with Distributed Memory for Accelerated Training of Sparse and Recurrent Models","created":"2023-11-07","cited_by_count":4,"area":null},{"id":"2404.10824","title":"Decoupled Weight Decay for Any $p$ Norm","created":"2024-04-16","cited_by_count":4,"area":null},{"id":"2501.15889","title":"Adaptive Width Neural Networks","created":"2025-01-27","cited_by_count":4,"area":null},{"id":"2501.19090","title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models","created":"2025-01-31","cited_by_count":4,"area":null},{"id":"2502.18424","title":"Compressing Language Models for Specialized Domains","created":"2025-02-25","cited_by_count":4,"area":null},{"id":"2512.10922","title":"SparseSwaps: Tractable LLM Pruning Mask Refinement at Scale","created":"2025-12-11","cited_by_count":4,"area":null},{"id":"2602.18116","title":"Cut Less, Fold More: Model Compression through the Lens of Projection Geometry","created":"2026-02-20","cited_by_count":4,"area":null},{"id":"2105.12920","title":"Search Spaces for Neural Model Training","created":"2021-05-27","cited_by_count":3,"area":null},{"id":"2202.00834","title":"Nonlinear Initialization Methods for Low-Rank Neural Networks","created":"2022-02-02","cited_by_count":3,"area":null},{"id":"2302.01382","title":"Mixed Precision Post Training Quantization of Neural Networks with Sensitivity Guided Search","created":"2023-02-02","cited_by_count":3,"area":null},{"id":"2303.16999","title":"PopSparse: Accelerated block sparse matrix multiplication on IPU","created":"2023-03-29","cited_by_count":3,"area":null},{"id":"2306.04879","title":"Augmenting Hessians with Inter-Layer Dependencies for Mixed-Precision Post-Training Quantization","created":"2023-06-08","cited_by_count":3,"area":null},{"id":"2306.11393","title":"The Cultivated Practices of Text-to-Image Generation","created":"2023-06-20","cited_by_count":3,"area":null},{"id":"2308.07641","title":"Ternary Singular Value Decomposition as a Better Parameterized Form in Linear Mapping","created":"2023-08-15","cited_by_count":3,"area":null},{"id":"2311.17539","title":"Critical Influence of Overparameterization on Sharpness-aware Minimization","created":"2023-11-29","cited_by_count":3,"area":null},{"id":"2409.05227","title":"BBS: Bi-directional Bit-level Sparsity for Deep Learning Acceleration","created":"2024-09-08","cited_by_count":3,"area":null},{"id":"2410.21262","title":"BLAST: Block-Level Adaptive Structured Matrices for Efficient Deep Neural Network Inference","created":"2024-10-28","cited_by_count":3,"area":null},{"id":"2411.03171","title":"Navigating Extremes: Dynamic Sparsity in Large Output Spaces","created":"2024-11-05","cited_by_count":3,"area":null},{"id":"2411.09816","title":"Learning Fine-grained Parameter Sharing via Sparse Tensor Decomposition","created":"2024-11-14","cited_by_count":3,"area":null},{"id":"2501.18596","title":"DeltaLLM: Compress LLMs with Low-Rank Deltas between Shared Weights","created":"2025-01-30","cited_by_count":3,"area":null},{"id":"2504.14365","title":"Accelerating LLM Inference with Flexible N:M Sparsity via A Fully Digital Compute-in-Memory Accelerator","created":"2025-04-19","cited_by_count":3,"area":null}],"next_cursor":"100"}