ROCKET: Rapid Optimization via Calibration-guided Knapsack Enhanced Truncation for Efficient Model Compression
Not on the map. Why?
Abstract (arXiv)
We present ROCKET, a training-free model compression method that achieves state-of-the-art performance in comparison with factorization, structured-sparsification and dynamic compression baselines. Operating under a global compression budget, ROCKET comprises two key innovations: First, it formulates layer-wise compression allocation as a multi-choice knapsack problem, selecting the optimal compression level for each layer to minimize total reconstruction error while adhering to a target model size. Second, it introduces a single-step sparse matrix factorization inspired by dictionary learning: using only a small calibration set, it sparsifies weight coefficients based on activation-weights sensitivity and then updates the dictionary in closed form via least squares bypassing iterative optimization, sparse coding, or backpropagation entirely. ROCKET consistently outperforms existing compression approaches across different model architectures at 20-50% compression rates. Notably, it retains over 90% of the original model's performance at 30% compression without any fine-tuning. Moreover, when applying a light fine-tuning phase, recovery is substantially enhanced: for instance, compressing Qwen3-14B to an 8B-parameter model and healing it with just 30 million tokens yields performance nearly on par with the original Qwen3-8B. The code for ROCKET is at github.com/mts-ai/ROCKET/tree/main.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 41 references that are in the map. First posted on arXiv 11 Feb 2026.
Builds on
35 of 41 references.
References · 35
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,748
- 2023MMBench: Is Your Multi-modal Model an All-around Player?cited by 2,105
- 2023MMMU: A Massive Multi-discipline Multimodal Understanding and Reasoning Benchmark for Expert AGIcited by 2,044
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
23 more
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,143
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2024Are We on the Right Way for Evaluating Large Vision-Language Models?cited by 893
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 851
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 755
- 2017Crowdsourcing Multiple Choice Science Questionscited by 742
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 643
- 2020MLS: A Large-Scale Multilingual Dataset for Speech Researchcited by 467
- 2023OCRBench: On the Hidden Mystery of OCR in Large Multimodal Modelscited by 466
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 378
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
- 2019Structured Pruning of Large Language Modelscited by 201
- 2023MuSR: Testing the Limits of Chain-of-thought with Multistep Soft Reasoningcited by 195
- 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 45
- 2024Everybody Prune Now: Structured Pruning of LLMs with only Forward Passescited by 42
- 2025VibeVoice Technical Reportcited by 28
- 2025MACKO: Sparse Matrix-Vector Multiplication for Low Sparsitycited by 6
- 2025Share Your Attention: Transformer Weight Sharing via Matrix-based Dictionary Learningcited by 5
- 2025CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learningcited by 5
- 2025ARA: Adaptive Rank Allocation for Efficient Large Language Model SVD Compressioncited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.