{"total":15,"rows":[{"id":"2502.00919","title":"Attention Sinks: A 'Catch, Tag, Release' Mechanism for Embeddings","created":"2025-02-02","cited_by_count":16,"area":null},{"id":"2410.09615","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","created":"2024-10-12","cited_by_count":12,"area":null},{"id":"2508.02668","title":"LOST: Low-rank and Sparse Pre-training for Large Language Models","created":"2025-08-04","cited_by_count":10,"area":null},{"id":"2410.21271","title":"EoRA: Fine-tuning-free Compensation for Compressed LLM with Eigenspace Low-Rank Approximation","created":"2024-10-28","cited_by_count":7,"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":"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":"2510.22767","title":"TELL-TALE: Task Efficient LLMs with Task Aware Layer Elimination","created":"2025-10-26","cited_by_count":2,"area":null},{"id":"2511.11927","title":"Sparse corruption in low-rank matrix inference: the PCA benchmark","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2507.09428","title":"On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization","created":"2025-07-12","cited_by_count":1,"area":null},{"id":"2508.02128","title":"Amber Pruner: Leveraging N:M Activation Sparsity for Efficient Prefill in Large Language Models","created":"2025-08-04","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":"2606.01412","title":"GPTQ-intrinsic LoRA: A Near-optimal Algorithm for Low-precision Quantization with Low-rank Adaptation","created":"2026-05-31","cited_by_count":1,"area":null},{"id":"2510.01718","title":"Accelerating Attention with Basis Decomposition","created":"2025-10-02","cited_by_count":0,"area":null},{"id":"2605.03667","title":"ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity","created":"2026-05-05","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}