{"total":162,"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":"2304.14997","title":"Towards Automated Circuit Discovery for Mechanistic Interpretability","created":"2023-04-28","cited_by_count":724,"area":"mechinterp"},{"id":"2305.11627","title":"LLM-Pruner: On the Structural Pruning of Large Language Models","created":"2023-05-19","cited_by_count":650,"area":null},{"id":"2306.07629","title":"SqueezeLLM: Dense-and-Sparse Quantization","created":"2023-06-13","cited_by_count":294,"area":null},{"id":"2406.19707","title":"InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management","created":"2024-06-28","cited_by_count":245,"area":"inference"},{"id":"2404.14294","title":"A Survey on Efficient Inference for Large Language Models","created":"2024-04-22","cited_by_count":205,"area":"inference"},{"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":"2312.04511","title":"An LLM Compiler for Parallel Function Calling","created":"2023-12-07","cited_by_count":179,"area":"lr"},{"id":"2302.07863","title":"Speculative Decoding with Big Little Decoder","created":"2023-02-15","cited_by_count":164,"area":"inference"},{"id":"2402.14800","title":"Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models","created":"2024-02-22","cited_by_count":146,"area":"moe"},{"id":"2410.19258","title":"Not All Heads Matter: A Head-Level KV Cache Compression Method with Integrated Retrieval and Reasoning","created":"2024-10-25","cited_by_count":97,"area":"lr"},{"id":"2403.14123","title":"AI and Memory Wall","created":"2024-03-21","cited_by_count":92,"area":null},{"id":"2402.02834","title":"Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods","created":"2024-02-05","cited_by_count":82,"area":null},{"id":"2302.14017","title":"Full Stack Optimization of Transformer Inference: a Survey","created":"2023-02-27","cited_by_count":80,"area":null},{"id":"2303.08302","title":"ZeroQuant-V2: Exploring Post-training Quantization in LLMs from Comprehensive Study to Low Rank Compensation","created":"2023-03-15","cited_by_count":79,"area":null},{"id":"2305.15805","title":"Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers","created":"2023-05-25","cited_by_count":67,"area":null},{"id":"2401.03868","title":"FlightLLM: Efficient Large Language Model Inference with a Complete Mapping Flow on FPGAs","created":"2024-01-08","cited_by_count":64,"area":"inference"},{"id":"2407.00945","title":"Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs","created":"2024-07-01","cited_by_count":53,"area":"moe"},{"id":"2302.04089","title":"ZipLM: Inference-Aware Structured Pruning of Language Models","created":"2023-02-07","cited_by_count":49,"area":null},{"id":"2403.11421","title":"FastDecode: High-Throughput GPU-Efficient LLM Serving using Heterogeneous Pipelines","created":"2024-03-18","cited_by_count":49,"area":"inference"},{"id":"2503.06027","title":"Empowering Edge Intelligence: A Comprehensive Survey on On-Device AI Models","created":"2025-03-08","cited_by_count":46,"area":null},{"id":"2308.08758","title":"Discrete Prompt Compression with Reinforcement Learning","created":"2023-08-17","cited_by_count":42,"area":"inference"},{"id":"2410.06270","title":"Mixture Compressor for Mixture-of-Experts LLMs Gains More","created":"2024-10-08","cited_by_count":41,"area":"moe"},{"id":"2307.05908","title":"Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decoding","created":"2023-07-12","cited_by_count":40,"area":null},{"id":"2406.02924","title":"Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models","created":"2024-06-05","cited_by_count":40,"area":null},{"id":"2405.05252","title":"Attention-Driven Training-Free Efficiency Enhancement of Diffusion Models","created":"2024-05-08","cited_by_count":38,"area":"diffusion"},{"id":"2502.15734","title":"Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation","created":"2025-02-05","cited_by_count":36,"area":"rag"},{"id":"2307.07982","title":"A Survey of Techniques for Optimizing Transformer Inference","created":"2023-07-16","cited_by_count":35,"area":null},{"id":"2405.16148","title":"Accelerating Transformers with Spectrum-Preserving Token Merging","created":"2024-05-25","cited_by_count":35,"area":"inference"},{"id":"2308.00255","title":"LGViT: Dynamic Early Exiting for Accelerating Vision Transformer","created":"2023-08-01","cited_by_count":31,"area":"inference"},{"id":"2302.03773","title":"What Matters In The Structured Pruning of Generative Language Models?","created":"2023-02-07","cited_by_count":30,"area":null},{"id":"2401.12200","title":"APT: Adaptive Pruning and Tuning Pretrained Language Models for Efficient Training and Inference","created":"2024-01-22","cited_by_count":29,"area":null},{"id":"2305.11186","title":"Compress, Then Prompt: Improving Accuracy-Efficiency Trade-off of LLM Inference with Transferable Prompt","created":"2023-05-17","cited_by_count":28,"area":null},{"id":"2303.04185","title":"Gradient-Free Structured Pruning with Unlabeled Data","created":"2023-03-07","cited_by_count":26,"area":null},{"id":"2302.14705","title":"AccelTran: A Sparsity-Aware Accelerator for Dynamic Inference with Transformers","created":"2023-02-28","cited_by_count":24,"area":null},{"id":"2402.17946","title":"SparseLLM: Towards Global Pruning for Pre-trained Language Models","created":"2024-02-28","cited_by_count":23,"area":null},{"id":"2410.15567","title":"Pruning Foundation Models for High Accuracy without Retraining","created":"2024-10-21","cited_by_count":20,"area":null},{"id":"2310.02998","title":"ECoFLaP: Efficient Coarse-to-Fine Layer-Wise Pruning for Vision-Language Models","created":"2023-10-04","cited_by_count":19,"area":"mllm"},{"id":"2408.12151","title":"A Tighter Complexity Analysis of SparseGPT","created":"2024-08-22","cited_by_count":19,"area":null},{"id":"2311.13171","title":"ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantization","created":"2023-11-22","cited_by_count":18,"area":null},{"id":"2403.12983","title":"OSSCAR: One-Shot Structured Pruning in Vision and Language Models with Combinatorial Optimization","created":"2024-03-02","cited_by_count":18,"area":null},{"id":"2403.17921","title":"The Need for Speed: Pruning Transformers with One Recipe","created":"2024-03-26","cited_by_count":16,"area":null},{"id":"2412.14590","title":"MixLLM: LLM Quantization with Global Mixed-precision between Output-features and Highly-efficient System Design","created":"2024-12-19","cited_by_count":16,"area":null},{"id":"2504.02620","title":"Efficient Model Editing with Task-Localized Sparse Fine-tuning","created":"2025-04-03","cited_by_count":16,"area":null},{"id":"2401.15347","title":"A Comprehensive Survey of Compression Algorithms for Language Models","created":"2024-01-27","cited_by_count":15,"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":"2410.20650","title":"NeuZip: Memory-Efficient Training and Inference with Dynamic Compression of Neural Networks","created":"2024-10-28","cited_by_count":14,"area":null},{"id":"2403.10799","title":"Toward Adaptive Large Language Models Structured Pruning via Hybrid-grained Weight Importance Assessment","created":"2024-03-16","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":"2312.06733","title":"TULIP: Transformer for Upsampling of LiDAR Point Clouds","created":"2023-12-11","cited_by_count":12,"area":null},{"id":"2308.03449","title":"Accurate Retraining-free Pruning for Pretrained Encoder-based Language Models","created":"2023-08-07","cited_by_count":11,"area":null},{"id":"2403.02619","title":"Training Machine Learning models at the Edge: A Survey","created":"2024-03-05","cited_by_count":11,"area":null},{"id":"2410.08696","title":"AMPO: Automatic Multi-Branched Prompt Optimization","created":"2024-10-11","cited_by_count":11,"area":null},{"id":"2401.12819","title":"Dynamic Layer Tying for Parameter-Efficient Transformers","created":"2024-01-23","cited_by_count":10,"area":"deeprl"},{"id":"2412.02852","title":"Learnable Sparsity for Vision Generative Models","created":"2024-12-03","cited_by_count":9,"area":"diffusion"},{"id":"2502.19159","title":"Sliding-Window Merging for Compacting Patch-Redundant Layers in LLMs","created":"2025-02-26","cited_by_count":9,"area":null},{"id":"2504.19274","title":"TeleSparse: Practical Privacy-Preserving Verification of Deep Neural Networks","created":"2025-04-27","cited_by_count":9,"area":null},{"id":"2508.02401","title":"CompressKV: Semantic Retrieval Heads Know What Tokens are Not Important Before Generation","created":"2025-08-04","cited_by_count":9,"area":"inference"},{"id":"2607.01940","title":"Conditional Co-Ablation: Recovering Self-Repair Backups in Transformer Circuits","created":"2026-07-02","cited_by_count":9,"area":"mechinterp"},{"id":"2308.04637","title":"Sparse Binary Transformers for Multivariate Time Series Modeling","created":"2023-08-09","cited_by_count":8,"area":null},{"id":"2310.10054","title":"NASH: A Simple Unified Framework of Structured Pruning for Accelerating Encoder-Decoder Language Models","created":"2023-10-16","cited_by_count":7,"area":null},{"id":"2408.16772","title":"An Effective Information Theoretic Framework for Channel Pruning","created":"2024-08-14","cited_by_count":7,"area":null},{"id":"2410.09454","title":"Skipping Computations in Multimodal LLMs","created":"2024-10-12","cited_by_count":7,"area":"mllm"},{"id":"2503.15369","title":"EfficientLLaVA:Generalizable Auto-Pruning for Large Vision-language Models","created":"2025-03-19","cited_by_count":7,"area":"mllm"},{"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":"2506.08436","title":"Olica: Efficient Structured Pruning of Large Language Models without Retraining","created":"2025-06-10","cited_by_count":6,"area":null},{"id":"2509.14230","title":"NIRVANA: Structured Pruning Reimagined for Large Language Model Compression","created":"2025-09-17","cited_by_count":6,"area":null},{"id":"2603.25336","title":"HeSS: Head Sensitivity Score for Sparsity Redistribution in VGGT","created":"2026-03-26","cited_by_count":6,"area":null},{"id":"2308.16475","title":"$\\rm SP^3$: Enhancing Structured Pruning via PCA Projection","created":"2023-08-31","cited_by_count":5,"area":null},{"id":"2309.01479","title":"Parameter and Computation Efficient Transfer Learning for Vision-Language Pre-trained Models","created":"2023-09-04","cited_by_count":5,"area":"mllm"},{"id":"2401.16367","title":"TQCompressor: improving tensor decomposition methods in neural networks via permutations","created":"2024-01-29","cited_by_count":5,"area":null},{"id":"2405.02267","title":"Structural Pruning of Pre-trained Language Models via Neural Architecture Search","created":"2024-05-03","cited_by_count":5,"area":null},{"id":"2406.01392","title":"Sparsity-Accelerated Training for Large Language Models","created":"2024-06-03","cited_by_count":5,"area":null},{"id":"2407.11681","title":"MINI-LLM: Memory-Efficient Structured Pruning for Large Language Models","created":"2024-07-16","cited_by_count":5,"area":null},{"id":"2501.15014","title":"On Accelerating Edge AI: Optimizing Resource-Constrained Environments","created":"2025-01-25","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":"2510.18358","title":"Ensembling Pruned Attention Heads For Uncertainty-Aware Efficient Transformers","created":"2025-10-21","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":"2306.11903","title":"Deep Fusion: Efficient Network Training via Pre-trained Initializations","created":"2023-06-20","cited_by_count":4,"area":null},{"id":"2401.04044","title":"FFSplit: Split Feed-Forward Network For Optimizing Accuracy-Efficiency Trade-off in Language Model Inference","created":"2024-01-08","cited_by_count":4,"area":null},{"id":"2403.09891","title":"Fisher Mask Nodes for Language Model Merging","created":"2024-03-14","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":"2407.13331","title":"Reconstruct the Pruned Model without Any Retraining","created":"2024-07-18","cited_by_count":4,"area":null},{"id":"2412.02054","title":"Redundant Queries in DETR-Based 3D Detection Methods: Unnecessary and Prunable","created":"2024-12-03","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":"2503.09657","title":"T\\'yr-the-Pruner: Structural Pruning LLMs via Global Sparsity Distribution Optimization","created":"2025-03-12","cited_by_count":4,"area":null},{"id":"2504.16269","title":"COBRA: Algorithm-Architecture Co-optimized Binary Transformer Accelerator for Edge Inference","created":"2025-04-22","cited_by_count":4,"area":null},{"id":"2510.17700","title":"Elastic ViTs from Pretrained Models without Retraining","created":"2025-10-20","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":"2406.05276","title":"VTrans: Accelerating Transformer Compression with Variational Information Bottleneck based Pruning","created":"2024-06-07","cited_by_count":3,"area":null},{"id":"2406.08804","title":"DIET: Customized Slimming for Incompatible Networks in Sequential Recommendation","created":"2024-06-13","cited_by_count":3,"area":null},{"id":"2410.14852","title":"FedSpaLLM: Federated Pruning of Large Language Models","created":"2024-10-18","cited_by_count":3,"area":null},{"id":"2508.17233","title":"Module-Aware Parameter-Efficient Machine Unlearning on Transformers","created":"2025-08-24","cited_by_count":3,"area":"safety"},{"id":"2602.02599","title":"RAP: KV-Cache Compression via RoPE-Aligned Pruning","created":"2026-02-01","cited_by_count":3,"area":"inference"},{"id":"2310.04649","title":"Uncovering Model Processing Strategies with Non-Negative Per-Example Fisher Factorization","created":"2023-10-07","cited_by_count":2,"area":null},{"id":"2405.06038","title":"From Algorithm to Hardware: A Survey on Efficient and Safe Deployment of Deep Neural Networks","created":"2024-05-09","cited_by_count":2,"area":null},{"id":"2406.00061","title":"STAT: Shrinking Transformers After Training","created":"2024-05-29","cited_by_count":2,"area":null},{"id":"2406.04146","title":"Towards Understanding Task-agnostic Debiasing Through the Lenses of Intrinsic Bias and Forgetfulness","created":"2024-06-06","cited_by_count":2,"area":null},{"id":"2412.11242","title":"TrimLLM: Progressive Layer Dropping for Domain-Specific LLMs","created":"2024-12-15","cited_by_count":2,"area":"inference"}],"next_cursor":"100"}