MoE Pathfinder: Trajectory-driven Expert Pruning
Xican Yang, Yuanhe Tian, Yan Song
TL;DR
This work tackles the deployment and efficiency bottlenecks of Mixture-of-Experts models by introducing a trajectory-driven pruning framework. It reformulates MoE as a layered, weighted graph and performs global path planning using transition intensities, expert importance, and reconstruction signals to prune along top information-propagating trajectories. The method yields non-uniform, cross-layer pruning and demonstrates superior pruning performance across six benchmarks and two Mixtral models, while preserving core knowledge and routing logic. The approach offers a practical, interpretable MoE compression strategy with potential for scalable deployment in large language models.
Abstract
Mixture-of-experts (MoE) architectures used in large language models (LLMs) achieve state-of-the-art performance across diverse tasks yet face practical challenges such as deployment complexity and low activation efficiency. Expert pruning has thus emerged as a promising solution to reduce computational overhead and simplify the deployment of MoE models. However, existing expert pruning approaches conventionally rely on local importance metrics and often apply uniform layer-wise pruning, leveraging only partial evaluation signals and overlooking the heterogeneous contributions of experts across layers. To address these limitations, we propose an expert pruning approach based on the trajectory of activated experts across layers, which treats MoE as a weighted computation graph and casts expert selection as a global optimal path planning problem. Within this framework, we integrate complementary importance signals from reconstruction error, routing probabilities, and activation strength at the trajectory level, which naturally yields non-uniform expert retention across layers. Experiments show that our approach achieves superior pruning performance on nearly all tasks compared with most existing approaches.
