WorksComputer Science
An Empirical Study of Parameter-Efficient Fine-Tuning for Mixture-of-Experts LLMs
Abstract
Parameter-efficient fine-tuning (PEFT) methods are critical for adapting large models under resource-constrained settings. However, as mixture-of-experts (MoE) architectures, which offer efficient inference at massive parameter scales, gain increasing prevalence in the community, a critical gap arising from the lack of systematic recipes for applying PEFT to MoE models. To narrow this gap, we conduct a large-scale systematic study that investigates a set of essential design recipes, including which modules should be adapted, which granularity should be used to adapt MoE modules, which PEFT method to use, and to what extent should the load-balancing objective be used, across three MoE backbones on downstream tasks and general knowledge tasks. Our experiments yield several key insights. First, adapting MoE experts alone achieves the highest downstream performance with competitive general capability retention under a comparable parameter budget. Second, native expert-weight updates offer a better downstream–retention trade-off than adapters that bypass experts or entire MoE modules. Third, LoRA and DoRA together define the strongest operating region for high downstream accuracy among the evaluated PEFT methods. Fourth, no nonzero load-balancing coefficient Pareto-dominates the zero baseline. We finally evaluate a weight-level redesign of MoE-LoRA on Qwen3. Moving its module-level bypass pool into native expert weights improves all four upstream endpoints by 2.4 to 17.9 points with 17% fewer trainable parameters and a 3.2-point average downstream cost.
Project Page Code October, 2026
Introduction
Mixture-of-experts architectures ([4, 5, 15, 26]) enable extensive scaling of model parameters while activating only a small fraction of parameters per input unit. This sparse activation paradigm offers an outstanding trade-off between performance and computation, and has consequently been adopted by frontier models such as GLM-5.2 ([9]) and Kimi-K3 ([14]). Despite the increasing prevalence of MoE architectures, most existing parameter-efficient fine-tuning (PEFT) methods ([12, 13, 17]) and recipes were originally designed for dense models, and the community still lacks a systematic guideline for applying PEFT methods to MoE structures. Given that MoE models typically comprise a massive number of parameters, it is essential to adopt a scientifically grounded guideline for applying PEFT to such models to achieve efficient adaptation. This gap therefore raises a pressing question: How can we adapt MoE models to achieve the best performance-efficiency balance with the least forgetting?
To answer this question, we conduct a large-scale systematic empirical study using representative MoE backbones from different families, including Qwen3-30B-A3B-Base ([24]), Gemma-4-26B-A4B ([8]), and GPT-OSS-20B ([22]). Specifically, we structure our study around four main axes: (1) which modules should be targeted for adapting MoE models under a similar trainable parameter budget? (2) should adaptation granularity for MoE modules be set at the module level, expert level, or weight level? (3) which PEFT method generally works best for adapting MoE models? (4) how strong should the auxiliary loss coefficient be set for adapting MoE models? We conduct the study using two distinct downstream tasks and two general tasks. The first downstream task is mathematical reasoning, on which base models typically already possess strong capabilities; it serves to probe whether further leverages well-established knowledge. The second downstream task is an intent classification task, which yields unsatisfactory results for the three base models and therefore provides a more stringent test of a PEFT method’s ability to adapt in under-represented regimes.
Our study therefore yields four instructive insights: (1) applying adaptation solely to experts, achieves the best downstream performance; (2) within the MoE modules, applying adaptation at the weight level is more reliable than at the expert level or module level; (3) among the evaluated PEFT methods, LoRA and DoRA deliver the strongest downstream performance, whereas methods with weaker general capabilities retention can fail to learn the target task properly; (4) auxiliary load balancing may degrade performance on both downstream tasks and general capabilities retention. Guided by these findings, we revisit -LoRA, a PEFT method tailred for MoE fine-tuning, which established a learned mapping between the selection of pre-trained MoE experts and that of LoRA experts. Our modification on -LoRA improves all four upstream endpoints by 2.4 to 17.9 points with 17% fewer trainable parameters and only a 3.2-point average downstream cost, turning a large task-dependent forgetting into near-complete retention and thereby showing that our insights are effective beyond the controlled grid.
Our contributions are summarized as follows:
To our knowledge, this is the first large-scale PEFT study conducted directly on pretrained MoE LLMs, covering four design axes, three heterogeneous backbones, and two downstream tasks. Beyond the downstream accuracy that PEFT work usually reports alone, we pair every selected checkpoint with general-capability evaluation on MMLU-Pro and IFEval, so each design choice is judged by what it gains and by what it costs the pretrained model.
We distill the study into four actionable insights on adaptation position, expert granularity, update form, and load balancing, each stated with the regime in which it holds, providing concrete defaults and open questions for future work on MoE adaptation. Functional and spectral analyses explain how weight-level updates reuse pretrained expert computation.
We show the insights are practical by refining -LoRA, a recent routed-pool method, along the single axis it does not already follow, which improves all four general-capability endpoints with 17% fewer parameters.
Related Work
Parameter-efficient Fine-tuning (PEFT). PEFT adapts large models by learning a small set of parameters while keeping pretrained weights largely frozen. Low-rank methods modify pretrained weights through compact updates: LoRA learns a low-rank residual, while DoRA decouples weight magnitude and direction to improve the update [13, 19]. OFT and FourierFT further restrict the update space through orthogonal transformations and frequency-domain parameterization, respectively [7, 23], whereas IA3 adapts the model by scaling intermediate activations [18]. A complementary line introduces conditional computation into PEFT by organizing prompt, adapters, or LoRA modules as routed experts [3, 6, 16, 21, 28]. However, these methods are predominantly validated on dense models. It therefore remains unclear how PEFT should interact with the existing experts and routers of an MoE model. In this paper, we systematically study adaptation position, expert granularity, update form, and load balancing to derive principled guidelines for applying PEFT to MoE models.
PEFT for MoE architecture models. PEFT for pretrained MoE models is not a straightforward extension of dense-model PEFT, because sparse routing governs how limited trainable parameters receive supervision. Since each token is dispatched to a few experts, PEFT modules receive uneven, task-dependent signals, making expert selection and update sharing central design choices ([31]). Conventional top- routing also provides incomplete gradients for PEFT modules optimization during post-training (Yao et al.). Moreover, load-balancing objectives may enforce overly uniform routing and weaken the specialization induced by expert-specific updates on narrow downstream distributions ([10, 29]). Existing PEFT studies address parts of this through task-relevant expert selection, expert-wise allocation, joint router–expert adaptation, or additional routed adaptation modules ([1, 2, 20, 31, 32]). However, they often vary simultaneously in adaptation position, expert granularity, update form, routing strategy, and balancing objective, making it difficult to determine which choices consistently benefit. We therefore conduct a controlled study of these factors to derive robust principles for MoE adaptation.

Figure 1. Illustration of Position, PEFT Methods, and Auxiliary Loss.
Background and Study Design
Background
This work investigates the principled application of PEFT methods to MoE models, with an emphasis on the MoE modules. Formally, given a hidden state , the computation inside an MoE module can be written as
where denotes the router, is the routing probability for expert , and represents the transformation of expert .
We model the fine-tuning process as an incremental update of the pre-trained weights:
where is the fine-tuned weight, and and correspond to the pre-trained weight and its additive update, respectively. In the case of LoRA, the update is parameterized as , with low-rank matrices and , while and are hyper-parameters controlling the update scale and rank. Other PEFT methods evaluated in this study are deferred to Appendix § 10.
Study Design
Study Design
We evaluate Qwen3-30B-A3B-Base, Gemma-4-26B-A4B, and GPT-OSS-20B on two complementary downstream tasks, specifically mathematical reasoning and intent classification. Appendix § 15 details their architectures. For the intent classification task, the models are trained on ESFT_Intent [31] and evaluated by exact match on 500 held-out examples. For the mathematical reasoning task, models are trained on MetaMathQA-R1, derived from MetaMathQA [35], and evaluated on MATH-500 [11].
We use MMLU-Pro [30] and IFEval [36] to measure the general capabilities, including knowledge-based reasoning and instruction-following retained after downstream adaptation. For each configuration and model–task pair in the four design studies, we train three seeds per candidate learning rate and select the rate with the highest mean downstream score. We evaluate the three checkpoints at that rate on MMLU-Pro and IFEval and report three-seed means, without using general scores for selection. Detailed implementation settings are provided in Appendix § 11. Selected learning rates and Qwen3 training throughput are reported in Appendix § 18.
Empirical Study
Which Modules Should be Targeted for Adaptation?
We compare attention-only (), expert-only (), and attention+experts ( and ) under a comparable budget, using one shared branch for the expert block to keep the focus on position. We repeat each with a rank-8 router update and also test the higher-budget attention/expert pair (), with and without router adaptation.
Figure 3 summarizes the adaptation-position study. Expert-only adaptation leads across the six model–task cells at 68.6%, ahead of experts+router at 68.1% and attention+experts at 67.0%. It changes MMLU-Pro and IFEval by −3.3 and −3.6 points. Attention-only reaches 61.7%, with changes of −10.4 and −7.9 points. Attention+experts changes the two benchmarks by −1.8 and −1.0 points, while experts+router changes them by −2.0 and −3.6 points. Without and with router adaptation, the higher-budget settings reach 64.8% and 64.9%; MMLU-Pro changes by −2.2 and −0.6 points, and IFEval by −2.4 and −1.0 points. Expert-only is strongest at comparable budget, while attention+experts retains more general capability.

Figure 3. Visualized results of the study of adapted modules. Attn denotes attention, and gray labels report trainable parameters.
Insight 1. For MoE fine-tuning, target the experts by default, and adapt the router only when the task calls for routing specialization.
Which Granularity Should be Used to Adapt MoE Modules?
Figure 2 contrasts a rank-256 module-level bypass, a rank-2 expert-level bypass, and weight-level updates at ranks 1 and 2.

Figure 2. Three evaluated adaptation granularities of the MoE module.
Figure 4 shows weight-level adaptation leading at rank 2 with 69.1%, followed by rank 1 at 68.5%, module-level bypass at 68.4%, and expert-level bypass at 64.7%. Rank 1 has the strongest general-capability profile, changing MMLU-Pro and IFEval by +0.8 and −1.4 points; rank 2 changes them by −0.9 and −3.4. Both bypass alternatives reduce both benchmarks. Rank 2 gains 0.6 downstream points at roughly twice the trainable-parameter count.

Figure 4. Visualized results of the study of MoE adaptation granularity.
Insight 2. Weight-level adaptation provides the best trade-off. Rank-1 is a strong default, achieving near-optimal downstream performance while preserving general capabilities. Increasing the rank brings only marginal gains, whereas bypass-based adaptation is generally less stable and less effective.
Which PEFT Method Generally Works Best for Adapting MoE Models?
We compare LoRA [13], DoRA [19], OFT [23], FourierFT [7], and IA3 [18], alongside expert-level LoRA, MoE-LoRA [21], module-level LoRA, DAS-LoRA [27], and last-layer partial fine-tuning [34].
Weight-level LoRA and DoRA tie at 68.5% across the six downstream cells. Both raise MMLU-Pro by 0.8 points; DoRA changes IFEval by -1.1, compared with -1.4 for LoRA. Among MoE-specific variants, layer-level LoRA leads at 66.7%, followed by MoE-LoRA at 65.7%, DAS-LoRA at 64.8%, and expert-level LoRA at 64.7%. OFT, FourierFT, IA3, and partial fine-tuning reach 60.8%, 43.6%, 41.3%, and 39.4%. Weight-level LoRA and DoRA provide the strongest downstream accuracy, with DoRA retaining more IFEval performance.
Insight 3.
Start expert-weight adaptation with standard LoRA or DoRA. Favor DoRA when preserving instruction-following performance is a priority.
How Strong Should the Auxiliary Loss Coefficient Be Set For Adapting MoE Models?
We vary the auxiliary loss coefficient from zero to while holding the adaptation method and trainable-parameter count fixed, as illustrated in Figure 6.

Figure 6. Visualized results of the study of the strength of auxiliary loss.
Figure 6 shows a 68.5% downstream average without auxiliary loss; coefficients of , , , and yield 68.1%, 66.8%, 64.6%, and 58.6%. At , MMLU-Pro rises 1.2 points, IFEval falls 2.5, and the downstream average falls 1.7 relative to zero. At , MMLU-Pro and IFEval fall 0.9 and 8.5 points. Larger coefficients therefore reduce downstream performance and IFEval retention.

Figure 5. Visualized results of the study of PEFT methods.
Insight 4. The auxiliary loss should be disabled or assigned a very small coefficient during MoE adaptation. A coefficient around is a safe choice when routing regularization is required, whereas larger values can substantially degrade downstream performance.
Design Implications
To test whether the insights transfer to a composite method, we refine MoE-LoRA [32]. It follows Insight 1 by adapting only MoE modules with frozen attention and follows Insight 4 by disabling auxiliary load balancing. It also uses the native router to select entries from a shared pool without updating router weights. Its remaining mismatch is Insight 2: the pool is a module-level bypass rather than an update to native expert projections. We therefore replace each of the 128 rank-32 pool entries with a low-rank update to native expert weights while retaining the routed pool,
Analysis of Adaptation Granularity
router-driven selection, frozen attention, and zero balancing coefficient. Appendix § 10.§ 1 gives both update equations.
Table 1 shows this change reduces the parameter count by 17.0%, from 47.71M to 39.58M. It improves MMLU-Pro and IFEval by 2.44 and 5.18 points on Math, and by 5.94 and 17.93 points on Intent. The mean absolute difference from the base falls from 6.64 to 2.19 points, and the worst loss from 16.27 to 0.87. Intent remains near base on MMLU-Pro at −0.30 and exceeds base on IFEval by 1.66 points; empty responses stay low and truncation falls from 49.2% to 11.1%. The redesign costs 3.2 downstream points while preserving high downstream performance. Appendix § 14 reports additional MoE-LoRA experiments showing that adding attention adaptation or auxiliary load balancing does not consistently improve performance across tasks.
| Checkpoint | Benchmark | Original | Weight Level |
| Trainable params | 47.71M | 39.58M | |
| Math | MATH-500 | 60.0 | 55.8 |
| Math | MMLU-Pro | 48.19 | 50.63 |
| Math | IFEval | 35.12 | 40.30 |
| Intent | Intent | 84.0 | 81.8 |
| Intent | MMLU-Pro | 45.26 | 51.20 |
| Intent | IFEval | 18.11 | 36.04 |
Table 1. Original MoE-LoRA versus the insight-guided expert-weight redesign on Qwen3.
Analysis of Adaptation Granularity
We explain the advantage of weight-level adaptation in Insight 2 through functional response diversity and consistency with pretrained expert structure. We use RMSNorm-scaled probes to analyze functional response diversity and pretrained spectral consistency in Qwen3 Math and Intent adapters.
Functional Response Diversity
For a layer with base output and adapted output , collect the changes on shared probes as . We measure how broadly response energy spans output directions using the functional effective rank
Equal energy in orthogonal directions gives up to the numerical stabilizer, making the four granularities comparable.
Weight-level updates reuse the frozen expert’s nonlinear features. For a gated expert , a rank-one up-projection update gives the exact correction
The frozen nonlinear features let a rank-one update span multiple output directions, while routing combines expert-specific responses. Appendix F gives the derivation, rank bounds, and probe protocol.
Figure 7 shows mean effective ranks of 63.90 and 69.08 for weight-level on Math and Intent, compared with 16.31 and 15.91 for expert-level . The module-level update reaches 25.25 and 20.54, while weight-level reaches 86.37 and 85.22. Native weight updates therefore produce broad responses at low rank, with additional rank expanding coverage.

Figure 7. Functional response diversity across all 48 Qwen3 MoE layers on synthetic probes. Points denote layers, boxes show medians and interquartile ranges, and diamonds mark means. Weight-level rank-one updates produce broad layer responses on both adapted checkpoints.
Pretrained Spectral Consistency
To test alignment with the pretrained expert, let and denote the left singular vectors and descending singular values of its frozen down projection. For perturbations , define the cumulative energy and pretrained profile as
At cutoffs and expert width , the spectral-consistency score is
A score of one matches the pretrained profile, while zero denotes uniform energy. Appendix § 17 gives the derivation and full spectral and output-subspace results.
Figure 8 shows mean values of 0.812 and 0.822 on Math and 0.733 and 0.741 on Intent for weight-level ranks 1 and 2, versus 0.141 and 0.087 for expert-level rank 2. Rank-one weight updates lead across all 48 layer means and at 99.8% of Math and 96.3% of Intent positions. Measurements across gate, up, and down projections confirm spectral alignment; rank two broadens responses while retaining it. These results explain the low-rank efficiency behind Insight 2.

Figure 8. Pretrained spectral consistency on Qwen3: Math and Intent energy profiles and score distributions across layer–expert positions. Weight-level updates follow the pretrained spectrum.
Conclusion
MoE-PEFT is not only a choice of update parameterization; placement, granularity, optimization, and routing objectives materially change its reliability. Across three backbones and two tasks, expert FFNs are the downstream-robust placement, native expert weights are the most reliable evaluated granularity, LoRA/DoRA lead when a high downstream floor is enforced, and zero auxiliary load balancing is the only no-tuning joint default. None is universal: mixed placement can drift less, low-drift update forms can adapt poorly, and a moderate auxiliary coefficient can trade downstream accuracy for better retention of some general capabilities. Our Qwen3 analyses show that weight-level adaptation combines broad functional responses with strong reuse of pretrained spectral structure. These defaults also carry over beyond our own grid: a weight-level redesign of MoE²-LoRA that moves its module-level bypass pool into native expert weights improves all four upstream endpoints by 2.4 to 17.9 points with 17% fewer trainable parameters at a small downstream cost. We therefore offer these defaults as a scoped but directionally reliable starting point for MoE adaptation. We hope our findings and analyses can stimulate further research on parameter-efficient adaptation of MoE models, and encourage future methods to report what each design choice costs the pretrained model alongside what it gains.
Supplementary Material
The supplementary material is organized as follows:
Appendix § 10 defines the MoE and PEFT updates, including MoE-LoRA and its redesign.
Appendix § 11 describes the datasets, checkpoint selection, and evaluation protocol.
Appendix § 13 gives the settings for the four design studies.
Appendix § 14 reports additional MoE-LoRA placement and balancing experiments.
Appendix § 15 compares the backbones’ attention and expert architectures.
Appendix § 16 derives and measures functional response diversity across adaptation granularities.
Appendix § 17 analyzes pretrained spectral structure and expert output-subspace alignment.
Appendix § 18 reports selected learning rates and Qwen3 training throughput.
Overview and Notation
Let denote the token representation entering an MoE layer. Each routed expert is a gated feed-forward network. Using the fused gate/up projection employed by the evaluated backbones, expert is
where is the backbone activation function; for a SwiGLU expert, is SiLU. Equivalently, may be written as separate gate and up matrices and . Biases are omitted for clarity.
Let denote the native router logits over routed experts. For a router that renormalizes its selected probabilities, define
The routed MoE output is
If a backbone contains an always-on shared expert , the complete MoE output may be written abstractly as
where is the native shared-expert gate, or one for an ungated shared expert. This term is omitted for backbones without a shared expert. Router normalization, shared-expert gating, residual placement, and normalization layers otherwise remain unchanged from the pretrained backbone.
Each routed expert contains fused gate/up and down projections. We use Weight Level for directly adapting these expert weights, Expert Level for applying one adaptation branch to each routed expert, and Module Level for applying one shared adaptation branch to the complete MoE module in a layer. All unlisted pretrained parameters remain frozen.
DoRA. DoRA Liu et al., [19] separates the magnitude and direction of an adapted weight. Under the convention and , define
where is trainable and initialized as . The adapted weight is
Here denotes elementwise division. This row-wise expression is the transpose-equivalent form of the column-wise normalization used in the original DoRA notation.
The memory-efficient implementation replaces the normalizer used for gradient computation by
The stop-gradient operation changes the backward graph, not the numerical forward value. Weight-level DoRA is applied independently to the fused gate/up and down projections of each adapted routed expert.
OFT. OFT [23] applies the same orthogonal transformation to the weight vector of every output neuron in a frozen projection. For a skew-symmetric parameter ,
Under the convention , with , the adapted projection is
Here acts on the input dimension, equivalently transforming each row weight vector by the same orthogonal map. For block-diagonal OFT,
and the block size must divide the input width . The skew-symmetric parameters are initialized so that at initialization.
FourierFT. FourierFT [7] represents a dense weight update using a small number of trainable Fourier coefficients. Let be a fixed random support in the two-dimensional frequency domain, and let scatter the trainable real coefficient vector into the corresponding frequency locations. The update is
The original method samples the support once and uses randomly initialized coefficients. In our benchmark implementation, the support is fixed with seed 2024, the coefficients are instead initialized to zero so that initially, and the update scale is set to . These are experimental implementation choices rather than defining properties of FourierFT.
IA3. IA3 [18] learns multiplicative activation vectors. For routed expert , let
The feed-forward IA3 vector modifies the expert as
All IA3 vectors are initialized to one. Canonical IA3 additionally scales attention key and value activations, but attention adaptation is disabled in the final PEFT method comparison.
Where router IA3 is enabled in our benchmark, it is a MoE-specific extension rather than part of canonical IA3. It is applied before top- selection:
and and are then computed from .
DAS-LoRA. DAS-LoRA Tang et al., [27] performs an offline analysis of native router statistics on downstream-domain and reference data. It computes the paper’s cumulative Domain Advantage Score (CDAS) for each routed expert and selects a fixed budget of task-relevant experts in each layer:
where is the selected-expert budget. We do not replace the paper’s CDAS procedure by a simple difference of mean routing probabilities.
LoRA is attached only to the gate/up/down weights of the selected experts. Writing for the change induced by those weight-level low-rank updates, the layer output is
Thus an adapted expert contributes only when it is both selected offline by DAS-LoRA and dispatched to the current token by the native router.
MoE2-LoRA and the Insight-Guided Redesign
Canonical MoE-LoRA. MoE-LoRA Yang et al., [32] uses both native router information and a low-dimensional hidden-state channel to route over a global pool of LoRA experts. For MoE layer , let
The layer-specific LoRA-pool router is
Let
The selected pool probabilities are renormalized as
A single LoRA expert pool is shared across all MoE layers, while the routing projections are layer-specific. The canonical module-level update is
Our reproduced Qwen3 setting uses two layer groups with 128 rank-32 pool entries each (256 total), top-8 routing, and a routing bottleneck of .
Weight-level redesign. Our redesign retains the native-router-conditioned pool selection but places the resulting low-rank residuals directly in the expert weights rather than applying a module-level adaptation after the complete MoE output.
Let
map pool entry to routed expert and target projection in layer . For an input to that projection, define the token-conditioned effective update
The corresponding expert projection is evaluated as
Replacing the relevant projections in Equations (7)–(9) yields the adapted expert , and the re-designed routed output is
with the backbone’s shared-expert term added separately where applicable.
Datasets, Evaluation, and Training Protocol
Downstream and General-Capability Evaluation
The mathematical-reasoning experiments fine-tune on MetaMathQA-R1 (huggingface oumi-ai/MetaMathQA-R1), a pre-constructed synthetic dataset whose problems are drawn from MetaMathQA (Yu et al., [35]) and whose responses are generated by DeepSeek-R1. We use only the final solution portion of each response for training, excluding the intermediate think content. Mathematical reasoning is evaluated on the 500 examples in MATH-500 (Hendrycks et al., [11]). The intent experiments fine-tune on ESFT_Intent and report exact-match accuracy on a held-out set of 500 examples. We assess general-capability retention on MMLU-Pro (Wang et al., [30]) and IFEval (Zhou et al., [36]).
For each model–task–configuration in the four design studies, we train every candidate learning rate with three random seeds and select one rate by mean downstream score. We then evaluate the three checkpoints at that rate on MMLU-Pro and IFEval. Downstream and general-capability scores are averaged over the same three seeds; general scores do not affect learning-rate selection. Table 2 summarizes the task-specific training and downstream-evaluation settings.
| Setting | Math | Intent |
| Training data | MetaMathQA-R1 | ESFT_Intent |
| Maximum samples | 80,000 | 80,000 |
| Epochs | 1 | 3 |
| Sequence cutoff | 2,048 | 4,096 |
| Packing | default | disabled |
| Evaluation set size | 500 | 500 |
| Evaluation metric | accuracy | exact match |
| Maximum new tokens | 512 | 512 |
| Evaluation batch size | 32 | 8 |
Table 2. Task-specific training and downstream-evaluation settings.
Common Optimization Settings
All reported fine-tuning runs use four GPUs, BF16 computation, gradient checkpointing, and DeepSpeed ZeRO-2 (Rasley et al., [25]). Optimization uses fused AdamW with , , and ; the learning-rate schedule is cosine with a 0.1 warmup ratio. For every experiment, the learning rate is selected by grid search over candidates drawn from . No adapter dropout was configured. All backbones are loaded with remote model code enabled.
The per-device batch size is 6 with six accumulation steps on four GPUs, giving an effective batch size of . Gemma-4 Intent uses a per-device batch size of 4 and nine accumulation steps, preserving the same effective batch size of . GPT-OSS Intent explicitly disables FlashAttention.
Experiment-Specific Settings
Experiment-Specific Settings
Adaptation Position
The position study uses one shared low-rank adaptation branch alongside the complete expert block when experts are adapted, standard LoRA for attention, and an optional LoRA branch on the native router. All target layers are enabled, pool and weight sharing are per layer, and the auxiliary coefficient is zero. The scale is throughout. Each of the first three base configurations is evaluated both without and with router LoRA (, ); the higher-budget configuration is evaluated in the same two variants, yielding eight arms. Table 3 summarizes these adaptation-position configurations.
| Base arm | Attention | Expert adaptation | Router variant |
| Attention only | – | off or | |
| Experts only | – | off or | |
| Attention+experts | off or | ||
| Higher budget | off or |
Table 3. Adaptation-position arms. Expert adaptation uses one independently routed top-1 branch per layer (), shared by the complete expert block.
For Qwen3, the estimated trainable counts before adding the optional router branch are approximately 53.48M for attention , 50.33M for expert adaptation with , 51.90M for attention plus expert adaptation with , and 103.81M for the higher-budget arm.
Adaptation Granularity
The final granularity experiment isolates the expert-adaptation design while retaining the router LoRA anchor. Attention is disabled. Every arm targets all MoE layers, uses per-layer pool/weight sharing, router LoRA , , and zero auxiliary coefficient.
PEFT Method Comparison
The ten-method comparison uses the same experts+router, no-attention protocol as the final granularity study. For LoRA-structured methods, the router anchor is LoRA , . For DoRA, OFT, FourierFT, and IA3, the router uses the same update family as the weight-level expert adaptation rather than a LoRA adapter. All methods target every MoE layer and use zero auxiliary loss. The exact method-specific settings are listed in Table 5 and Table 6.
| Method | Expert update | Router update | Backbone-specific values |
| Weight-level LoRA | Expert gate/up/down weights, | LoRA | Same on all three backbones |
| Weight-level DoRA | Expert gate/up/down weights, , plus magnitude | DoRA | Same ranks/scales on all three backbones |
| Weight-level OFT | Blockwise Cayley transform | Blockwise OFT | Expert/router blocks: Qwen3 4/128; Gemma-4 8/128; GPT-OSS 6/32 |
| FourierFT | Fixed-support spectral delta | FourierFT | Expert/router frequencies: Qwen3 4096/17408; Gemma-4 5632/23552; GPT-OSS 5760/23296; scale 150, seed 2024 |
| IA3 | Per-expert down-input scale | Router-logit output scale | One-initialized vectors; no rank |
Table 5. Weight-level methods in the final PEFT method comparison. Attention is disabled, so attention-specific capacity values are intentionally omitted.
| Method | Expert update | Router update | Backbone-specific values |
| Expert-level LoRA | One adaptation branch per routed expert, follows the native router’s top-, | LoRA | for Qwen3 and Gemma-4; 32/4 for GPT-OSS |
| MoE-LoRA | Independent adapter router, , adapter top-2 | LoRA | FFN on Qwen3/Gemma-4; on GPT-OSS |
| Module-level LoRA | One independent top-1 adaptation branch per layer | LoRA | FFN on Qwen3/Gemma-4; on GPT-OSS |
| DAS-LoRA | Highest-DAS expert subset per layer | Enabled common LoRA router anchor | Select 8 experts with on Qwen3/Gemma-4; 4 experts with on GPT-OSS |
| Partial FT | Full expert weights in last decoder layer | Full router in last layer | No adapter and no parameter matching |
Table 6. MoE-structured and partial-fine-tuning methods in the final PEFT method comparison. MoE-LoRA is excluded from this controlled ten-method grid and analyzed separately in Section A.1.
Auxiliary Load-Balancing Loss
| Granularity | Routing and placement | Expert setting |
| Module Level | Independent, , top-1 | |
| Expert Level | Follow native router; one branch per expert | |
| Weight Level | Follow native router; gate/up/down weights | |
| Weight Level | Follow native router; gate/up/down weights |
Table 4. The four final granularity arms. Native routing uses 128 experts and top-8 for Qwen3/Gemma-4, and 32 experts and top-4 for GPT-OSS.
Auxiliary Load-Balancing Loss
The auxiliary study uses weight-level LoRA with , , router LoRA , , no attention, and the same learning-rate grid as the granularity study. For a batch-level routing frequency and mean dense router probability , the per-layer balancing term has the form
The schedule is constant and . The zero-coefficient arm reuses the corresponding no-attention granularity baseline. The downstream averages reported in the main paper are 68.5, 68.1, 66.8, 64.6, and 58.6 percent for increasing , respectively.
Additional MoE-LoRA Validation of Placement and Balancing
In this section, we test the adaptation-position conclusion (Insight 1 in the main paper) and the auxiliary-load-balancing conclusion (Insight 4).
Evidence for the Two Design Defaults
Experimental Controls
The experts-only reference uses the reproduced MoE-LoRA configuration: two layer groups, a 128-entry rank-32 adaptation pool per group (256 entries in total), , learned top-8 pool routing, a 128-dimensional routing bottleneck, and no attention or router LoRA. Its load-balancing coefficient is zero. The budget-matched placement arm reduces the expert-adaptation pool to , , and adds standard rank-18, LoRA to the Q, K, V, and output projections in every attention layer. This changes the trainable count by only 0.76%, from 47.71M to 48.07M parameters.
The balancing arms keep the experts-only architecture and trainable count fixed, leave attention and router adaptation disabled, and apply a constant . The downstream-selected learning rate is for Intent and for Math. Intent is trained for three epochs and Math for one epoch; both use the common 80,000-sample training and downstream-selected checkpoint protocol. MMLU-Pro and IFEval are evaluated on those same checkpoints. Table 7 and Table 8 report full-set results.
| Configuration | Trainable params | Intent | MMLU-Pro | IFEval |
| Experts only | 47.71M | 84.00 | 45.26 | 18.11 |
| Attention+experts | 48.07M | 81.60 | 47.93 | 14.23 |
| Balance | 47.71M | 85.00 | 47.46 | 17.56 |
| Balance | 47.71M | 82.20 | 45.18 | 5.91 |
| Balance | 47.71M | 80.80 | 22.37 | 7.76 |
| Balance | 47.71M | 67.80 | 16.89 | 13.31 |
Table 7. Additional Qwen3 MoE-LoRA validation on Intent. All metrics are percentages. Intent uses 500 held-out examples, MMLU-Pro uses 12,032 examples, and IFEval is prompt-level accuracy on 541 prompts.
| Configuration | Trainable params | MATH-500 | MMLU-Pro | IFEval |
| Experts only | 47.71M | 60.00 | 48.19 | 35.12 |
| Attention+experts | 48.07M | 56.60 | 47.56 | 36.23 |
| Balance | 47.71M | 56.40 | 47.27 | 40.67 |
| Balance | 47.71M | 55.80 | 46.69 | 43.81 |
| Balance | 47.71M | 55.60 | 44.83 | 45.47 |
| Balance | 47.71M | 53.40 | 42.50 | 46.58 |
Table 8. Additional Qwen3 MoE2-LoRA validation on Math. All metrics are percentages.
Evidence for the Two Design Defaults
Adaptation position. Starting from the experts-only reference, adding attention adaptation at an effectively matched parameter budget consistently weakens downstream performance: Intent decreases from 84.00 to 81.60 and MATH-500 from 60.00 to 56.60. For each task, the joint Attention+experts configuration also degrades at least one upstream benchmark. On Intent, IFEval falls from 18.11 to 14.23 despite the MMLU-Pro improvement; on Math, MMLU-Pro falls from 48.19 to 47.56 despite the IFEval improvement. Adding attention therefore fails to provide a consistent benefit and instead introduces simultaneous downstream and upstream degradation on both tasks. These results reinforce Insight 1: for MoE fine-tuning, target the experts by default and unfreeze shared attention modules cautiously, since adapting more modules does not necessarily yield better transfer and may amplify general-capability forgetting.
Auxiliary load balancing. On Intent, the smallest coefficient, , remains competitive: it improves Intent from 84.00 to 85.00 and MMLU-Pro from 45.26 to 47.46, with only a 0.55-point decrease on IFEval. This local benefit does not transfer to Math, where the same coefficient reduces MATH-500 from 60.00 to 56.40 and MMLU-Pro from 48.19 to 47.27, although IFEval improves. The other nonzero coefficients are generally more damaging. They all lower downstream performance on both tasks; on Intent, the larger coefficients also cause substantial upstream degradation, while on Math the IFEval gains are consistently accompanied by losses on both MATH-500 and MMLU-Pro. Thus, auxiliary balancing does not yield a task-stable improvement. These results support Insight 4: the auxiliary loss should be disabled or assigned a very small coefficient during MoE adaptation. A coefficient around is a safe choice when routing regularization is required and may benefit particular datasets, whereas larger values can substantially degrade downstream performance.
Backbone Architectures
The experiments use the text-generation pathways of Qwen3-30B-A3B-Base (Qwen Team, [24]), Gemma-4-26B-A4B (Gemma Team, [8]), and GPT-OSS-20B (OpenAI, [22]). Gemma-4 is distributed through a multimodal wrapper, but no visual inputs or vision-tower adaptation are used. The architectural values below follow the official reports, model cards, and released checkpoint configurations. Tables 9 and Table 10 summarize the attention and MoE architectures, respectively.
| Backbone | Routed experts | Top- | Shared/always-on expert path | Routed width | Expert adaptation target |
| Qwen3-30B-A3B-Base | 128 | 8 | No explicit shared expert | 768 | Routed experts host |
| Gemma-4-26B-A4B | 128 | 8 | One always-active shared expert; dense width 2112 in config | 704 | The 128 routed experts; shared path frozen |
| GPT-OSS-20B | 32 | 4 | No explicit shared expert | 2880 | Routed experts host |
Table 10. Table 10 | MoE structure and the actual expert-adaptation boundary. “No explicit shared expert” means that no such branch is defined in the released checkpoint configuration or reference implementation; it is not a claim about all models in that family. The Gemma-4 shared path is always active, while the repository adapts only its separate routed-expert container.
These backbones are not minor variants of one MoE template. They differ in expert cardinality (32 versus 128), token-level fan-out (top-4 versus top-8), routed width (704, 768, or 2880), the presence of an always-active shared expert, grouped-KV geometry, and attention locality. In particular, Gemma-4 tests routed-expert adaptation in the presence of a frozen shared path, while Qwen3 and GPT-OSS expose no explicit shared-expert branch; Qwen3 uses full attention throughout, whereas the other two mix local and global attention with different schedules. Against this architectural variation,
| Backbone | Layers | Hidden | Q heads | KV heads | Head dim | Attention pattern |
| Qwen3-30B-A3B-Base | 48 | 2048 | 32 | 4 | 128 | Full attention; no sliding window |
| Gemma-4-26B-A4B | 30 | 2816 | 16 | 8 local / 2 global | 256 local / 512 global | Five sliding layers followed by one global layer; window 1024; global and p-RoPE |
| GPT-OSS-20B | 24 | 2880 | 64 | 8 | 64 | Alternating sliding and full layers; window 128 |
caption: tbl:9 | Text-backbone and attention differences. “Q heads” and “KV heads” distinguish query heads from grouped key/value heads. Gemma-4 changes both KV-head count and head dimension in its global-attention layers and ties their key and value projections.
:::
the recurring trends behind the main paper’s placement, granularity, PEFT method, and balancing insights are observed across the three-backbone grid, even though individual endpoints need not share an identical ordering. This makes the findings less likely to be an artifact of one expert count, router fan-out, or attention topology, while remaining empirical rather than universal claims.
Functional Geometry of Adaptation Granularity
This appendix gives the response definitions, rank derivations, measurement protocol, and detailed numerical results for the functional analysis of adaptation granularity. The module-level rank constrains one shared branch, the expert-level rank constrains each routed branch, and the weight-level rank constrains individual expert projections. We compare these configurations through the output of the full MoE computation, including nonlinear expert features and routed aggregation.
Layer-Level Response and Functional Effective Rank
For MoE layer , let denote the frozen base-model block output and the output after loading adapter configuration . The adapter-induced functional perturbation is
For a probe set , we collect these perturbations as columns,
Unlike the rank of an individual LoRA factor or weight matrix, includes the effect of pretrained expert computation, routing weights, and aggregation across selected experts.
We define the uncentered second-moment matrix
If its eigenvalues are , the layer-level functional effective rank is the participation ratio
where is used only for numerical protection. For a nonzero response in the limit, concentrating all energy in one direction gives , whereas equal energy in orthogonal directions gives . More generally,
The measure is invariant to a common nonzero rescaling of the response, up to the numerical stabilizer. It therefore describes how response energy is distributed across directions, rather than the perturbation magnitude. A larger value indicates a higher-dimensional realized response on the probe set. Table 11 reports this geometric quantity alongside the measured downstream and retention outcomes.
| Granularity | Local | Math | Intent | Mean | Down. avg. | General-capability observation |
| Module Level | 256 | 25.25 | 20.54 | 22.90 | 68.4 | MMLU-Pro −0.5; IFEval −3.7 |
| Expert Level | 2 | 16.31 | 15.91 | 16.11 | 64.7 | MMLU-Pro −5.0; IFEval −4.6; unstable across backbones |
| Weight Level | 1 | 63.90 | 69.08 | 66.49 | 68.5 | MMLU-Pro +0.8; IFEval −1.4; best retention |
| Weight Level | 2 | 86.37 | 85.22 | 85.80 | 69.1 | MMLU-Pro −0.9; IFEval −3.4; nearly twice the trainable parameters |
Table 11. Functional effective rank and the corresponding granularity results. Math, Intent, and Mean report Qwen3 layer-level effective ranks; Mean averages the 96 task–layer observations. Downstream and general-capability results are the main-paper aggregates over three backbones and two task endpoints. The local values constrain different objects and are included only to identify each configuration.
Why Local Rank Does Not Determine Layer-Level Rank
Module- and expert-level adaptation. A module-level adaptation produces the linear correction
Writing the probe inputs as gives
Thus, is an upper bound for the single shared map, not its realized effective rank. A concentrated learned spectrum or a restricted probe span can yield a substantially smaller value. Moreover, this local bound cannot be converted directly into the rank of a configuration distributed across many experts and projections.
For expert-level adaptation, the correction from expert is
Multiplication by the input-dependent routing weight does not move a branch response outside . The complete layer, however, aggregates several selected experts whose column spaces may differ; its effective rank can therefore exceed . The value constrains each branch, not the routed layer response.
Weight-level adaptation. Write one gated expert as
where , , and are the gate, up, and down projections. Consider only a rank-one update to the up projection, . Its exact output correction is
For inputs, define
The resulting sample-response matrix is
where is the expert intermediate width. When attains the corresponding rank and all are nonzero, this upper bound is attainable. Hence, even a rank-one update to a single expert projection can reuse the frozen gate’s input-dependent nonlinear features to produce a multi-directional sample response. The measured weight-level configurations update gate, up, and down projections across all 128 experts and then aggregate routed responses. Equation (50) establishes the rank-expansion mechanism for an individual up-projection update. The full measurements include all adapted projections and routed aggregation.
Measurement Protocol
We measure the four Qwen3 granularity configurations selected for the Math and Intent experiments. The protocol is as follows.
We scan all 48 MoE layers and all 128 routed experts, without expert subsampling.
Each layer uses deterministic synthetic probes, , where is the pretrained pre-MoE RMSNorm gain for that layer.
We estimate a checkpoint-specific expert-selection distribution from the recorded training-time activation counts. For each synthetic token, we sample eight experts without replacement and assign each selected expert an aggregation weight of .
The expert-level and two weight-level configurations share the same synthetic routing realization. The module-level adaptation is applied once per token and does not pass through expert routing.
We evaluate Equation (42) for each task–configuration–layer combination, giving layer-level observations.
Math and Intent identify the trained adapters and their recorded routing statistics. All reported functional ranks characterize these checkpoints on the RMSNorm-scaled synthetic probe distribution specified above.
Functional Effective Rank Across Granularities
Table 11 reports the checkpoint-specific means and their average over 96 task–layer observations. Each layer uses 384 probes, so the response matrix has rank at most 384. The reported participation ratios further account for the concentration of energy within that response span.
Configuration-Level Comparisons
Within weight-level adaptation. Holding the expert and projection set fixed, increasing from one to two raises the mean effective rank from 66.49 to 85.80, a 29.0% increase. The task-specific increases are 22.47 on Math (35.2%) and 16.14 on Intent (23.4%). The corresponding three-backbone downstream average rises from 68.5 to 69.1, while rank one uses approximately half the trainable parameters and retains more general capability. These measurements identify the additional functional coverage supplied by a larger local rank and its associated task, parameter, and retention costs.
Across adaptation positions. The expert-level responses have mean effective ranks near 16 on both checkpoints. Their fixed branch column spaces are combined through routing, as characterized in Appendix § 16.§ 2. The shared module-level branch reaches 25.25 on Math and 20.54 on Intent, showing different energy concentration under the same local rank of 256. Weight-level rank one reaches 63.90 and 69.08 through the nonlinear mechanism in Equation (50).
Interpreting the reported quantities. Functional ranks are measured on the selected Qwen3 checkpoints, while the downstream and retention columns summarize the three-backbone study. Effective rank characterizes response diversity; MMLU-Pro and IFEval directly measure general-capability retention. Together with the expert-local spectral measurements below, these quantities describe complementary aspects of the adaptation trade-off.
Pretrained Spectral Consistency Across Adaptation Granularities
This appendix provides the expert-local spectral definitions, the mechanism of spectral inheritance, and the full measurement protocol and numerical profiles. We express each expert-output perturbation in the left singular basis of its corresponding pretrained down projection and compare its cumulative energy distribution with that projection’s spectrum.
Spectral Profile and Consistency Score
Let the pretrained down projection of expert be , with singular value decomposition
The left singular vectors form the pretrained expert’s output coordinates, with , ordered from spectrally strong to weak directions. For adapter configuration and probes , define the expert-output perturbation matrix
For weight-level adaptation, this is the change induced jointly by the gate, up, and down LoRA updates. For expert-level adaptation, it is the output of the new expert-local branch. Measuring experts separately ensures that every response is compared with its corresponding pretrained .
The cumulative fraction of perturbation energy carried by the first pretrained output directions is
We compare this profile with the down projection’s own cumulative spectrum,
where is the reference for energy distributed uniformly over the pretrained directions. A profile close to follows the pretrained strong-to-weak hierarchy, whereas a profile close to is approximately uniform in the same singular coordinates.
To summarize the three measured cutoffs , we define the pretrained spectral-consistency score
This normalization assigns to an exact match with the pretrained cumulative profile and to the uniform reference; negative values indicate a larger aggregate deviation from the pretrained profile than the uniform reference. Because common rescaling of leaves the score unchanged, it isolates the relative spectral organization of the realized perturbation.
The pretrained expert computation provides a direct mechanism for spectral inheritance. For a perturbation component that passes through the frozen down projection, , Equation 51 gives
Thus, when the latent perturbation energy is broadly distributed in the right singular coordinates, the pretrained singular values shape the output-energy profile. Weight-level gate/up updates traverse this frozen projection and can inherit its hierarchy. By contrast, expert-level adaptation produces its output through a newly learned map, without the same architectural coupling to the expert’s pretrained down spectrum. The measured score tests the resulting placement-dependent distinction directly.
Measurement Protocol
We evaluate the Qwen3 weight-level , weight-level , and expert-level checkpoints selected for the Math and Intent experiments. The protocol is as follows.
We scan all 48 MoE layers, , and all 128 routed experts in each layer, giving 6,144 layer–expert positions per checkpoint and configuration.
Each layer uses deterministic Gaussian probes scaled by the pretrained pre-MoE RMSNorm gain.
We compute the expert-output perturbation before cross-expert aggregation and express it in the left singular basis of the corresponding pretrained down projection.
For Qwen3, ; we record , , and and evaluate Equation (55) at every layer–expert position before averaging the scores.
The diagnostic is expert-indexed. The module-level configuration produces one shared post-MoE response rather than an expert-specific response, and its geometry is therefore characterized by the layer-level analysis in Section F.
Spectral Consistency Across Granularities`
Table 12 reports the three cumulative energy cutoffs and the mean consistency score. Scores are computed separately for each layer–expert position before averaging, preserving each expert’s own pretrained reference. Weight-level rank one exceeds expert-level adaptation by 0.671 on Math and 0.646 on Intent in mean . The layer-mean difference is positive in all 48 layers on both checkpoints; paired differences are positive at 99.8% of Math positions and 96.3% of Intent positions. The two weight-level ranks produce closely matched cumulative profiles at all three cutoffs.
| Checkpoint | Configuration | ||||
| Reference | Pretrained down spectrum | 0.09368 | 0.25758 | 0.64587 | 1.000 |
| Reference | Uniform directions | 0.02083 | 0.08333 | 0.33333 | 0.000 |
| Math | Weight Level, | 0.08921 | 0.23353 | 0.58366 | 0.812 |
| Math | Weight Level, | 0.08950 | 0.23470 | 0.58642 | 0.822 |
| Math | Expert Level, | 0.03762 | 0.11561 | 0.37202 | 0.141 |
| Intent | Weight Level, | 0.08308 | 0.21957 | 0.55615 | 0.733 |
| Intent | Weight Level, | 0.08338 | 0.22072 | 0.55822 | 0.741 |
| Intent | Expert Level, | 0.03151 | 0.10275 | 0.35596 | 0.087 |
Table 12. Mean cumulative spectral profiles and pretrained spectral-consistency scores. Each adapted row averages 6,144 layer–expert positions. The reference rows average the corresponding pretrained expert spectra and use for the uniform profile.
Alignment with the Main Granularity Result
Table 13 places the Qwen3 spectral measurements beside the three-backbone granularity results. Both weight-level configurations combine high spectral consistency with better downstream accuracy and retention than the expert-level configuration. Within weight-level adaptation, rank two increases functional response diversity while rank one gives the best retention and near-best downstream accuracy. The detailed measurements thus connect update placement to both response diversity and the reuse of pretrained spectral structure.
| Configuration | (M / I) | Down. avg. | MMLU | IFEval |
| Weight Level | 0.812 / 0.733 | 68.5 | +0.8 | −1.4 |
| Weight Level | 0.822 / 0.741 | 69.1 | −0.9 | −3.4 |
| Expert Level | 0.141 / 0.087 | 64.7 | −5.0 | −4.6 |
caption: Pretrained spectral consistency alongside the main granularity results. M/I denotes Math-/Intent, and MMLU denotes MMLU-Pro. Spectral scores are measured on Qwen3; downstream and general-capability values are the main-paper aggregates over three backbones and two task endpoints.
:::
Energy in the Pretrained Output Subspace
Weight-level adaptation also concentrates more perturbation energy in the pretrained expert’s output subspace. To quantify this concentration, we measure the fraction of the expert-output perturbation carried by :
Here contains the left singular directions of the pretrained down projection. We measure this share on RMSNorm-scaled Gaussian probes across all 48 layers and 128 experts for each Math and Intent checkpoint. The projection energy is estimated using , with . An isotropic output perturbation has expected share .
Figure 9 shows mean values of 0.713 and 0.722 for weight-level ranks one and two on Math, and 0.678 and 0.684 on Intent. Expert-level rank two reaches 0.393 and 0.383, respectively. Rank-one weight updates increase the in-subspace energy share by 32.0 percentage points on Math and 29.5 points on Intent, with a positive difference in all 48 layer means on both checkpoints. The rank-one and rank-two results show that this concentration is already established at rank one. Together, and characterize two complementary aspects of pretrained structure reuse: the energy retained in the expert’s output subspace and its distribution along the pretrained spectral hierarchy.

Figure 9. Perturbation energy in the pretrained expert output subspace on Qwen3 synthetic probes. The left and middle panels show layer means over 128 experts; the right panel shows distributions over 6,144 layer–expert positions per configuration. Boxes show medians and interquartile ranges, whiskers extend to the most extreme observations within 1.5 interquartile ranges, and diamonds mark means. The dashed line is the isotropic reference of 0.375. Weight-level updates concentrate more energy in pretrained output subspaces across both checkpoints.
Selected Learning Rates and Training Throughput on Qwen3
Table 14 complements the four design studies with the selected learning rates and training throughput on Qwen3-30B-A3B-Base. Each configuration uses the learning rate selected by mean downstream performance across three seeds from candidates drawn from ; the same rate is used for all three runs. Throughput is measured under the four-GPU training protocol in Appendix § 11, with an effective batch size of 144. Samples/s measures training examples processed per second, and steps/s measures optimizer updates per second.
| Configuration | Intent LR | Intent Samples/s | Intent Steps/s | Math LR | Math Samples/s | Math Steps/s |
| Adaptation position | ||||||
| Adaptation granularity | ||||||
| Module Level () | ||||||
| Expert Level () | ||||||
| Weight Level () | ||||||
| Weight Level () | ||||||
| PEFT method | ||||||
| Weight-level LoRA | ||||||
| DoRA | ||||||
| OFT | ||||||
| FourierFT | ||||||
| IA3 | ||||||
| Expert-level LoRA | ||||||
| MoE-LoRA | ||||||
| Module-level LoRA | ||||||
| DAS-LoRA | ||||||
| Partial FT (last layer) | ||||||
| Auxiliary load-balancing loss | ||||||
Table 14. Selected learning rates and training throughput on Qwen3-30B-A3B-Base. Throughput is reported as mean sample standard deviation across the runs used for each reported configuration. In the position block, and denote attention and expert-block adaptation at rank ; adds router adaptation.
The throughput results support the practical appeal of expert-weight LoRA. At the selected rates of for Intent and for Math, weight-level LoRA processes 28.27 and 19.97 samples/s, respectively, giving 1.31× and 1.45× the throughput of DoRA in these settings. It also achieves 1.53× and 1.41× the throughput of expert-level LoRA on the two tasks. These comparisons support standard expert-weight LoRA as an efficient training recipe for both Qwen3 tasks.
References
- [1]Jun Bai, Minghao Tong, Yang Liu, Zixia Jia, and Zilong Zheng. Understanding and leveraging the expert specialization of context faithfulness in mixture-of-experts LLMs. In Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing, pages 21927–21942. Association for Computational Linguistics, 2025. doi: 10.18653/v1/2025.emnlp-main.1114.DOI
- [2]Guanzhi Deng, Bo Li, Ronghao Chen, Xijun Liu, Zhuo Han, Huacan Wang, Lijie Wen, and Linqi Song. DR-LoRA: Dynamic rank LoRA for fine-tuning mixture-of-experts models, 2026.
- [3]Shihan Dou, Enyu Zhou, Yan Liu, Songyang Gao, Jun Zhao, Wei Shen, Yuhao Zhou, Zhiheng Xi, Xiao Wang, Xiaoran Fan, Shiliang Pu, Jiang Zhu, Rui Zheng, Tao Gui, Qi Zhang, and Xuanjing Huang. LoRAMoE: Alleviate world knowledge forgetting in large language models via MoE-style plugin, 2023.arxiv.org/abs/2312.09979
- [4]Nan Du, Yanping Huang, Andrew M. Dai, Simon Tong, Dmitry Lepikhin, Yuanzhong Xu, Maxim Krikun, Yanqi Zhou, Adams Wei Yu, Orhan Firat, Barret Zoph, Liam Fedus, Maarten Bosma, Zongwei Zhou, Tao Wang, Emma Wang, Kellie Webster, Marie Pellat, Kevin Robinson, Kathleen Meier-Hellstern, Toju Duke, Lucas Dixon, Kun Zhang, Quoc V. Le, Yonghui Wu, Zhifeng Chen, and Claire Cui. GLaM: Efficient scaling of language models with mixture-of-experts. In Proceedings of the 39th International Conference on Machine Learning, volume 162, pages 5547–5569, 2022.arxiv.org/abs/2112.06905
- [5]William Fedus, Barret Zoph, and Noam Shazeer. Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity. Journal of Machine Learning Research, 23(120):1–39, 2022.arxiv.org/abs/2101.03961
- [6]Chongyang Gao, Kezhen Chen, Jinmeng Rao, Baochen Sun, Ruibo Liu, Dayi Peng, Yawen Zhang, Xiaoyuan Guo, Jie Yang, and V. S. Subrahmanian. Higher layers need more LoRA experts, 2024a.arxiv.org/abs/2402.08562
- [7]Ziqi Gao, Qichao Wang, Aochuan Chen, Zijjing Liu, Bingzhe Wu, Liang Chen, and Jia Li. Parameter-efficient fine-tuning with discrete fourier transform, 2024b.arxiv.org/abs/2405.03003
- [8]Gemma Team. Gemma 4 technical report, 2026.arxiv.org/abs/2607.02770
- [9]GLM-5 Team. GLM-5: From vibe coding to agentic engineering, 2026.
- [10]Hongcan Guo, Haolang Lu, Guoshun Nan, Bolun Chu, Jialin Zhuang, Yuan Yang, Wenhao Che, Xinye Cao, Sicong Leng, Qimei Cui, and Xudong Jiang. Advancing expert specialization for better MoE. In Advances in Neural Information Processing Systems, 2025. URL https://papers.nips.cc/paper_files/paper/2025/file/4598de7d243d528e38eb0c5cd8155fb52-Paper-Conference.pdf.arxiv.org/abs/2505.22323
- [11]Dan Hendrycks, Collin Burns, Saurav Kadavath, Akul Arora, Steven Basart, Eric Tang, Dawn Song, and Jacob Steinhardt. Measuring mathematical problem solving with the MATH dataset. In Advances in Neural Information Processing Systems Datasets and Benchmarks Track, 2021.
- [12]Neil Houlsby, Andrei Giurgiu, Stanislaw Jastrzebski, Bruna Morrone, Quentin de Laroussilhe, Andrea Gesmundo, Mona Attariyan, and Sylvain Gelly. Parameter-efficient transfer learning for NLP. In Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 2790–2799, 2019.arxiv.org/abs/1902.00751
- [13]Edward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu, Yuanzhi Li, Shean Wang, Lu Wang, and Weizhu Chen. LoRA: Low-rank adaptation of large language models. In International Conference on Learning Representations, 2022.arxiv.org/abs/2106.09685
- [14]Kimi Team. Kimi K3: Open frontier intelligence, 2026.
- [15]Dmitry Lepikhin, HyoukJoong Lee, Yuanzhong Xu, Dehao Chen, Orhan Firat, Yanping Huang, Maxim Krikun, Noam Shazeer, and Zhifeng Chen. GShard: Scaling giant models with conditional computation and automatic sharding. In International Conference on Learning Representations, 2021.
- [16]Dengchun Li, Yingzi Ma, Naizheng Wang, Zhengmao Ye, Zhiyuan Cheng, Yinghao Tang, Yan Zhang, Lei Duan, Jie Zuo, Cai Yang, and Mingjie Tang. MixLoRA: Enhancing large language models fine-tuning with LoRA-based mixture of experts, 2024.arxiv.org/abs/2404.15159
- [17]Xiang Lisa Li and Percy Liang. Prefix-tuning: Optimizing continuous prompts for generation. In Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics, pages 4582–4597, 2021. doi: 10.18653/v1/2021.acl-long.353.DOI
- [18]Haokun Liu, Derek Tam, Mohammed Mueqeth, Jay Mohta, Tenghao Huang, Mohit Bansal, and Colin Raffel. Few-shot parameter-efficient fine-tuning is better and cheaper than in-context learning. In Advances in Neural Information Processing Systems, volume 35, 2022.arxiv.org/abs/2205.05638
- [19]Shih-Yang Liu, Chien-Yi Wang, Hongxu Yin, Pavlo Molchanov, Yu-Chiang Frank Wang, Kwang-Ting Cheng, and Min-Hung Chen. DoRA: Weight-decomposed low-rank adaptation, 2024a.arxiv.org/abs/2402.09353
- [20]Yilun Liu, Yunpu Ma, Shuo Chen, Zifeng Ding, Bailan He, Zhen Han, and Volker Tresp. PERFT: Parameter-efficient routed fine-tuning for mixture-of-expert model, 2024b.arxiv.org/abs/2411.08212
- [21]Tongxu Luo, Jiahe Lei, Fangyu Lei, Weihao Liu, Shizhu He, Jun Zhao, and Kang Liu. MoELoRA: Contrastive learning guided mixture of experts on parameter-efficient fine-tuning for large language models, 2024.arxiv.org/abs/2402.12851
- [22]OpenAI. gpt-oss-20b model card. Hugging Face model card: https://huggingface.co/openai/gpt-oss-20b, 2025. Accessed 2026-07-24.DOI
- [23]Zeju Qiu, Weiyang Liu, Haiwen Feng, Yuxuan Xue, Yao Feng, Zhen Liu, Dan Zhang, Adrian Weller, and Bernhard Schölkopf. Controlling text-to-image diffusion by orthogonal finetuning, 2024.arxiv.org/abs/2306.07280
- [24]Qwen Team. Qwen3 technical report, 2025.
- [25]Jeff Rasley, Samyam Rajbhandari, Olatunji Ruwase, and Yuxiong He. DeepSpeed: System optimizations enable training deep learning models with over 100 billion parameters. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 3505–3506, 2020.
- [26]Noam Shazeer, Azalia Mirhoseini, Krzysztof Maziarz, Andy Davis, Quoc Le, Geoffrey Hinton, and Jeff Dean. Outrageously large neural networks: The sparsely-gated mixture-of-experts layer. In International Conference on Learning Representations, 2017.arxiv.org/abs/1701.06538
- [27]Yiru Tang, Kun Zhou, Xin Zhao, Jing Sha, Zhichao Sheng, and Shijin Wang. Exploring expert concentration for parameter-efficient fine-tuning of mixture-of-expert LLMs, 2026. URL https://openreview.net/forum?id=zBgjWTWgCh.
- [28]Chunlin Tian, Zhan Shi, Zhijiang Guo, Li Li, and Chengzhong Xu. HydraLoRA: An asymmetric LoRA architecture for efficient fine-tuning, 2024.arxiv.org/abs/2404.19245
- [29]Lean Wang, Huazuo Gao, Chenggang Zhao, Xu Sun, and Damai Dai. Auxiliary-loss-free load balancing strategy for mixture-of-experts. arXiv preprint arXiv:2408.15664, 2024a. doi: 10.48550/arXiv.2408.15664. URL https://arxiv.org/abs/2408.15664.
- [30]Yubo Wang, Xueguang Ma, Ge Zhang, Yuansheng Ni, Abhranil Chandra, Shiguang Guo, Weiming Ren, Aaron Auralraj, Xuan He, Ziyan Jiang, Tianle Li, Max Ku, Kai Wang, Alex Z. Wang, and Wenhu Chen. MMLU-Pro: A more robust and challenging multi-task language understanding benchmark, 2024b.arxiv.org/abs/2406.01574
- [31]Zihan Wang, Deli Chen, Damai Dai, Runxin Xu, Zhuoshu Li, and Yu Wu. Let the expert stick to his last: Expert-specialized fine-tuning for sparse architectural large language models. In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, pages 784–801. Association for Computational Linguistics, 2024c. doi: 10.18653/v1/2024.emnlp-main.46.DOI
- [32]Qingyu Yang, Haonan He, Minglei Li, Jingqi Ye, Tao Chen, Lei Bai, and Peng Ye. MoE²-LoRA: When MoE models meet MoE-style low-rank adaptation, 2026.
- [34]Peng Ye, Yongqi Huang, Chongjun Tu, Minglei Li, Tao Chen, Tong He, and Wanli Ouyang. Partial fine-tuning: A successor to full fine-tuning for vision transformers, 2023. URL https://arxiv.org/abs/2312.15681.
- [35]Longhui Yu, Weisen Jiang, Han Shi, Jincheng Yu, Zhengying Liu, Yu Zhang, James T. Kwok, Zhenguo Li, Adrian Weller, and Weiyang Liu. MetaMath: Bootstrap your own mathematical questions for large language models. In International Conference on Learning Representations, 2024.arxiv.org/abs/2309.12284
- [36]Jeffrey Zhou, Tianjian Lu, Swaroop Mishra, Siddhartha Brahma, Sujoy Basu, Yi Luan, and Denny Zhou. Instruction-following evaluation for large language models, 2023.arxiv.org/abs/2311.07911