Glider: Global and Local Instruction-Driven Expert Router
Not on the map. Why?
Abstract (arXiv)
The availability of performant pre-trained models has led to a proliferation of fine-tuned expert models that are specialized to particular domains. This has enabled the creation of powerful and adaptive routing-based "Model MoErging" methods with the goal of using expert modules to create an aggregate system with improved performance or generalization. However, existing MoErging methods often prioritize generalization to unseen tasks at the expense of performance on held-in tasks, which limits its practical applicability in real-world deployment scenarios. We observe that current token-level routing mechanisms neglect the global semantic context of the input task. This token-wise independence hinders effective expert selection for held-in tasks, as routing decisions fail to incorporate the semantic properties of the task. To address this, we propose, Global and Local Instruction Driven Expert Router (GLIDER) that integrates a multi-scale routing mechanism, encompassing a semantic global router and a learned local router. The global router leverages LLM's advanced reasoning capabilities for semantic-related contexts to enhance expert selection. Given the input query and LLM, the router generates semantic task instructions that guide the retrieval of the most relevant experts across all layers. This global guidance is complemented by a local router that facilitates token-level routing decisions within each module, enabling finer control and enhanced performance on unseen tasks. Our experiments using T5-based models for T0 and FLAN tasks demonstrate that GLIDER achieves substantially improved held-in performance while maintaining strong generalization on held-out tasks. We also perform ablations experiments to dive deeper into the components of GLIDER. Our experiments highlight the importance of our multi-scale routing that leverages LLM-driven semantic reasoning for MoErging methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 70 of its 87 references that are in the map. First posted on arXiv 9 Oct 2024.
Builds on
70 of 87 references.
References · 70
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2021Finetuned Language Models Are Zero-Shot Learnerscited by 3,747
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,970
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,767
38 more
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,718
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2021Multitask Prompted Training Enables Zero-Shot Task Generalizationcited by 1,462
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2022Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learningcited by 886
- 2022Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Taskscited by 858
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
- 2023The Flan Collection: Designing Data and Methods for Effective Instruction Tuningcited by 734
- 2024RouteLLM: Learning to Route LLMs with Preference Datacited by 633
- 2018Taskonomy: Disentangling Task Transfer Learningcited by 631
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2018Local SGD Converges Fast and Communicates Littlecited by 595
- 2016Cross-stitch Networks for Multi-task Learningcited by 466
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2019Which Tasks Should Be Learned Together in Multi-task Learning?cited by 367
- 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 359
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 248
- 2022LST: Ladder Side-Tuning for Parameter and Memory Efficient Transfer Learningcited by 228
- 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
- 2024Mixture of LoRA Expertscited by 179
- 2023Large Language Model Routing with Benchmark Datasetscited by 166
- 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 159
- 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuningcited by 148
- 2023Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Modelscited by 141
- 2020Exploring and Predicting Transferability across NLP Taskscited by 126
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 114
- 2022Fusing finetuned models for better pretrainingcited by 110
- 2024Branch-Train-MiX: Mixing Expert LLMs into a Mixture-of-Experts LLMcited by 106
- 2024CoPa: General Robotic Manipulation through Spatial Constraints of Parts with Foundation Modelscited by 97
- 2023Soft Merging of Experts with Adaptive Routingcited by 88
- 2024Merging Multi-Task Models via Weight-Ensembling Mixture of Expertscited by 85
- 2023AdapterSoup: Weight Averaging to Improve Generalization of Pretrained Language Modelscited by 84
- 2021Learning Neural Network Subspacescited by 82
- 2023Exploring the Benefits of Training Expert Language Models over Instruction Tuningcited by 80
50 most cited of 70 All 70 (JSON)
Built on by
Citing papers per year: 2025: 3; 2026: 1.
4 papers.
- 2025FusionFactory: Fusing LLM Capabilities with Multi-LLM Log Datacited by 10
- 2025Symbolic Analysis of Grover Search Algorithm via Chain-of-Thought Reasoning and Quantum-Native Tokenizationcited by 2
- 2025Guarded Query Routing for Large Language Modelscited by 2
- 2026SemiAdapt-Instruct: Extensible Instruction Tuning via Latent Domain-Specialised Adapterscited by 0
- 2026SemiAdapt-Instruct: Extensible Instruction Tuning via Latent Domain-Specialised Adapters26 May 2026
- 2025FusionFactory: Fusing LLM Capabilities with Multi-LLM Log Data14 Jul 2025
- 2025Guarded Query Routing for Large Language Models20 May 2025
- 2025Symbolic Analysis of Grover Search Algorithm via Chain-of-Thought Reasoning and Quantum-Native Tokenization8 May 2025
Similar, not cited
Close in wording, no citation either way
- 2026MoE Routing Testbed: Studying Expert Specialization and Routing Behavior at Small Scale
- 2026Elbow-Based MoE Routing: A Training-Free Inference Time Plugin for Expert Selection
- 2024GW-MoE: Resolving Uncertainty in MoE Router with Global Workspace Theory
- 2026MoE-Sieve: Routing-Guided LoRA for Efficient MoE Fine-Tuning
- 2026MoRA: MoE Pruning via Router Bias Learning and Expert Approximation
- 2025Skill-Based Mixture-of-Experts: Adaptive Routing for Heterogeneous Reasoning via Inferred Skills
- 2026Sticky Routing: Training MoE Models for Memory-Efficient Inference
- 2026Share First, Route What Remains: A Unified Framework for Token-Adaptive MoE Computation