Pith. sign in

REVIEW 3 cited by

Prediction Is All MoE Needs: Expert Load Distribution Goes from Fluctuating to Stabilizing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.16914 v1 pith:F5EWWAHS submitted 2024-04-25 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords expertloadworkcomputationalmodelpredictioniterationslarge
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

MoE facilitates the development of large models by making the computational complexity of the model no longer scale linearly with increasing parameters. The learning sparse gating network selects a set of experts for each token to be processed; however, this may lead to differences in the number of tokens processed by each expert over several successive iterations, i.e., the expert load fluctuations, which reduces computational parallelization and resource utilization. To this end, we traced and analyzed loads of each expert in the training iterations for several large language models in this work, and defined the transient state with "obvious load fluctuation" and the stable state with "temporal locality". Moreover, given the characteristics of these two states and the computational overhead, we deployed three classical prediction algorithms that achieve accurate expert load prediction results. For the GPT3 350M model, the average error rates for predicting the expert load proportion over the next 1,000 and 2,000 steps are approximately 1.3% and 1.8%, respectively. This work can provide valuable guidance for expert placement or resource allocation for MoE model training. Based on this work, we will propose an expert placement scheme for transient and stable states in our coming work.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MoX: Efficient MoE Routing on Direct-Connect Topologies

    cs.NI 2026-07 conditional novelty 6.0 of 10

    Static, demand-oblivious routing with token-aware multicast trees and precomputed per-link weights brings MoE traffic on direct-connect fabrics close to ideal switch performance.

  2. ELK: Exploring the Efficiency of Inter-core Connected AI Chips with Deep Learning Compiler Techniques

    cs.AR 2025-07 conditional novelty 6.0 of 10

    A compiler framework, Elk, jointly schedules compute, inter-core data exchange, and HBM preloading on inter-core connected AI chips, reaching 94.84 percent of an ideal roofline on LLM workloads.

  3. MoE-GPS: Guidlines for Prediction Strategy for Dynamic Expert Duplication in MoE Load Balancing

    cs.LG 2025-06 conditional novelty 4.0 of 10

    MoE-GPS shows that predicting only the aggregate token-to-expert distribution, instead of exact token routing, can improve MoE inference latency by more than 23% in simulation, with guidelines for when each strategy wins.

Pith tools