Abstract:We develop a scalable algorithm for mean field control problems with kernel interactions by combining particle system simulations with random Fourier feature approximations. The method replaces the quadratic-cost kernel evaluations by linear-time estimates, enabling efficient stochastic gradient descent for training feedback controls in large populations. We provide theoretical complexity bounds and demonstrate through crowd motion and flocking examples that the approach preserves control performance while substantially reducing computational cost. The results indicate that random feature approximations offer an effective and practical tool for high dimensional and large scale mean field control.
| Comments: | 6 pages, 7 figures |
| Subjects: | Optimization and Control (math.OC) |
| MSC classes: | 49N80, 60H35, 65C35, 42A38 |
| ACM classes: | G.3; G.1.6; G.1.2; F.2.1 |
| Cite as: | arXiv:2601.01175 [math.OC] |
| (or arXiv:2601.01175v2 [math.OC] for this version) | |
| https://doi.org/10.48550/arXiv.2601.01175 arXiv-issued DOI via DataCite |
From: Nicolas Langrené [view email]
[v1]
Sat, 3 Jan 2026 12:37:20 UTC (1,453 KB)
[v2]
Fri, 22 May 2026 11:17:24 UTC (1,708 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。