Efficiency and Composition
MoE
In brief — site editorial, not from the paper
Adapts a model by adding expert sub-networks or training the router that picks between them, so capacity grows without every parameter running on every input.
Definition
MoE Adaptation introduces sparse gating over a population of expert sub-networks or integrating novel expert sub-networks into an existing MoE, enabling a model to route each input to the subset of parameters most relevant to that input's characteristics—achieving scalable multi-task specialization without proportionally scaling inference cost [56, 157, 176]. This structural distinction necessitates a compound D1 (Mechanism) profile: the topological addition of a new expert constitutes Architectural Modification—physically restructuring the computational graph—while the subsequent tuning of expert weights or the central routing mechanism constitutes Parametric Update. This graph-level intervention is what mandates Modular: the model is a collection of individually addressable expert modules coordinated by a router—each expert constituting an independently auditable behavioral unit whose activation patterns can be tracked per input. Compared to PEFT, which adds lightweight parameter overlays (adapters, LoRA) to a frozen base with Modular, Partial, MoE Adaptation adds structural routing logic that fundamentally changes the model's computational topology—adapter modules are additive overlays; expert modules are gated substitutes for dense computation. The compound D2 (Goal) profile—Capability Extension, Computational Efficiency—reflects a unique operational property: MoE adaptation is the only technique in the taxonomy that simultaneously scales systemic capacity while explicitly preserving fixed inference latency bounds. The Architectural Modification classification has stringent system-engineering implications in the taxonomy: a new model topology is being registered, not a parametric override of an existing one—requiring a complete re-specification of the model's computational graph and expert routing logic audit trail as components of the system configuration record, since any change to router architecture or gating threshold alters which computation paths are activated for which inputs.
Verbatim from the paper — Efficiency and Composition
Notes from the table
Classification tensions involving these techniques are discussed in Supplementary Section S4.
Classification tensions
MoE adaptation. Straddles architecture and adaptation; the row captures the adaptation act (training routers, adding experts) rather than the architectural pattern. RLVR vs.\ RLHF/DPO ( vs.\ ). All share Parametric Update but differ on D2 (Reasoning vs. Alignment, Safety) and D3 (Verifiable Task vs. Preference Pairs). RLVR and DPO share Partial, Whole-Model, while RLHF adds Surrogate Model. The boundary blurs when RLVR induces alignment-like properties or when RLHF pipelines incorporate verifiable components; in production, both are often applied sequentially to the same base model.
Appendix C
Nearest profiles
Long-Context Ext. (0.17), PEFT (LoRA, adapters) (0.32), Calibration (0.40), Prompt Learning (0.42), Modality-Spec. Adapters (0.44)
Computed from the taxonomy data (Gower distance over all six dimensions)
References
- [56] Shihan Dou et al. 2024. LoRAMoE: Alleviating World Knowledge Forgetting in Large Language Models via MoE-Style Plugin. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- [157] Jonas Pfeiffer, Aishwarya Kamath, Andreas Rücklé, Kyunghyun Cho, and Iryna Gurevych 2021. AdapterFusion: Non-Destructive Task Composition for Transfer Learning. Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume
- [176] Noam Shazeer et al. 2017. Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer. International Conference on Learning Representations (ICLR)
Numbered as in the paper
Cite this row
MoE — six-dimensional profile D1: architectural-modification, parametric-update D2: capability-extension, computational-efficiency D3: small-labeled, unlabeled D4: ad-hoc-permanent, scheduled-permanent D5: modular, partial D6: fm, llm, mllm Source: arXiv:2608.06246Compare with another technique Find in the explorer