TY - JOUR
T1 - Deep Learning for Population-Dependent Controls in Mean Field Control Problems with Common Noise
AU - Dayanıklı, Gökçe
AU - Laurière, Mathieu
AU - Zhang, Jiacheng
N1 - G\u00F6k\u00E7e Dayan\u0131kl\u0131 is affiliated with the Department of Statistics at UIUC. Mathieu Lauriere is affiliated with the Shanghai Frontiers Science Center of Artificial Intelligence and Deep Learning and the NYU-ECNU Institute of Mathematical Sciences, NYU Shanghai, 567 West Yangsi Road, Shanghai.
PY - 2024
Y1 - 2024
N2 - In this paper, we propose several approaches to learn the optimal population-dependent controls in order to solve mean field control problems (MFC). Such policies enable us to solve MFC problems with forms of common noises at a level of generality that was not covered by existing methods. We analyze rigorously the theoretical convergence of the proposed approximation algorithms. Of particular interest for its simplicity of implementation is the N-particle approximation. The effectiveness and the flexibility of our algorithms is supported by numerical experiments comparing several combinations of distribution approximation techniques and neural network architectures. We use three different benchmark problems from the literature: a systemic risk model, a price impact model, and a crowd motion model. We first show that our proposed algorithms converge to the correct solution in an explicitly solvable MFC problem. Then, we show that population-dependent controls outperform state-dependent controls. Along the way, we show that specific neural network architectures can improve the learning further.
AB - In this paper, we propose several approaches to learn the optimal population-dependent controls in order to solve mean field control problems (MFC). Such policies enable us to solve MFC problems with forms of common noises at a level of generality that was not covered by existing methods. We analyze rigorously the theoretical convergence of the proposed approximation algorithms. Of particular interest for its simplicity of implementation is the N-particle approximation. The effectiveness and the flexibility of our algorithms is supported by numerical experiments comparing several combinations of distribution approximation techniques and neural network architectures. We use three different benchmark problems from the literature: a systemic risk model, a price impact model, and a crowd motion model. We first show that our proposed algorithms converge to the correct solution in an explicitly solvable MFC problem. Then, we show that population-dependent controls outperform state-dependent controls. Along the way, we show that specific neural network architectures can improve the learning further.
KW - deep learning
KW - mean field control
KW - stochastic optimal control
UR - http://www.scopus.com/inward/record.url?scp=85196378891&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85196378891&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85196378891
SN - 1548-8403
VL - 2024-May
SP - 2231
EP - 2233
JO - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
JF - Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
T2 - 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024
Y2 - 6 May 2024 through 10 May 2024
ER -