A Globally Convergent Flow for Time-Dependent Mean Field Games and a Solver-Agnostic Framework for Inverse Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915852053381120 |
|---|---|
| author | Yan, Hanwei Yang, Xianjin Zhang, Jingguo |
| author_facet | Yan, Hanwei Yang, Xianjin Zhang, Jingguo |
| contents | Mean field games (MFGs) model the limit of large populations of strategically interacting agents, yet both forward and inverse problems remain challenging. For the forward problem, a difficulty is to design numerical methods with global convergence guarantees whose convergence does not depend on careful initialization. For the inverse problem, a difficulty is to decouple parameter optimization from the forward solver, so that parameter updates do not depend on implementation details, and the inverse method does not need to be reformulated when the forward solver is changed. We address both issues as follows. For the forward problem, we propose a monotone Hessian-Riemannian flow for time-dependent MFGs on the feasible manifold of densities. The flow preserves the positivity of densities and is proved to be globally convergent. For the inverse problem, we cast parameter estimation as an outer optimization problem over the unknown coefficients, with the MFG system solved in an inner step for each parameter value. For solving this problem, we consider an adjoint-based gradient method together with a Gauss-Newton acceleration. This leads to a solver-agnostic framework, in which parameter updates are computed by implicitly differentiating the discrete MFG equations satisfied by the converged MFG solution, rather than by differentiating through a particular forward solver. We demonstrate the approach on several stationary and time-dependent MFG examples, where the Gauss-Newton method consistently requires fewer outer iterations than gradient descent. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_10336 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A Globally Convergent Flow for Time-Dependent Mean Field Games and a Solver-Agnostic Framework for Inverse Problems Yan, Hanwei Yang, Xianjin Zhang, Jingguo Optimization and Control Mean field games (MFGs) model the limit of large populations of strategically interacting agents, yet both forward and inverse problems remain challenging. For the forward problem, a difficulty is to design numerical methods with global convergence guarantees whose convergence does not depend on careful initialization. For the inverse problem, a difficulty is to decouple parameter optimization from the forward solver, so that parameter updates do not depend on implementation details, and the inverse method does not need to be reformulated when the forward solver is changed. We address both issues as follows. For the forward problem, we propose a monotone Hessian-Riemannian flow for time-dependent MFGs on the feasible manifold of densities. The flow preserves the positivity of densities and is proved to be globally convergent. For the inverse problem, we cast parameter estimation as an outer optimization problem over the unknown coefficients, with the MFG system solved in an inner step for each parameter value. For solving this problem, we consider an adjoint-based gradient method together with a Gauss-Newton acceleration. This leads to a solver-agnostic framework, in which parameter updates are computed by implicitly differentiating the discrete MFG equations satisfied by the converged MFG solution, rather than by differentiating through a particular forward solver. We demonstrate the approach on several stationary and time-dependent MFG examples, where the Gauss-Newton method consistently requires fewer outer iterations than gradient descent. |
| title | A Globally Convergent Flow for Time-Dependent Mean Field Games and a Solver-Agnostic Framework for Inverse Problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2603.10336 |