Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.10827 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914866741116928 |
|---|---|
| author | Assouli, Mouhcine Missaoui, Badr |
| author_facet | Assouli, Mouhcine Missaoui, Badr |
| contents | This paper introduces Deep Policy Iteration (DPI), a novel approach that integrates the strengths of Neural Networks with the stability and convergence advantages of Policy Iteration (PI) to address high-dimensional stochastic Mean Field Games (MFG). DPI overcomes the limitations of PI, which is constrained by the curse of dimensionality to low-dimensional problems, by iteratively training three neural networks to solve PI equations and satisfy forward-backwards conditions. Our findings indicate that DPI achieves comparable convergence levels to the Mean Field Deep Galerkin Method (MFDGM), with additional advantages. Furthermore, deep learning techniques show promise in handling separable Hamiltonian cases where PI alone is less effective. DPI effectively manages high-dimensional problems, extending the applicability of PI to both separable and non-separable Hamiltonians. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2310_10827 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Deep Policy Iteration for High-Dimensional Mean Field Games Assouli, Mouhcine Missaoui, Badr Optimization and Control This paper introduces Deep Policy Iteration (DPI), a novel approach that integrates the strengths of Neural Networks with the stability and convergence advantages of Policy Iteration (PI) to address high-dimensional stochastic Mean Field Games (MFG). DPI overcomes the limitations of PI, which is constrained by the curse of dimensionality to low-dimensional problems, by iteratively training three neural networks to solve PI equations and satisfy forward-backwards conditions. Our findings indicate that DPI achieves comparable convergence levels to the Mean Field Deep Galerkin Method (MFDGM), with additional advantages. Furthermore, deep learning techniques show promise in handling separable Hamiltonian cases where PI alone is less effective. DPI effectively manages high-dimensional problems, extending the applicability of PI to both separable and non-separable Hamiltonians. |
| title | Deep Policy Iteration for High-Dimensional Mean Field Games |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2310.10827 |