mlsanityData to 13 Oct 2026

Effective LoRA Adapter Routing using Task Representations

arXiv 2601.21795 ↗First posted 29 Jan 2026cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Low-rank adaptation (LoRA) enables parameter efficient specialization of large language models (LLMs) through modular adapters, resulting in rapidly growing public adapter pools spanning diverse tasks. Effectively using these adapters requires routing: selecting and composing the appropriate adapters for a query. We introduce LORAUTER, a novel routing framework that selects and composes LoRA adapters using task representations rather than adapter characteristics. Unlike existing approaches that map queries directly to adapters, LORAUTER routes queries via task embeddings derived from small validation sets and does not require adapter training data. By operating at the task level, LORAUTER achieves efficient routing that scales with the number of tasks rather than the number of adapters. Experiments across multiple tasks show that LORAUTER consistently outperforms baseline routing approaches, matching Oracle performance (101.2%) when task-aligned adapters exist and achieving state-of-the-art results on unseen tasks (+5.2 points). We further demonstrate the robustness of LORAUTER to very large, noisy adapter pools by scaling it to over 1500 adapters.

Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Builds on 23 of its 28 references that are in the map. First posted on arXiv 29 Jan 2026.

Builds on

23 of 28 references.

References · 23

  1. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,979
  2. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,785
  3. 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,765
  4. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,463
  5. 2020Supervised Contrastive Learningcited by 2,811
  6. 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 891
  7. 2023FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performancecited by 815
  8. 2018Taskonomy: Disentangling Task Transfer Learningcited by 633
  9. 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 362
  10. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 362
  11. 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 221
  12. 2019Task2Vec: Task Embedding for Meta-Learningcited by 201
11 more
  1. 2024Mixture of LoRA Expertscited by 181
  2. 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 155
  3. 2023AutoMix: Automatically Mixing Language Modelscited by 120
  4. 2024Model merging with SVD to tie the Knotscited by 120
  5. 2023AdapterSoup: Weight Averaging to Improve Generalization of Pretrained Language Modelscited by 84
  6. 2024Towards Modular LLMs by Building and Reusing a Library of LoRAscited by 72
  7. 2024LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wildcited by 68
  8. 2024Learning to Route Among Specialized Experts for Zero-Shot Generalizationcited by 65
  9. 2025MixLLM: Dynamic Routing in Mixed Large Language Modelscited by 57
  10. 2025ICL-Router: In-Context Learned Model Representations for LLM Routingcited by 26
  11. 2025SpectR: Dynamically Composing LM Experts with Spectral Routingcited by 6

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2026: 6.

6 papers.