{"total":39,"rows":[{"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":"2412.18110","title":"SlimGPT: Layer-wise Structured Pruning for Large Language Models","created":"2024-12-24","cited_by_count":44,"area":null},{"id":"2405.10313","title":"How Far Are We From AGI: Are LLMs All We Need?","created":"2024-05-16","cited_by_count":31,"area":null},{"id":"2410.14649","title":"EvoPress: Accurate Dynamic Model Compression via Evolutionary Search","created":"2024-10-18","cited_by_count":20,"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":"2502.07780","title":"DarwinLM: Evolutionary Structured Pruning of Large Language Models","created":"2025-02-11","cited_by_count":18,"area":null},{"id":"2501.02086","title":"Instruction-Following Pruning for Large Language Models","created":"2025-01-03","cited_by_count":17,"area":null},{"id":"2501.17771","title":"2SSP: A Two-Stage Framework for Structured Pruning of LLMs","created":"2025-01-29","cited_by_count":12,"area":null},{"id":"2407.09111","title":"Inference Optimization of Foundation Models on AI Accelerators","created":"2024-07-12","cited_by_count":9,"area":null},{"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":"2304.10891","title":"Transformer-Based Autonomous Driving Models and Deployment-Oriented Compression: A Survey","created":"2023-04-21","cited_by_count":8,"area":null},{"id":"2407.19126","title":"Greedy Output Approximation: Towards Efficient Structured Pruning for LLMs Without Retraining","created":"2024-07-26","cited_by_count":8,"area":null},{"id":"2410.09982","title":"Self-Data Distillation for Recovering Quality in Pruned Large Language Models","created":"2024-10-13","cited_by_count":8,"area":null},{"id":"2505.20112","title":"ERC-SVD: Error-Controlled SVD for Large Language Model Compression","created":"2025-05-26","cited_by_count":7,"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":"2510.18358","title":"Ensembling Pruned Attention Heads For Uncertainty-Aware Efficient Transformers","created":"2025-10-21","cited_by_count":5,"area":null},{"id":"2406.06562","title":"Achieving Sparse Activation in Small Language Models","created":"2024-06-03","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":"2408.03728","title":"A Convex-optimization-based Layer-wise Post-training Pruner for Large Language Models","created":"2024-08-07","cited_by_count":2,"area":null},{"id":"2411.07066","title":"Zeroth-Order Adaptive Neuron Alignment Based Pruning without Re-Training","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2502.14305","title":"Scaling Down, Serving Fast: Compressing and Deploying Efficient LLMs for Recommendation Systems","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2602.02680","title":"FlexRank: Nested Low-Rank Knowledge Decomposition for Adaptive Model Deployment","created":"2026-02-02","cited_by_count":2,"area":null},{"id":"2405.09037","title":"SSFL: Discovering Sparse Unified Subnetworks at Initialization for Efficient Federated Learning","created":"2024-05-15","cited_by_count":1,"area":null},{"id":"2505.03373","title":"SPAP: Structured Pruning via Alternating Optimization and Penalty Methods","created":"2025-05-06","cited_by_count":1,"area":null},{"id":"2507.01900","title":"High-Layer Attention Pruning with Rescaling","created":"2025-07-02","cited_by_count":1,"area":null},{"id":"2509.22166","title":"Motivating Next-Gen Accelerators with Flexible (N:M) Activation Sparsity via Benchmarking Lightweight Post-Training Sparsification Approaches","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2510.00192","title":"Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation","created":"2025-09-30","cited_by_count":1,"area":null},{"id":"2510.18636","title":"C-SWAP: Explainability-Aware Structured Pruning for Efficient Neural Networks Compression","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2602.06822","title":"POP: Online Structural Pruning Enables Efficient Inference of Large Foundation Models","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2604.14156","title":"Compressed-Sensing-Guided, Inference-Aware Structured Reduction for Large Language Models","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2607.13735","title":"Constraint-Driven Model Optimization: An Industry Framework for Selecting Compression and Acceleration Techniques in Modern Machine Learning Systems","created":"2026-07-15","cited_by_count":0,"area":null},{"id":"2608.04593","title":"Rethinking Reservoir Pruning: A Dynamical Perspective for Echo State Networks","created":"2026-08-05","cited_by_count":0,"area":null},{"id":"2608.21142","title":"COEC: Calibrated Orthogonal-Equivalence Compensation for Structured Pruning of Large Language Models","created":"2026-08-21","cited_by_count":0,"area":null},{"id":"2608.29765","title":"PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning","created":"2026-08-30","cited_by_count":0,"area":null},{"id":"2609.35579","title":"Output-aware Residual Stream Pruning for Large Language Models","created":"2026-09-28","cited_by_count":0,"area":null},{"id":"2610.15394","title":"WUSPruner: Second-Moment-Optimal Transforms for Structured Pruning","created":"2026-10-11","cited_by_count":0,"area":null},{"id":"2610.15398","title":"GA-SVD: Generation-aware Singular Value Decomposition for LLM Compression","created":"2026-10-11","cited_by_count":0,"area":null},{"id":"2610.15781","title":"Heterogeneous Structured Pruning Under Resource Constraints for Hardware-Efficient Large Language Models","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}