Pith. sign in

REVIEW 3 cited by

Pangu Ultra MoE: How to Train Your Big MoE on Ascend NPUs

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 2505.04519 v1 pith:D5BVIOYI submitted 2025-05-07 cs.CL

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

Sparse large language models (LLMs) with Mixture of Experts (MoE) and close to a trillion parameters are dominating the realm of most capable language models. However, the massive model scale poses significant challenges for the underlying software and hardware systems. In this paper, we aim to uncover a recipe to harness such scale on Ascend NPUs. The key goals are better usage of the computing resources under the dynamic sparse model structures and materializing the expected performance gain on the actual hardware. To select model configurations suitable for Ascend NPUs without repeatedly running the expensive experiments, we leverage simulation to compare the trade-off of various model hyperparameters. This study led to Pangu Ultra MoE, a sparse LLM with 718 billion parameters, and we conducted experiments on the model to verify the simulation results. On the system side, we dig into Expert Parallelism to optimize the communication between NPU devices to reduce the synchronization overhead. We also optimize the memory efficiency within the devices to further reduce the parameter and activation management overhead. In the end, we achieve an MFU of 30.0% when training Pangu Ultra MoE, with performance comparable to that of DeepSeek R1, on 6K Ascend NPUs, and demonstrate that the Ascend system is capable of harnessing all the training stages of the state-of-the-art language models. Extensive experiments indicate that our recipe can lead to efficient training of large-scale sparse language models with MoE. We also study the behaviors of such models for future reference.

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. DTop-p MoE: Sparsity-Controlled Dynamic Top-p MoE for Foundation Model Pre-training

    cs.AI 2025-12 conditional novelty 6.0 of 10

    A PI-controller-tuned, layerwise-normalized Top-p router trains sparse MoE models that beat Top-k at matched average activated-expert count.

  3. Serving Large Language Models on Huawei CloudMatrix384

    cs.DC 2025-06 conditional novelty 6.0 of 10

    CloudMatrix384 with CloudMatrix-Infer reports prefill 6,688 tokens/s per NPU and decode 1,943 tokens/s per NPU on DeepSeek-R1, exceeding published NVIDIA-based efficiencies.

Pith tools