Kullback-Leibler Mirror-Prox for Measure-Valued Variational Inequalities and Mean-Field Equilibria
arXiv:2608.10293
2026
Optimization
2 ideas extracted · analyzed Sep 1, 2026
What the math gives to ML
The paper recasts mean-field equilibrium computation as a variational inequality over probability measures and replaces Euclidean extragradient projections with explicit KL-proximal exponential reweighting. The transferable asset is an entropy-aware Mirror-Prox update that preserves positivity and normalization while using a predictor-corrector evaluation of a generally non-gradient operator, which is directly relevant to attention distributions, MoE routing probabilities, and other simplex-valued neural parameters. A practical adaptation is to apply the update to logits or routing probabilities when the objective contains strategic coupling between examples, tokens, experts, or agents; the Minty residual supplies a measurable convergence diagnostic. Its KL Tikhonov variant additionally provides a principled way to prevent probability collapse while selecting the solution closest in relative entropy to a reference distribution.
Ideas from this paper
✗ Failed on benchmark
2026
Replace a standard softmax-gradient update for a probability vector with a two-stage KL Mirror-Prox update. The predictor evaluates the population-dependent cost at the current distribution, and the corrector evaluates it at the predicted distribution, reducing oscillation when routing or attention costs are coupled across tokens or samples.
Useful8/10
Difficulty5/10
Novelty5/10
Unverified
2026
Add KL Tikhonov regularization to simplex-valued attention or routing parameters so that the optimizer selects a stable solution close to a chosen reference distribution instead of collapsing onto a few entries. Anneal the regularization strength to obtain exploration early and specialization later.
Useful6/10
Difficulty3/10
Novelty4/10