Exact Results for the Symmetric Dyson Exclusion Process
arXiv:2607.28807
2026
Architecture
1 ideas extracted · analyzed Aug 31, 2026
What the math gives to ML
The paper provides an exactly solvable exclusion dynamics in which local particle moves are controlled by a global logarithmic-repulsion factor, together with a free-fermion and determinantal representation of the evolution. Its transferable asset is a collision-free, diversity-promoting routing process with analytically specified multi-particle transition rates rather than independent softmax decisions. A practical neural-network use is a structured mixture-of-experts router in which expert assignments evolve by short-range moves under Dyson-style repulsion, preserving hard capacity constraints while discouraging routing collapse.
Ideas from this paper
Unverified
2026
Replace independent softmax expert choices with a collision-free Markov router whose particles occupy expert positions on a one-dimensional or circular index lattice. A particle can move only to an empty neighboring expert, and the move rate contains a product of sine ratios that globally repels nearby assignments; this should reduce expert collapse and produce more evenly spread routing without requiring a separate pairwise diversity loss.
Useful5/10
Difficulty7/10
Novelty8/10