mlsanityData to 7 Oct 2026

ALoRE: Efficient Visual Adaptation via Aggregating Low Rank Experts

arXiv 2412.08341 ↗First posted 11 Dec 2024cs.CV cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient transfer learning (PETL) has become a promising paradigm for adapting large-scale vision foundation models to downstream tasks. Typical methods primarily leverage the intrinsic low rank property to make decomposition, learning task-specific weights while compressing parameter size. However, such approaches predominantly manipulate within the original feature space utilizing a single-branch structure, which might be suboptimal for decoupling the learned representations and patterns. In this paper, we propose ALoRE, a novel PETL method that reuses the hypercomplex parameterized space constructed by Kronecker product to Aggregate Low Rank Experts using a multi-branch paradigm, disentangling the learned cognitive patterns during training. Thanks to the artful design, ALoRE maintains negligible extra parameters and can be effortlessly merged into the frozen backbone via re-parameterization in a sequential manner, avoiding additional inference latency. We conduct extensive experiments on 24 image classification tasks using various backbone variants. Experimental results demonstrate that ALoRE outperforms the full fine-tuning strategy and other state-of-the-art PETL methods in terms of performance and parameter efficiency. For instance, ALoRE obtains 3.06% and 9.97% Top-1 accuracy improvement on average compared to full fine-tuning on the FGVC datasets and VTAB-1k benchmark by only updating 0.15M parameters.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 26 of its 81 references that are in the map. First posted on arXiv 11 Dec 2024.

Builds on

26 of 81 references.

References · 26

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  3. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  4. 2021An Empirical Study of Training Self-Supervised Vision Transformerscited by 1,610
  5. 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
  6. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  7. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 658
  8. 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 419
  9. 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
  10. 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
  11. 2020AutoPrompt: Eliciting Knowledge from Language Models with Automatically Generated Promptscited by 246
  12. 2020Revisiting Few-sample BERT Fine-tuningcited by 237
14 more
  1. 2020AdapterDrop: On the Efficiency of Adapters in Transformerscited by 223
  2. 2022Neural Prompt Searchcited by 133
  3. 2022Convolutional Bypasses Are Better Vision Transformer Adapterscited by 120
  4. 2020Rethinking embedding coupling in pre-trained language modelscited by 103
  5. 2021AS-MLP: An Axial Shifted MLP Architecture for Visioncited by 101
  6. 2023One-for-All: Generalized LoRA for Parameter-Efficient Fine-tuningcited by 84
  7. 2016DeepMind Labcited by 74
  8. 2023Towards Efficient Visual Adaption via Structural Re-parameterizationcited by 73
  9. 2021Beyond Fully-Connected Layers with Quaternions: Parameterization of Hypercomplex Multiplications with 1/n Parameterscited by 66
  10. 2022Conv-Adapter: Exploring Parameter Efficient Transfer Learning for ConvNetscited by 62
  11. 2017DiracNets: Training Very Deep Neural Networks Without Skip-Connectionscited by 47
  12. 2021RepMLP: Re-parameterizing Convolutions into Fully-connected Layers for Image Recognitioncited by 40
  13. 2024Time-, Memory- and Parameter-Efficient Visual Adaptationcited by 28
  14. 2023Adapter is All You Need for Tuning Visual Taskscited by 19

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 1.

4 papers.