{"total":38,"rows":[{"id":"2407.11062","title":"EfficientQAT: Efficient Quantization-Aware Training for Large Language Models","created":"2024-07-10","cited_by_count":127,"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":"2406.10594","title":"BlockPruner: Fine-grained Pruning for Large Language Models","created":"2024-06-15","cited_by_count":36,"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":"2410.17711","title":"Beware of Calibration Data for Pruning Large Language Models","created":"2024-10-23","cited_by_count":15,"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":"2409.13199","title":"CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information","created":"2024-09-20","cited_by_count":11,"area":null},{"id":"2502.14816","title":"Dynamic Low-Rank Sparse Adaptation for Large Language Models","created":"2025-02-20","cited_by_count":10,"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":"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":"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":"2410.03750","title":"SQFT: Low-cost Model Adaptation in Low-precision Sparse Foundation Models","created":"2024-10-01","cited_by_count":5,"area":null},{"id":"2502.12594","title":"PASER: Post-Training Data Selection for Efficient Pruned Large Language Model Recovery","created":"2025-02-18","cited_by_count":4,"area":null},{"id":"2506.01042","title":"Probing Neural Topology of Large Language Models","created":"2025-06-01","cited_by_count":4,"area":null},{"id":"2501.17905","title":"DReSS: Data-driven Regularized Structured Streamlining for Large Language Models","created":"2025-01-29","cited_by_count":3,"area":null},{"id":"2505.18232","title":"Two-Stage Regularization-Based Structured Pruning for LLMs","created":"2025-05-23","cited_by_count":3,"area":null},{"id":"2509.23410","title":"PATCH: Learnable Tile-level Hybrid Sparsity for LLMs","created":"2025-09-27","cited_by_count":3,"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":"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":"2505.13547","title":"Exploring Federated Pruning for Large Language Models","created":"2025-05-19","cited_by_count":2,"area":null},{"id":"2408.10631","title":"LLM-Barber: Block-Aware Rebuilder for Sparsity Mask in One-Shot for Large Language Models","created":"2024-08-20","cited_by_count":1,"area":null},{"id":"2503.22451","title":"STADE: Standard Deviation as a Pruning Metric","created":"2025-03-28","cited_by_count":1,"area":null},{"id":"2503.23924","title":"Model Hemorrhage and the Robustness Limits of Large Language Models","created":"2025-03-31","cited_by_count":1,"area":null},{"id":"2505.03745","title":"AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Design","created":"2025-04-07","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":"2510.14444","title":"A Free Lunch in LLM Compression: Revisiting Retraining after Pruning","created":"2025-10-16","cited_by_count":1,"area":null},{"id":"2511.16147","title":"TS-PEFT: Unveiling Token-Level Redundancy in Parameter-Efficient Fine-Tuning","created":"2025-11-20","cited_by_count":1,"area":null},{"id":"2409.05368","title":"Application Specific Compression of Deep Learning Models","created":"2024-09-09","cited_by_count":0,"area":null},{"id":"2510.19385","title":"Beyond Uniform SVD:Dual-Level Optimization across Columns and Modules for LLM Compression","created":"2025-10-22","cited_by_count":0,"area":null},{"id":"2511.15390","title":"Automatic Pruning Discovery for Large Language Models","created":"2025-11-19","cited_by_count":0,"area":null},{"id":"2512.07090","title":"Leveraging KV Similarity for Online Structured Pruning in LLMs","created":"2025-12-08","cited_by_count":0,"area":null},{"id":"2602.01975","title":"IntraSlice: Towards High-Performance Structural Pruning with Block-Intra PCA for LLMs","created":"2026-02-02","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":"2605.06402","title":"SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Mask","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.18331","title":"Prune, Update and Trim: Robust Structured Pruning for Large Language Models","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2608.02940","title":"When Compression Scores Cannot Decide: Information Boundaries for Group-Robust LLM Pruning","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2608.24070","title":"Compression Trinity: Exploring Sparsity, Quantization, and Low-Rank Approximations for LLM Compression","created":"2026-08-25","cited_by_count":0,"area":null},{"id":"2609.33977","title":"GroupMask: Layer-Adaptive Group-wise Sparsity for Semi-Structured LLM Pruning","created":"2026-09-27","cited_by_count":0,"area":null}],"next_cursor":null}