MoE Pathfinder: Trajectory-driven Expert Pruning

Xican Yang, Yuanhe Tian, Yan Song
12/20/2025
cs.LG

No official code found. Best implementation: xicyang/MoE-Pruning (1 star, last commit 2026-03-19).

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.

View on arXivView PDF

Code Implementations(1)

Code of MoE Pathfinder: Trajectory-driven Expert Pruning

10PythonDec 21, 20257 months ago

Similar Papers

Cite this paper

@article{yang2025pathfinder,
  title  = {MoE Pathfinder: Trajectory-driven Expert Pruning},
  author = {Xican Yang and Yuanhe Tian and Yan Song},
  year   = {2025},
  eprint = {2512.18425},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.18425v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.18425.svg)](https://codeofpaper.com/paper/2512.18425)

Discussion