Learning algorithms for mean field optimal control
Not on the map. Why?
Abstract (arXiv)
We analyze an algorithm to numerically solve the mean-field optimal control problems by approximating the optimal feedback controls using neural networks with problem specific architectures. We approximate the model by an N-particle system and leverage the exchangeability of the particles to obtain substantial computational efficiency. In addition to several numerical examples, a convergence analysis is provided. We also developed a universal approximation theorem on Wasserstein spaces.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 22 Mar 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 3.
4 papers.
- 2025Simultaneously Solving Infinitely Many LQ Mean Field Games In Hilbert Spaces: The Power of Neural Operatorscited by 3
- 2026Model-free policy gradient for discrete-time mean-field controlcited by 3
- 2026Actor-Critic Learning for Extended Mean Field Control with Deterministic Policiescited by 1
- 2026Mean-Field PhiBE: Continuous-Time Mean-Field Reinforcement Learning from Discrete-Time Datacited by 0
- 2026Actor-Critic Learning for Extended Mean Field Control with Deterministic Policies13 Jul 2026
- 2026Mean-Field PhiBE: Continuous-Time Mean-Field Reinforcement Learning from Discrete-Time Data25 Jun 2026
- 2026Model-free policy gradient for discrete-time mean-field control16 Jan 2026
- 2025Simultaneously Solving Infinitely Many LQ Mean Field Games In Hilbert Spaces: The Power of Neural Operators22 Oct 2025