Convexifying Mean-Field Control: An Occupation-Measure and Frank-Wolfe Approach
arXiv:2607.22678
2026
Optimization
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper's transferable asset is a convexification of population-level control: represent a swarm policy by an occupation measure and optimize it with a Frank-Wolfe linear minimization oracle. This suggests a trajectory-mixture or policy-mixture method for multi-agent reinforcement learning, where each outer iteration adds a new neural policy component rather than making an unconstrained update to one policy. Convex averaging can preserve linear dynamical and support constraints, making the approach particularly relevant to collision avoidance, obstacle constraints, and safe control. The direct value is moderate and concentrated in multi-agent RL and neural optimal control rather than generic supervised learning.
Ideas from this paper
Unverified
2026
Train a population controller as a convex mixture of neural trajectory policies, using a Frank-Wolfe step to add a new policy that minimizes the current population-cost linearization. The resulting mixture operates as a structured policy ensemble and can retain feasibility when each oracle policy satisfies the same support, action, and obstacle constraints. This is a principled alternative to directly optimizing one highly nonconvex multi-agent policy.
Useful6/10
Difficulty6/10
Novelty7/10