{"total":131,"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":"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":"2206.06522","title":"LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learning","created":"2022-06-13","cited_by_count":230,"area":null},{"id":"2111.09839","title":"Training Neural Networks with Fixed Sparse Masks","created":"2021-11-18","cited_by_count":214,"area":null},{"id":"2301.12900","title":"DepGraph: Towards Any Structural Pruning","created":"2023-01-30","cited_by_count":203,"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":"2207.00112","title":"Language model compression with weighted low-rank factorization","created":"2022-06-30","cited_by_count":195,"area":null},{"id":"2305.10924","title":"Structural Pruning for Diffusion Models","created":"2023-05-18","cited_by_count":195,"area":"diffusion"},{"id":"2109.02934","title":"Fishr: Invariant Gradient Variances for Out-of-Distribution Generalization","created":"2021-09-07","cited_by_count":186,"area":null},{"id":"2204.09656","title":"A Fast Post-Training Pruning Framework for Transformers","created":"2022-03-29","cited_by_count":162,"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":"2407.21118","title":"Palu: Compressing KV-Cache with Low-Rank Projection","created":"2024-07-30","cited_by_count":64,"area":"inference"},{"id":"2305.16742","title":"Parameter-Efficient Fine-Tuning without Introducing New Latency","created":"2023-05-26","cited_by_count":59,"area":null},{"id":"2301.11300","title":"ZiCo: Zero-shot NAS via Inverse Coefficient of Variation on Gradients","created":"2023-01-26","cited_by_count":58,"area":null},{"id":"2302.04089","title":"ZipLM: Inference-Aware Structured Pruning of Language Models","created":"2023-02-07","cited_by_count":49,"area":null},{"id":"2410.16942","title":"DiP-GO: A Diffusion Pruner via Few-step Gradient Optimization","created":"2024-10-22","cited_by_count":43,"area":"diffusion"},{"id":"2203.04466","title":"The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks","created":"2022-03-09","cited_by_count":41,"area":null},{"id":"2303.14488","title":"Adaptive Sparse Convolutional Networks with Global Context Enhancement for Faster Object Detection on Drone Images","created":"2023-03-25","cited_by_count":41,"area":null},{"id":"2305.02299","title":"Dynamic Sparse Training with Structured Sparsity","created":"2023-05-03","cited_by_count":38,"area":null},{"id":"2404.07236","title":"Lightweight Deep Learning for Resource-Constrained Environments: A Survey","created":"2024-04-08","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":"2110.11395","title":"SOSP: Efficiently Capturing Global Correlations by Second-Order Structured Pruning","created":"2021-10-19","cited_by_count":30,"area":null},{"id":"2410.14720","title":"SGLP: A Similarity Guided Fast Layer Partition Pruning for Compressing Large Deep Models","created":"2024-10-14","cited_by_count":25,"area":null},{"id":"2307.01998","title":"Zero-Shot Neural Architecture Search: Challenges, Solutions, and Opportunities","created":"2023-07-05","cited_by_count":21,"area":null},{"id":"2405.16646","title":"A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Experts","created":"2024-05-26","cited_by_count":21,"area":"moe"},{"id":"2407.04616","title":"Isomorphic Pruning for Vision Models","created":"2024-07-05","cited_by_count":21,"area":null},{"id":"2312.05284","title":"SlimSAM: 0.1% Data Makes Segment Anything Slim","created":"2023-12-08","cited_by_count":20,"area":null},{"id":"2412.11041","title":"Separate the Wheat from the Chaff: A Post-Hoc Approach to Safety Re-Alignment for Fine-Tuned Language Models","created":"2024-12-15","cited_by_count":20,"area":"alignment"},{"id":"2305.19454","title":"Dynamic Sparsity Is Channel-Level Sparsity Learner","created":"2023-05-30","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":"2211.09718","title":"Numerical Optimizations for Weighted Low-rank Estimation on Language Model","created":"2022-11-02","cited_by_count":14,"area":null},{"id":"2504.10540","title":"AB-Cache: Training-Free Acceleration of Diffusion Models via Adams-Bashforth Cached Feature Reuse","created":"2025-04-13","cited_by_count":13,"area":"diffusion"},{"id":"2309.13192","title":"Towards Green AI in Fine-tuning Large Language Models via Adaptive Backpropagation","created":"2023-09-22","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":"2303.13097","title":"CP$^3$: Channel Pruning Plug-in for Point-based Networks","created":"2023-03-23","cited_by_count":10,"area":null},{"id":"2312.03459","title":"F3-Pruning: A Training-Free and Generalized Pruning Strategy towards Faster and Finer Text-to-Video Synthesis","created":"2023-12-06","cited_by_count":10,"area":"diffusion"},{"id":"2207.04089","title":"SInGE: Sparsity via Integrated Gradients Estimation of Neuron Relevance","created":"2022-07-08","cited_by_count":9,"area":null},{"id":"2508.16134","title":"CommonKV: Compressing KV Cache with Cross-layer Parameter Sharing","created":"2025-08-22","cited_by_count":9,"area":"inference"},{"id":"2201.02620","title":"Compressing Models with Few Samples: Mimicking then Replacing","created":"2022-01-07","cited_by_count":8,"area":null},{"id":"2403.18955","title":"Structurally Prune Anything: Any Architecture, Any Framework, Any Time","created":"2024-03-03","cited_by_count":8,"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":"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":"2306.05031","title":"Generalizable Lightweight Proxy for Robust NAS against Diverse Perturbations","created":"2023-06-08","cited_by_count":6,"area":null},{"id":"2403.07688","title":"Maxwell's Demon at Work: Efficient Pruning by Leveraging Saturation of Neurons","created":"2024-03-12","cited_by_count":6,"area":null},{"id":"2406.10576","title":"Bypass Back-propagation: Optimization-based Structural Pruning for Large Language Models via Policy Gradient","created":"2024-06-15","cited_by_count":6,"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":"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":"2603.01685","title":"FastLightGen: Fast and Light Video Generation with Fewer Steps and Parameters","created":"2026-03-02","cited_by_count":5,"area":null},{"id":"2204.11444","title":"Boosting Pruned Networks with Linear Over-parameterization","created":"2022-04-25","cited_by_count":4,"area":null},{"id":"2205.09305","title":"FedILC: Weighted Geometric Mean and Invariant Gradient Covariance for Federated Learning on Non-IID Data","created":"2022-05-19","cited_by_count":4,"area":null},{"id":"2302.07612","title":"Towards Optimal Compression: Joint Pruning and Quantization","created":"2023-02-15","cited_by_count":4,"area":null},{"id":"2308.06755","title":"Influence Function Based Second-Order Channel Pruning-Evaluating True Loss Changes For Pruning Is Possible Without Retraining","created":"2023-08-13","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.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.17472","title":"FreezeAsGuard: Mitigating Illegal Adaptation of Diffusion Models via Selective Tensor Freezing","created":"2024-05-24","cited_by_count":4,"area":"diffusion"},{"id":"2406.06562","title":"Achieving Sparse Activation in Small Language Models","created":"2024-06-03","cited_by_count":4,"area":null},{"id":"2407.03153","title":"An Efficient Framework for Crediting Data Contributors of Diffusion Models","created":"2024-06-09","cited_by_count":4,"area":"diffusion"},{"id":"2509.17968","title":"Visual Detector Compression via Location-Aware Discriminant Analysis","created":"2025-09-22","cited_by_count":4,"area":null},{"id":"2308.04672","title":"Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networks","created":"2023-08-09","cited_by_count":3,"area":null},{"id":"2404.08016","title":"ONNXPruner: ONNX-Based General Model Pruning Adapter","created":"2024-04-10","cited_by_count":3,"area":null},{"id":"2405.07527","title":"Train Faster, Perform Better: Modular Adaptive Training in Over-Parameterized Models","created":"2024-05-13","cited_by_count":3,"area":null},{"id":"2412.13488","title":"Refining Salience-Aware Sparse Fine-Tuning Strategies for Language Models","created":"2024-12-18","cited_by_count":3,"area":null},{"id":"2412.18184","title":"Unified Stochastic Framework for Neural Network Quantization and Pruning","created":"2024-12-24","cited_by_count":3,"area":null},{"id":"2502.17941","title":"Optimal Brain Apoptosis","created":"2025-02-25","cited_by_count":3,"area":null},{"id":"2508.05521","title":"Optimal Brain Connection: Towards Efficient Structural Pruning","created":"2025-08-07","cited_by_count":3,"area":null},{"id":"2508.13836","title":"One Shot vs. Iterative: Rethinking Pruning Strategies for Model Compression","created":"2025-08-19","cited_by_count":3,"area":null},{"id":"2604.02570","title":"WSVD: Weighted Low-Rank Approximation for Fast and Efficient Execution of Low-Precision Vision-Language Models","created":"2026-04-02","cited_by_count":3,"area":"mllm"},{"id":"2604.24380","title":"Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency","created":"2026-04-27","cited_by_count":3,"area":"mllm"},{"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.07194","title":"Differentiable Model Scaling using Differentiable Topk","created":"2024-05-12","cited_by_count":2,"area":null},{"id":"2410.08015","title":"Non-transferable Pruning","created":"2024-10-10","cited_by_count":2,"area":null},{"id":"2411.06236","title":"Zero-Shot NAS via the Suppression of Local Entropy Decrease","created":"2024-11-09","cited_by_count":2,"area":null},{"id":"2412.05517","title":"Test-time Cost-and-Quality Controllable Arbitrary-Scale Super-Resolution with Variable Fourier Components","created":"2024-12-07","cited_by_count":2,"area":null},{"id":"2503.11164","title":"Towards Extreme Pruning of LLMs with Plug-and-Play Mixed Sparsity","created":"2025-03-14","cited_by_count":2,"area":null},{"id":"2503.18377","title":"Maximum Redundancy Pruning: A Principle-Driven Layerwise Sparsity Allocation for LLMs","created":"2025-03-24","cited_by_count":2,"area":null},{"id":"2503.21928","title":"An Efficient Training Algorithm for Models with Block-wise Sparsity","created":"2025-03-27","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":"2508.20122","title":"Spatio-Temporal Pruning for Compressed Spiking Large Language Models","created":"2025-08-23","cited_by_count":2,"area":null},{"id":"2509.13662","title":"Deep Lookup Network","created":"2025-09-17","cited_by_count":2,"area":null},{"id":"2511.08092","title":"Pruning as Regularization: Sensitivity-Aware One-Shot Pruning in ASR","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2109.06397","title":"AdaPruner: Adaptive Channel Pruning and Effective Weights Inheritance","created":"2021-09-14","cited_by_count":1,"area":null},{"id":"2210.08101","title":"Budget-Aware Pruning for Multi-Domain Learning","created":"2022-10-14","cited_by_count":1,"area":null},{"id":"2403.00155","title":"Towards Explaining Deep Neural Network Compression Through a Probabilistic Latent Space","created":"2024-02-29","cited_by_count":1,"area":null},{"id":"2404.04846","title":"F-MALLOC: Feed-forward Memory Allocation for Continual Learning in Neural Machine Translation","created":"2024-04-07","cited_by_count":1,"area":null},{"id":"2407.14330","title":"Straightforward Layer-wise Pruning for More Efficient Visual Adaptation","created":"2024-07-19","cited_by_count":1,"area":null},{"id":"2408.03046","title":"Comb, Prune, Distill: Towards Unified Pruning for Vision Model Compression","created":"2024-08-06","cited_by_count":1,"area":null},{"id":"2409.04829","title":"NASH: Neural Architecture and Accelerator Search for Multiplication-Reduced Hybrid Models","created":"2024-09-07","cited_by_count":1,"area":null},{"id":"2411.02861","title":"Centerness-based Instance-aware Knowledge Distillation with Task-wise Mutual Lifting for Object Detection on Drone Imagery","created":"2024-11-05","cited_by_count":1,"area":"distill"},{"id":"2412.18091","title":"AutoSculpt: A Pattern-based Model Auto-pruning Framework Using Reinforcement Learning and Graph Learning","created":"2024-12-24","cited_by_count":1,"area":"deeprl"},{"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":"2502.11450","title":"What Scalable Second-Order Information Knows for Pruning at Initialization","created":"2025-02-17","cited_by_count":1,"area":null},{"id":"2502.12455","title":"DSMoE: Matrix-Partitioned Experts with Dynamic Routing for Computation-Efficient Dense LLMs","created":"2025-02-18","cited_by_count":1,"area":"moe"},{"id":"2507.20749","title":"Investigating Structural Pruning and Recovery Techniques for Compressing Multimodal Large Language Models: An Empirical Study","created":"2025-07-28","cited_by_count":1,"area":"mllm"},{"id":"2511.19566","title":"ModHiFi: Identifying High Fidelity predictive components for Model Modification","created":"2025-11-24","cited_by_count":1,"area":"safety"},{"id":"2512.17917","title":"KVReviver: Reversible KV Cache Compression with Sketch-Based Token Reconstruction","created":"2025-12-01","cited_by_count":1,"area":"inference"},{"id":"2602.15660","title":"Bayesian Optimization for Design Parameters of 3D Image Data Analysis","created":"2026-02-17","cited_by_count":1,"area":null},{"id":"2604.23475","title":"Supernodes and Halos: Loss-Critical Hubs in LLM Feed-Forward Layers","created":"2026-04-26","cited_by_count":1,"area":null},{"id":"2605.13688","title":"MedCore: Boundary-Preserving Medical Core Pruning for MedSAM","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2605.17633","title":"SparseSAM: Structured Sparsification of Activations in Segment Anything Models","created":"2026-05-17","cited_by_count":1,"area":"inference"}],"next_cursor":"100"}