Hypernetwork-Driven Low-Rank Adaptation Across Attention Heads
Not on the map. Why?
Abstract (arXiv)
Parameter-efficient fine-tuning (PEFT) has emerged as a powerful paradigm for adapting large-scale pre-trained models to downstream tasks with minimal additional parameters. Among PEFT methods, Low-Rank Adaptation (LoRA) stands out for its effectiveness by inserting trainable low-rank matrices into weight updates to enable efficient adaptation. However, when applied to multi-head self-attention, existing LoRA-based methods typically fine-tune each attention head independently, overlooking potential interactions and shared structure among heads. To address this limitation, we propose Hypernetwork-Driven Low-rank Adaptation (HyRA) that employs a hypernetwork to generate joint low-rank matrices for all attention heads within a layer. The shared generator promotes cross-head information sharing, helping low-rank modules avoid the redundant feature learning seen in traditional LoRA methods. Theoretically, our method achieves significantly better sample efficiency compared to standard LoRA. Empirically, we evaluate HyRA on a comprehensive suite of language and vision benchmarks. Our approach consistently outperforms existing parameter-efficient fine-tuning (PEFT) baselines across a wide range of tasks. Notably, in low-data regimes, HyRA achieves substantial improvements over LoRA, underscoring its practical sample efficiency and effectiveness in data-scarce scenarios.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 46 of its 55 references that are in the map. First posted on arXiv 5 Oct 2025.
Builds on
46 of 55 references.
References · 46
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2022Visual Prompt Tuningcited by 1,681
- 2020Reformer: The Efficient Transformercited by 1,668
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
34 more
- 2016HyperNetworkscited by 1,027
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
- 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 872
- 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
- 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
- 2021ConViT: Improving Vision Transformers with Soft Convolutional Inductive Biasescited by 484
- 2021Compacter: Efficient Low-Rank Hypercomplex Adapter Layerscited by 460
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
- 2023LLM-Adapters: An Adapter Family for Parameter-Efficient Fine-Tuning of Large Language Modelscited by 324
- 2023VeRA: Vector-based Random Matrix Adaptationcited by 300
- 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 284
- 2019Continual learning with hypernetworkscited by 273
- 2023From Sparse to Soft Mixtures of Expertscited by 248
- 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 204
- 2024FuseMoE: Mixture-of-Experts Transformers for Fleximodal Fusioncited by 68
- 2024A Survey on LoRA of Large Language Modelscited by 67
- 2024MTLoRA: A Low-Rank Adaptation Approach for Efficient Multi-Task Learningcited by 44
- 2024Mixture of Experts Meets Prompt-Based Continual Learningcited by 43
- 2024Low-Rank Adaptation for Foundation Models: A Comprehensive Reviewcited by 37
- 2023Demystifying Softmax Gating Function in Gaussian Mixture of Expertscited by 33
- 2023Statistical Perspective of Top-K Sparse Softmax Gating Mixture of Expertscited by 29
- 2024On Least Square Estimation in Softmax Gating Mixture of Expertscited by 23
- 2022Refined Convergence Rates for Maximum Likelihood Estimation under Finite Mixture Modelscited by 22
- 2024Is Temperature Sample Efficient for Softmax Gaussian Mixture of Experts?cited by 15
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Promptscited by 15
- 2023Magnitude Invariant Parametrizations Improve Hypernetwork Learningcited by 14
- 2018Dropout Regularization in Hierarchical Mixture of Expertscited by 6
- 2025RepLoRA: Reparameterizing Low-Rank Adaptation via the Perspective of Mixture of Expertscited by 6
- 2019Hierarchical Routing Mixture of Expertscited by 5
- 2024Improving Generalization with Flat Hilbert Bayesian Inferencecited by 5
- 2025On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimationcited by 4
- 2025Promoting Ensemble Diversity with Interactive Bayesian Distributional Robustness for Fine-tuning Foundation Modelscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.