CLOVER: Cross-Layer Orthogonal Vectors Pruning and Fine-Tuning
Not on the map. Why?
Abstract (arXiv)
Decoder-only models generate tokens autoregressively by caching key/value vectors, but as the cache grows, inference becomes memory-bound. To address this issue, we introduce CLOVER (Cross-Layer Orthogonal Vectors), a novel approach that treats pairs of attention layers as a set of low-rank decompositions. CLOVER applies Singular Value Decomposition (SVD) to the ( Q )-( K ) and ( V )-( O ) pairs within each attention head. The resulting singular values can either guide pruning or serve as trainable parameters for efficient fine-tuning of all orthogonal vectors. After pruning or fine-tuning, these values are reintegrated into the model without increasing its parameter count. We apply CLOVER to various models, including GPT-2 XL, DeepSeek-V2-Lite, Whisper-Large-v3, Stable Diffusion XL, and LLaMA-3.2-11B-Vision. Our results demonstrate that CLOVER significantly improves pruning efficiency. For instance, the perplexity of pruning 70% of the ( Q )-( K ) pairs in GPT-2 XL is similar to that of pruning just 8% with vanilla methods. Fine-tuning the singular values further results in a full-rank update, outperforming state-of-the-art methods (LoRA, DoRA, HiRA, and PiSSA) by 7.6%, 5.5%, 3.8%, and 0.7%, respectively, on eight commonsense tasks for LLaMA-2 7B.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 68 of its 84 references that are in the map. First posted on arXiv 26 Nov 2024.
Builds on
68 of 84 references.
References · 68
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2023SDXL: Improving Latent Diffusion Models for High-Resolution Image Synthesiscited by 4,356
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,224
38 more
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,984
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,386
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,245
- 2022Reproducible scaling laws for contrastive language-image learningcited by 1,173
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,103
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 827
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
- 2021GPT Understands, Toocited by 716
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 637
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 591
- 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 463
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 352
- 2024Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Modelscited by 242
- 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
- 2021WARP: Word-level Adversarial ReProgrammingcited by 221
- 2021Training Neural Networks with Fixed Sparse Maskscited by 214
- 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 208
- 2024SVDQuant: Absorbing Outliers by Low-Rank Components for 4-Bit Diffusion Modelscited by 170
- 2021Raise a Child in Large Language Model: Towards Effective and Generalizable Fine-tuningcited by 146
- 2021Composable Sparse Fine-Tuning for Cross-Lingual Transfercited by 144
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
- 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 141
- 2024LoRA-GA: Low-Rank Adaptation with Gradient Approximationcited by 141
50 most cited of 68 All 68 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025A3 : an Analytical Low-Rank Approximation Framework for Attentioncited by 8
- 2026Breaking the Blocks: Continuous Low-Rank Decomposed Scaling for Unified LLM Quantization and Adaptationcited by 1
- 2026A Game Theoretic Free Energy Analysis of Higher Order Synergy in Attention Heads of Large Language Modelscited by 0
- 2026A Game Theoretic Free Energy Analysis of Higher Order Synergy in Attention Heads of Large Language Models10 May 2026
- 2026Breaking the Blocks: Continuous Low-Rank Decomposed Scaling for Unified LLM Quantization and Adaptation30 Jan 2026
- 2025A3 : an Analytical Low-Rank Approximation Framework for Attention19 May 2025
Similar, not cited
Close in wording, no citation either way
- 2026R'enyi Entropy: A New Token Pruning Metric for Vision Transformers
- 2025ToDRE: Effective Visual Token Pruning via Token Diversity and Task Relevance
- 2025PLPHP: Per-Layer Per-Head Vision Token Pruning for Efficient Large Vision-Language Models
- 2026IWP: Token Pruning as Implicit Weight Pruning in Large Vision Language Models
- 2026Beyond Attention Scores: SVD-Based Vision Token Pruning for Efficient Vision-Language Models
- 2026ASAP: Attention-Shift-Aware Pruning for Efficient LVLM Inference
- 2026MI-Pruner: Crossmodal Mutual Information-guided Token Pruner for Efficient MLLMs
- 2026Efficient Token Pruning for LLaDA-V