mlsanityData to 7 Oct 2026

X-MoD: Practical Scaling Laws for Sparse-Depth Routing Beyond Mixture-of-Depths

arXiv 2609.34212 ↗First posted 28 Sep 2026cs.LG cs.CLcited by 0

On the map: Mixture-of-experts → Expert routing strategies

Abstract (arXiv)

Mixture-of-Depths (MoD) enables conditional computation across Transformer depth by routing only a subset of tokens through selected layers, but its original one-sparse--one-dense alternation tightly couples total capacity to active capacity and limits sparse-depth scaling. We introduce X-MoD, a scalable sparse-depth architecture that decouples token sparsity from anchor stride, allowing total parameter count to grow while keeping active-equivalent capacity nearly fixed. To make deep sparse routing trainable, X-MoD combines dense anchors with variance-scaled layer-wise gating and depth-wise token balancing. To make this regime analyzable and usable, we formulate sparse-depth routing as a conditional architecture-design problem: given compute, context length, and active-equivalent backbone size, how should the routing configuration be chosen? We develop a practical scaling-law framework by fitting X-MoD relative to FLOP-matched dense baselines, yielding an interpretable law that decomposes performance into sparse-capacity gain, sparse-context correction, and anchor-stride interaction. The law predicts validation loss across routing configurations and reveals how context length, model scale, and anchor stride shape sparse-depth performance. We validate the architecture and law through pretraining sweeps, held-out scaling-law prediction, ablations, downstream evaluations, and comparisons with Dense, MoD, and representative MoE baselines.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 40 of its 46 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

40 of 46 references.

Closest ancestors · 3

Same direction, newest first

  1. 2025Mixture of Sparse Attention: Content-Based Learnable Sparse Attention via Expert-Choice Routing1 May
  2. 2024AdaMoE: Token-Adaptive Routing with Null Experts for Mixture-of-Experts Language Models19 Jun
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 37

  1. 2020Scaling Laws for Neural Language Modelscited by 6,411
  2. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  3. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  4. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  5. 2024Gemini 1.5: Unlocking multimodal understanding across millions of tokens of contextcited by 3,175
  6. 2022Training Compute-Optimal Large Language Modelscited by 2,927
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  8. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  9. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  10. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  11. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
  12. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
25 more
  1. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
  2. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 834
  3. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
  4. 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
  5. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
  6. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 302
  7. 2023Effective Long-Context Scaling of Foundation Modelscited by 301
  8. 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 242
  9. 2025Hierarchical Reasoning Modelcited by 167
  10. 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
  11. 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 120
  12. 2024Not All Layers of LLMs Are Necessary During Inferencecited by 95
  13. 2025MoLe-VLA: Dynamic Layer-skipping Vision Language Action Model via Mixture-of-Layers for Efficient Robot Manipulationcited by 69
  14. 2024MoMa: Efficient Early-Fusion Pre-training with Mixture of Modality-Aware Expertscited by 61
  15. 2025Inner Thinking Transformer: Leveraging Dynamic Depth Scaling to Foster Adaptive Internal Thinkingcited by 56
  16. 2024VideoLLM-MoD: Efficient Video-Language Streaming with Mixture-of-Depths Vision Computationcited by 55
  17. 2024MoE++: Accelerating Mixture-of-Experts Methods with Zero-Computation Expertscited by 55
  18. 2025Parameters vs FLOPs: Scaling Laws for Optimal Sparsity for Mixture-of-Experts Language Modelscited by 48
  19. 2026LoopFormer: Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulationcited by 48
  20. 2025Towards Greater Leverage: Scaling Laws for Efficient Mixture-of-Experts Language Modelscited by 44
  21. 2025Joint MoE Scaling Laws: Mixture of Experts Can Be Memory Efficientcited by 29
  22. 2024Scaling Laws Across Model Architectures: A Comparative Analysis of Dense and MoE Models in Large Language Modelscited by 24
  23. 2024p-MoD: Building Mixture-of-Depths MLLMs via Progressive Ratio Decaycited by 16
  24. 2024γ-MoD: Exploring Mixture-of-Depth Adaptation for Multimodal Large Language Modelscited by 13
  25. 2026Adaptive Loops and Memory in Transformers: Think Harder or Know More?cited by 11

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers
  2. 2026Mixture of Universal Experts: Scaling Virtual Width via Depth-Width Transformation
  3. 2026Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharing
  4. 2026Looped Transformers as Optimizers
  5. 2026DECO: Sparse Mixture-of-Experts with Dense-Comparable Performance on End-Side Devices
  6. 2025SliceMoE: Routing Embedding Slices Instead of Tokens for Fine-Grained and Balanced Transformer Scaling
  7. 2026Sparse Token Routing in Efficient Transformers
  8. 2026Complete-muE: Optimal Hyperparameter Transfer and Scaling for MoE Models