MoE routing shouldn’t be a hard top-k guess.
ProbMoE turns TopK routing into probabilistic inference over expert subsets, giving routers more informative gradients, more exploration, and better expert utilization. Because it’s probabilistic, it naturally extends to Dynamic-k, learning both which experts to use and how many each token needs.
Moreover, ProbMoE is broadly applicable to TopK-routed MoEs, while keeping training efficient through sparse expert execution.
Sparse compute. Smarter routing. 🚀
A probabilistic router might sound expensive — but ProbMoE keeps the sparse execution benefits of TopK MoEs.
Our wall-clock results show that the optimized variant stays close to conventional routing in step time, total training time, and GPU memory, while delivering the benefits of better routing.
better routing without giving up efficiency
Huge thanks to my amazing collaborators @zileishao @guyvdb @zhezeng0908 ! It’s been a great pleasure working together on ProbMoE.🥰
Full paper: arxiv.org/pdf/2606.01509
Code: github.com/HengHugoZhao/Prob…
Heng Zhao retweeted
Check out our most recent work on dLLM!
One of the biggest promises of Diffusion LLMs is parallel generation: predicting multiple tokens at once to bypass the sequential bottleneck of autoregressive models.
However, parallel generation comes with a price. For example:
Should the sentence “He is from [MASK] [MASK]” be filled with [New] [York] or [San] [Diego]?
If a diffusion model predicts both at the exact same time, it assumes independence and may produce... [San] [York]. 🤦♂️
We argue this arises from a structural misspecification: models are restricted to fully factorized outputs because parameterizing the full joint distribution would require a prohibitively massive output head.
This is the Factorization Barrier crippling parallel generation. Here is how we broke it with CoDD.





