Jadwal Sholat

Memuat jadwal sholat…

Ilmu Komputer & AI editorial

Open AccessOA2026

From Experts to Sub-experts: Fine-grained Parameter-Efficient Fine-Tuning for MoE LLMs

NSFT refines MoE adaptation by selecting task-relevant sub-experts via routing importance and intra-expert activation saliency, achieving superior performance with fewer trainable parameters.
Zhentao Tan; Chang Liu; Yao Liu; Yue Wu; Jieping Ye· 2026· DOI 10.48550/arXiv.2609.25655

The core problem

Large language models (LLMs) continue to scale, making dense full-parameter adaptation increasingly expensive. Sparse and modular architectures such as Mixture-of-Experts (MoE) models have emerged as a promising direction to manage computational costs while maintaining high capacity. However, this shift raises a critical question for parameter-efficient fine-tuning (PEFT): at what granularity should parameters be selected and updated? Existing PEFT methods like LoRA operate on predefined weight matrices, while expert-level sparse tuning methods update entire selected experts. The authors observe that activated experts are internally sparse—only a small fraction of intermediate channels strongly respond to downstream tasks. This indicates that expert-level adaptation is still too coarse. To address this, they propose NSFT (Neural Sub-expert Fine-Tuning), a fine-grained PEFT framework that refines MoE adaptation from experts to sub-experts. NSFT decomposes each expert along the intermediate dimension into structured channel groups and selects task-relevant sub-experts by combining routing importance with intra-expert activation saliency. To optimize sparse partial updates, NSFT intro

Innovation

The authors evaluate NSFT on two MoE LLMs: OLMoE and Ling-mini-2.0. Experiments cover challenging domain-specific tasks and general benchmarks. Baselines include representative PEFT methods (e.g., LoRA) and expert-level sparse tuning methods. Across all tasks, NSFT consistently outperforms these baselines. Notably, NSFT achieves these gains while using substantially fewer trainable parameters. For instance, on domain-specific tasks, NSFT improves accuracy by a significant margin over LoRA and expert-level tuning, demonstrating the effectiveness of sub-expert-level adaptation. On general benchmarks, NSFT preserves competitive general capability, indicating that the fine-grained updates do not harm the model's broad knowledge. The results are consistent across both model architectures, suggesting the generality of the approach. The authors report that NSFT's parameter efficiency is a key advantage, as it updates only a small fraction of sub-experts per expert, leading to lower memory and compute requirements during fine-tuning. Overall, the experiments validate that sub-expert-level adaptation is a more precise and efficient PEFT paradigm for MoE LLMs.
Large language models (LLMs) continue to scale, making dense full-parameter adaptation increasingly expensive. Sparse and modular architectures such as Mixture-of-Experts (MoE) models have emerged as a promising direction to manage computational costs while maintaining high capacity. However, this shift raises a critical question for parameter-efficient fine-tuning (PEFT): at what granularity should parameters be selected and updated? Existing PEFT methods like LoRA operate on predefined weight matrices, while expert-level sparse tuning methods update entire selected experts. The authors observe that activated experts are internally sparse—only a small fraction of intermediate channels strongly respond to downstream tasks. This indicates that expert-level adaptation is still too coarse. To address this, they propose NSFT (Neural Sub-expert Fine-Tuning), a fine-grained PEFT framework that refines MoE adaptation from experts to sub-experts. NSFT decomposes each expert along the intermediate dimension into structured channel groups and selects task-relevant sub-experts by combining routing importance with intra-expert activation saliency. To optimize sparse partial updates, NSFT introduces learning-rate scaling and dynamic gradient scaling to compensate for reduced effective update magnitude. Experiments on OLMoE and Ling-mini-2.0 across challenging domain-specific tasks and general benchmarks demonstrate that NSFT consistently outperforms representative PEFT and expert-level sparse tuning baselines, while using substantially fewer trainable parameters and preserving competitive general capability. These results suggest that sub-expert-level adaptation is a more precise and efficient PEFT paradigm for MoE LLMs.
NSFT operates by decomposing each expert in an MoE layer along the intermediate dimension into structured channel groups, termed sub-experts. For a given input, the router selects a set of experts, and within each selected expert, NSFT identifies task-relevant sub-experts by combining two signals: routing importance and intra-expert activation saliency. Routing importance reflects how strongly the router activates an expert for the current input, while activation saliency measures the response magnitude of intermediate channels within that expert. The combination yields a saliency score for each sub-expert, and only those above a threshold are updated during fine-tuning.

Why it matters

The key insight driving NSFT is the observation that activated experts are internally sparse: only a small fraction of intermediate channels strongly respond to downstream tasks. This challenges the conventional wisdom that expert-level adaptation is sufficient. By decomposing experts into sub-experts and selecting based on combined routing and activation saliency, NSFT achieves finer granularity without sacrificing efficiency. The learning-rate and dynamic gradient scaling mechanisms are crucial for stabilizing sparse updates, as they compensate for the reduced effective update magnitude. The authors note that NSFT's performance gains are particularly pronounced on domain-specific tasks, where task-relevant sub-experts are more distinct. On general benchmarks, the method maintains competitive performance, suggesting that it does not overfit to specific domains. A potential limitation is the need to compute saliency scores, which adds some overhead, but this is outweighed by the reduction in trainable parameters. Future work could explore adaptive thresholding and extending sub-expert decomposition to other modular architectures. Overall, NSFT represents a significant step towards more precise and efficient fine-tuning of MoE LLMs, paving the way for broader adoption of sparse adaptation techniques.

Who should read this

CS practitioners and researchers

Opening member content…