A Deterministic Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving

arXiv:2608.16947 · cs.DS, cs.LG · Submitted 2026-08-15 · Read on arXiv

cs.DS, cs.LG

Submitted: 2026-08-15

Updated: 2026-08-29

Terminology

• Sparsity — 4× in this paper · explained in 4 episodes
• Dynamic Mixture-of-Experts — 3× in this paper
• Verification — 2× in this paper · explained in 2 episodes
• Axioms — 1× in this paper · explained in 2 episodes
• Mixture-of-Experts (MoE) — 1× in this paper · explained in 7 episodes

Sources

• Chasing Positive Bodies
• Mixture-of-Experts Serving

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Edge-Private Matching Kernels Through Local Decoding
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing
• Scalable Algorithms for Approximate DNF Model Counting
• On the Approximation Relationship between Optimizing Ratio of Submodular (RS) and Difference of Submodular (DS) Functions