COMPOT: Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers Compression
Not on the map. Why?
Abstract (arXiv)
Post-training compression of Transformer models commonly relies on truncated singular value decomposition (SVD). However, enforcing a single shared subspace can degrade accuracy even at moderate compression. Sparse dictionary learning provides a more flexible union-of-subspaces representation, but existing approaches often suffer from iterative dictionary and coefficient updates. We propose COMPOT (Calibration-Optimized Matrix Procrustes Orthogonalization for Transformers), a training-free compression framework that uses a small calibration dataset to estimate a sparse weight factorization. COMPOT employs orthogonal dictionaries that enable closed-form Procrustes updates for the dictionary and analytical single-step sparse coding for the coefficients, eliminating iterative optimization. To handle heterogeneous layer sensitivity under a global compression budget, COMPOT further introduces a one-shot dynamic allocation strategy that adaptively redistributes layer-wise compression rates. Extensive experiments across diverse architectures and tasks show that COMPOT consistently delivers a superior quality-compression trade-off over strong low-rank and sparse baselines, while remaining fully compatible with post-training quantization for extreme compression. Code is available hrefhttps://github.com/mts-ai/COMPOThere.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 34 of its 46 references that are in the map. First posted on arXiv 16 Feb 2026.
Builds on
34 of 46 references.
References · 34
- 2017Attention Is All You Needcited by 60,361
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
- 2016Pointer Sentinel Mixture Modelscited by 3,096
22 more
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023AWQ: Activation-aware Weight Quantization for LLM Compression and Accelerationcited by 1,298
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2019Are Sixteen Heads Really Better than One?cited by 816
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2023The RefinedWeb Dataset for Falcon LLM: Outperforming Curated Corpora with Web Data, and Web Data Onlycited by 763
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2022Language model compression with weighted low-rank factorizationcited by 195
- 2025SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compressioncited by 67
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 48
- 2024A Survey on Transformer Compressioncited by 46
- 2025ReplaceMe: Network Simplification via Depth Pruning and Transformer Block Linearizationcited by 13
- 2025Layer-wise dynamic rank for compressing large language modelscited by 8
- 2025CoSpaDi: Compressing LLMs via Calibration-Guided Sparse Dictionary Learningcited by 6
- 2025Share Your Attention: Transformer Weight Sharing via Matrix-based Dictionary Learningcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Variance Is Not Importance: Structural Analysis of Transformer Compressibility Across Model Scales
- 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression
- 2024Learning Fine-grained Parameter Sharing via Sparse Tensor Decomposition
- 2025EcoSpa: Efficient Transformer Training with Coupled Sparsity
- 2024RepQuant: Towards Accurate Post-Training Quantization of Large Transformer Models via Scale Reparameterization
- 2025MLoRQ: Bridging Low-Rank and Quantization for Transformer Compression
- 2026FlashSVD v1.5: Making Low-Rank Transformers Inference Actually Fast
- 2026Tensor Decomposition of Transformer Key-Value Caches: Spectral Structure and Format Comparison