{"total":16,"rows":[{"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":"2502.14816","title":"Dynamic Low-Rank Sparse Adaptation for Large Language Models","created":"2025-02-20","cited_by_count":10,"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.01650","title":"The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM","created":"2025-10-02","cited_by_count":5,"area":null},{"id":"2501.18015","title":"A Proximal Operator for Inducing 2:4-Sparsity","created":"2025-01-29","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":"2502.00899","title":"HASSLE-free: A unified Framework for Sparse plus Low-Rank Matrix Decomposition for LLMs","created":"2025-02-02","cited_by_count":3,"area":null},{"id":"2510.21834","title":"Restoring Pruned Large Language Models via Lost Component Compensation","created":"2025-10-22","cited_by_count":3,"area":null},{"id":"2510.22101","title":"Scaling Up Efficient Small Language Models Serving and Deployment for Semantic Job Search","created":"2025-10-25","cited_by_count":3,"area":null},{"id":"2603.01376","title":"3BASiL: An Algorithmic Framework for Sparse plus Low-Rank Compression of LLMs","created":"2026-03-02","cited_by_count":3,"area":null},{"id":"2605.11222","title":"ADMM-Q: An Improved Hessian-based Weight Quantizer for Post-Training Quantization of Large Language Models","created":"2026-05-11","cited_by_count":3,"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":"2602.06694","title":"NanoQuant: Efficient Sub-1-Bit Quantization of Large Language Models","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2505.23949","title":"TSENOR: Highly-Efficient Algorithm for Finding Transposable N:M Sparse Masks","created":"2025-05-29","cited_by_count":0,"area":null},{"id":"2608.06630","title":"The Sparsity Whisperer","created":"2026-08-06","cited_by_count":0,"area":null},{"id":"2610.18516","title":"Two For The Price Of One: Curvature-Aware Pruning Preserves Influence Functions Too","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}