mlsanityData to 14 Oct 2026

Conditional Capacity and Routing in Mixture-of-Experts Particle Transformers

arXiv 2610.02701 ↗First posted 2 Oct 2026cs.LG hep-excited by 0

On the map: Mixture-of-experts → Expert routing strategies also fits: MoE theory and gating functions

Abstract (arXiv)

Mixture-of-Experts (MoE) models can increase parameter capacity without proportionally increasing active computation, but it is unclear how this trade-off behaves in particle-physics transformers. We study dense and MoE Particle Transformers on 188-class JetClass-II, varying expert count, routing capacity, top-K, and auxiliary loss. We find that, when token dropping is avoided, top-1 MoE models improve over the dense baseline at nearly unchanged nominal forward compute, while further increasing the number of stored experts produces little additional accuracy gain. Activating multiple experts per token yields additional predictive improvements at higher computational cost. Routing analyses show that expert assignments become more strongly associated with particle identity and kinematics in some configurations, but this structure does not increase monotonically with classification performance. These results highlight the need to distinguish stored parameter capacity, active computation, routing capacity, and routing organization when evaluating sparse expert models for jet classification. Code and experiment configurations are available at https://github.com/kpendiyala/MPT.

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

Builds on

10 of 16 references.

Closest ancestors · 3

Same direction, newest first

  1. 2026The Myth of Expert Specialization in MoEs: Why Routing Reflects Geometry, Not Necessarily Domain Expertise10 Apr
  2. 2022Mixture-of-Experts with Expert Choice Routing18 Feb
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 7

  1. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  2. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
  3. 2021Scaling Vision with Sparse Mixture of Expertscited by 747
  4. 2022Unified Scaling Laws for Routed Language Modelscited by 253
  5. 2022MegaBlocks: Efficient Sparse Training with Mixture-of-Expertscited by 209
  6. 2022Particle Transformer for Jet Taggingcited by 98
  7. 2025Mixture-of-Experts Graph Transformers for Interpretable Particle Collision Detectioncited by 4

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Generalization and Scaling Laws for Mixture-of-Experts Transformers
  2. 2024Revisiting MoE and Dense Speed-Accuracy Comparisons for LLM Training
  3. 2026Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute
  4. 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
  5. 2026Training-Free Halving of Activated Experts in Fine-Grained Mixture-of-Experts Models
  6. 2026DECO: Sparse Mixture-of-Experts with Dense-Comparable Performance on End-Side Devices
  7. 2025Dense Backpropagation Improves Training for Sparse Mixture-of-Experts
  8. 2026Towards a Statistical Understanding of Mixture-of-Experts