mlsanityData to 7 Oct 2026

Bridging The Gap between Low-rank and Orthogonal Adaptation via Householder Reflection Adaptation

arXiv 2405.17484 ↗First posted 24 May 2024cs.LG cs.CVcited by 15

Not on the map. Why?

Abstract (arXiv)

While following different technical routes, both low-rank and orthogonal adaptation techniques can efficiently adapt large-scale pre-training models in specific tasks or domains based on a small piece of trainable parameters. In this study, we bridge the gap between these two techniques, proposing a simple but effective adaptation method based on Householder reflections. Given a pre-trained model, our method fine-tunes its layers by multiplying each frozen weight matrix with an orthogonal matrix constructed by a chain of learnable Householder reflections (HRs). This HR-based orthogonal fine-tuning is equivalent to an adaptive low-rank adaptation. Moreover, we show that the orthogonality of the reflection planes corresponding to the HRs impacts the model capacity and regularity. The analysis motivates us to regularize the orthogonality of the HRs, leading to different implementations of the proposed Householder reflection adaptation (HRA) method. Compared with state-of-the-art methods, HRA achieves superior performance with fewer learnable parameters when adapting large language models and conditional image generators. The code of the experiments is available at urlhttps://github.com/DaShenZi721/HRA, and the method has been merged into the hrefhttps://github.com/huggingface/peftPEFT package.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 49 of its 67 references that are in the map. First posted on arXiv 24 May 2024.

Builds on

49 of 67 references.

References · 49

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  3. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  6. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  7. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  8. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  9. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  10. 2020Scaling Laws for Neural Language Modelscited by 6,411
  11. 2023Adding Conditional Control to Text-to-Image Diffusion Modelscited by 5,466
  12. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
37 more
  1. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  2. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  3. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  4. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
  5. 2022DreamBooth: Fine Tuning Text-to-Image Diffusion Models for Subject-Driven Generationcited by 3,286
  6. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,967
  7. 2023T2I-Adapter: Learning Adapters to Dig out More Controllable Ability for Text-to-Image Diffusion Modelscited by 1,339
  8. 2021BitFit: Simple Parameter-efficient Fine-tuning for Transformer-based Masked Language-modelscited by 1,234
  9. 2021DeBERTaV3: Improving DeBERTa using ELECTRA-Style Pre-Training with Gradient-Disentangled Embedding Sharingcited by 1,219
  10. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  11. 2023MetaMath: Bootstrap Your Own Mathematical Questions for Large Language Modelscited by 724
  12. 2020Scaling Laws for Autoregressive Generative Modelingcited by 510
  13. 2022DeepSpeed-MoE: Advancing Mixture-of-Experts Inference and Training to Power Next-Generation AI Scalecited by 400
  14. 2023VeRA: Vector-based Random Matrix Adaptationcited by 294
  15. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 261
  16. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  17. 2022DyLoRA: Parameter Efficient Tuning of Pre-trained Models using Dynamic Search-Free Low-Rank Adaptationcited by 229
  18. 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
  19. 2021WARP: Word-level Adversarial ReProgrammingcited by 220
  20. 2021Training Neural Networks with Fixed Sparse Maskscited by 212
  21. 2023Controlling Text-to-Image Diffusion by Orthogonal Finetuningcited by 207
  22. 2023LoftQ: LoRA-Fine-Tuning-Aware Quantization for Large Language Modelscited by 195
  23. 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
  24. 2020The Lipschitz Constant of Self-Attentioncited by 171
  25. 2023QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Modelscited by 154
  26. 2021FedPara: Low-Rank Hadamard Product for Communication-Efficient Federated Learningcited by 140
  27. 2022On the Effectiveness of Parameter-Efficient Fine-Tuningcited by 140
  28. 2016Robust Large Margin Deep Neural Networkscited by 117
  29. 2023Parameter-Efficient Orthogonal Finetuning via Butterfly Factorizationcited by 112
  30. 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 86
  31. 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
  32. 2024Parameter-Efficient Fine-Tuning with Discrete Fourier Transformcited by 67
  33. 2019Quick and (not so) Dirty: Unsupervised Selection of Justification Sentences for Multi-hop Question Answeringcited by 58
  34. 2023IncreLoRA: Incremental Parameter Allocation Method for Parameter-Efficient Fine-tuningcited by 45
  35. 2020Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Mapscited by 36
  36. 2019Orthogonality Constrained Multi-Head Attention For Keyword Spottingcited by 6
  37. 2020Diversity-Based Generalization for Unsupervised Text Classification under Domain Shiftcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 7; 2026: 6.

15 papers.

Sort:

By area: