mlsanityData to 14 Oct 2026

Multi-Head Adapter Routing for Cross-Task Generalization

arXiv 2211.03831 ↗First posted 7 Nov 2022cs.AIcited by 33

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient fine-tuning (PEFT) for cross-task generalization consists in pre-training adapters on a multi-task training set before few-shot adaptation to test tasks. Polytropon [Ponti et al., 2023] (textttPoly) jointly learns an inventory of adapters and a routing function that selects a (variable-size) subset of adapters for each task during both pre-training and few-shot adaptation. In this paper, we investigate the role that adapter routing plays in its success and design new variants based on our findings. First, we build on the intuition that finer-grained routing provides more expressivity. Hence, we propose textttMHR (Multi-Head Routing) which combines subsets of adapter parameters and outperforms textttPoly under a comparable parameter budget; by only fine-tuning the routing function and not the adapters (textttMHR-z) we achieve competitive performance with extreme parameter efficiency. Second, we find that textttPoly/textttMHR performance is a result of better multi-task optimization, rather than modular inductive biases that facilitate adapter recombination and local adaptation, as previously hypothesized. In fact, we find that textttMHR exhibits high gradient alignment between training tasks. We find that routing is most beneficial during multi-task pre-training rather than during few-shot adaptation and propose textttMHR-μ, which discards routing and fine-tunes the average of the pre-trained adapters on each downstream tasks. This establishes textttMHR-μ as an effective method for single-adapter fine-tuning. We also show that textttMHR-μ can be used as an effective zero-shot transfer method by training the average of the pre-trained adapters for a few additional steps on the multi-task training set: this yields gains up to 3% on absolute accuracy w.r.t. the baselines.

Key facts. Cited by 33 papers in the map (data through 14 Oct 2026). Builds on 30 of its 42 references that are in the map. First posted on arXiv 7 Nov 2022.

Builds on

30 of 42 references.

References · 30

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  5. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,915
  6. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,780
  7. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  8. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  9. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  10. 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,470
  11. 2021Calibrate Before Use: Improving Few-Shot Performance of Language Modelscited by 1,392
  12. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
18 more
  1. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 896
  2. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 803
  3. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 788
  4. 2021Parameter-efficient Multi-task Fine-tuning for Transformers via Shared Hypernetworkscited by 284
  5. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  6. 2019Recurrent Independent Mechanismscited by 219
  7. 2021Training Neural Networks with Fixed Sparse Maskscited by 214
  8. 2020Gradient Vaccine: Investigating and Improving Multi-task Optimization in Massively Multilingual Modelscited by 169
  9. 2021ExT5: Towards Extreme Multi-Task Scaling for Transfer Learningcited by 161
  10. 2021Composable Sparse Fine-Tuning for Cross-Lingual Transfercited by 144
  11. 2021CrossFit: A Few-shot Learning Challenge for Cross-task Generalization in NLPcited by 142
  12. 2020Exploring and Predicting Transferability across NLP Taskscited by 128
  13. 2022ATTEMPT: Parameter-Efficient Multi-task Tuning via Attentional Mixtures of Soft Promptscited by 85
  14. 2018Modeling Language Variation and Universals: A Survey on Typological Linguistics for Natural Language Processingcited by 63
  15. 2021Continual Learning via Local Module Compositioncited by 63
  16. 2018Modular Networks: Learning to Decompose Neural Computationcited by 62
  17. 2022IGLUE: A Benchmark for Transfer Learning across Modalities, Tasks, and Languagescited by 54
  18. 2019Routing Networks and the Challenges of Modular and Compositional Computationcited by 50

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 6; 2024: 13; 2025: 12; 2026: 2.

33 papers.

Sort:

By area:

  1. 2023Efficient Large Language Models: A Surveycited by 186
  2. 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuningcited by 150
  3. 2023Domain Specialization as the Key to Make Large Language Models Disruptive: A Comprehensive Surveycited by 135
  4. 2024Learning to Route Among Specialized Experts for Zero-Shot Generalizationcited by 65
  5. 2024VB-LoRA: Extreme Parameter Efficient Fine-Tuning with Vector Bankscited by 52
  6. 2024A Survey on Model MoErging: Recycling and Routing Among Specialized Experts for Collaborative Learningcited by 52
  7. 2024Multi-Head Mixture-of-Expertscited by 31
  8. 2023Language and Task Arithmetic with Parameter-Efficient Layers for Zero-Shot Summarizationcited by 28
  9. 2023ComPEFT: Compression for Communicating Parameter Efficient Updates via Sparsification and Quantizationcited by 18
  10. 2024Analyzing and Adapting Large Language Models for Few-Shot Multilingual NLU: Are We There Yet?cited by 11
  11. 2024Does Combining Parameter-efficient Modules Improve Few-shot Transfer Accuracy?cited by 9
  12. 2024PERFT: Parameter-Efficient Routed Fine-Tuning for Mixture-of-Expert Modelcited by 9
21 more
  1. 2025LoRA-Augmented Generation (LAG) for Knowledge-Intensive Language Taskscited by 8
  2. 2025Parameter-Efficient Routed Fine-Tuning: Mixture-of-Experts Demands Mixture of Adaptation Modulescited by 8
  3. 2025Multi-Task Vehicle Routing Solver via Mixture of Specialized Experts under State-Decomposable MDPcited by 7
  4. 2024Simple Drop-in LoRA Conditioning on Attention Layers Will Improve Your Diffusion Modelcited by 6
  5. 2025SpectR: Dynamically Composing LM Experts with Spectral Routingcited by 6
  6. 2025Parametric Retrieval-Augmented Generation using Latent Routing of LoRA Adapterscited by 6
  7. 2024Glider: Global and Local Instruction-Driven Expert Routercited by 4
  8. 2025One Rank at a Time: Cascading Error Dynamics in Sequential Learningcited by 3
  9. 2025FLoE: Fisher-Based Layer Selection for Efficient Sparse Adaptation of Low-Rank Expertscited by 3
  10. 2024OrchMoE: Efficient Multi-Adapter Learning with Task-Skill Synergycited by 2
  11. 2024Leveraging Open Knowledge for Advancing Task Expertise in Large Language Modelscited by 2
  12. 2024AdaptGCD: Multi-Expert Adapter Tuning for Generalized Category Discoverycited by 2
  13. 2025Generative Modeling of Individual Behavior at Scalecited by 2
  14. 2026Adapting Time Series Foundation Models through Data Mixturescited by 2
  15. 2026Parametric Memory Decoding for Zero-Shot Routing in LoRA-Based External Parametric Memorycited by 2
  16. 2024One Arrow, Many Targets: Probing LLMs for Multi-Attribute Controllable Text Summarizationcited by 1
  17. 2025SEQR: Secure and Efficient QR-based LoRA Routingcited by 1
  18. 2025Fine-Grained DINO Tuning with Dual Supervision for Face Forgery Detectioncited by 1
  19. 2023Subspace-Configurable Networkscited by 0
  20. 2025GenKnowSub: Improving Modularity and Reusability of LLMs through General Knowledge Subtractioncited by 0
  21. 2025Task-oriented Learnable Diffusion Timesteps for Universal Few-shot Learning of Dense Taskscited by 0