Neural Parameter Calibration for Finite-State Mean Field Games

• URL: http://arxiv.org/abs/2606.23155v1
• Date: Mon, 22 Jun 2026 11:00:43 GMT
• Title: Neural Parameter Calibration for Finite-State Mean Field Games
• Abstract summary: Mean field games (MFGs) efficiently approximate a large population of strategic agents.<n>MFGs often involve hidden preferences, constraints, and interactions that can rarely be theoretically derived or directly observed.<n>We present a neural network-based framework for learning parametric, finite-state MFGs from observed population dynamics.
• Score: 11.904621540380097
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mean field games efficiently approximate a very large population of strategic agents. While these games can aid the understanding of complex systems, their deployment in real-world settings is challenged by the specification of their parameters: mean field games (MFGs) often involve hidden preferences, constraints, and interactions that can rarely be theoretically derived or directly observed. To address this gap, we present a neural network-based framework for learning parametric, finite-state MFGs from observed population dynamics. To do so, we formulate the parameter calibration as an inverse problem and use implicit differentiation to backpropagate through the games' equilibrium. The resulting approach is fully differentiable and enables us to estimate flexible trajectory-wise parameter paths, including state- and time-dependent specifications without requiring observations of the individual agents' actions or rewards. We provide a proof for the exactness of the gradient computation in a discrete-time formulation. We validate our framework through numerical experiments across four systems of increasing complexity, ranging from synthetic linear-quadratic benchmarks to real-world urban mobility datasets.

Related papers

• Hierarchical Inference and Closure Learning via Adaptive Surrogates for ODEs and PDEs [15.38864225184245]
  Inverse problems are the task of calibrating models to match data.<n>We develop a principled methodology for leveraging data from collections of distinct yet related physical systems.<n>We learn the shared unknown dynamics in the form of an ML-based closure model.
  arXiv  Detail & Related papers  (2026-03-04T10:30:08Z)
• Profiling systematic uncertainties in Simulation-Based Inference with Factorizable Normalizing Flows [0.0]
  We propose a general framework for Simulation-Based Inference that efficiently profiles nuisance parameters.<n>We introduce Factorizable Normalizing Flows to model systematic variations as a parametrics of a nominal density.<n>We develop an amortized training strategy that learns the conditional dependence of the DoI on nuisance parameters in a single optimization process.<n>This allows for the simultaneous extraction of the underlying distribution and the robust profiling of nuisances.
  arXiv  Detail & Related papers  (2026-02-13T18:48:12Z)
• Is Flow Matching Just Trajectory Replay for Sequential Data? [46.770624059457724]
  Flow matching (FM) is increasingly used for time-series generation.<n>It is not well understood whether it learns a general dynamical structure or simply performs an effective "trajectory replay"<n>We show that the implied sampler is an ODE whose dynamics constitutes a nonparametric, memory-augmented continuous-time dynamical system.
  arXiv  Detail & Related papers  (2026-02-09T06:48:45Z)
• Training-free score-based diffusion for parameter-dependent stochastic dynamical systems [2.4755898204110642]
  We present a training-free conditional diffusion model framework for learning flow maps of parameter-dependent SDEs.<n>A joint kernel-weighted Monte Carlo estimator approximates the conditional score function using trajectory data sampled at discrete parameter values.<n>The resulting generative model produces sample trajectories for any parameter value within the training range without retraining.
  arXiv  Detail & Related papers  (2026-02-02T13:54:36Z)
• Data-driven stochastic reduced-order modeling of parametrized dynamical systems [3.5684665108045377]
  We introduce a data-driven framework for learning continuous-time ROMs that generalize across parameter spaces and forcing conditions.<n>We demonstrate excellent generalization to unseen parameter combinations and forcings, and significant efficiency gains compared to existing approaches.
  arXiv  Detail & Related papers  (2026-01-15T18:50:18Z)
• VIKING: Deep variational inference with stochastic projections [48.946143517489496]
  Variational mean field approximations tend to struggle with contemporary overparametrized deep neural networks.<n>We propose a simple variational family that considers two independent linear subspaces of the parameter space.<n>This allows us to build a fully-correlated approximate posterior reflecting the overparametrization.
  arXiv  Detail & Related papers  (2025-10-27T15:38:35Z)
• Conditioning on PDE Parameters to Generalise Deep Learning Emulation of Stochastic and Chaotic Dynamics [0.1753733541634709]
  We present a deep learning emulator for chaotic andtemporal-temporal systems conditioned on the parameter values of the underlying partial differential equations (Ps)<n>Our approach involves pre-training the model on a single parameter domain, followed by fine-tuning on a smaller, yet diverse dataset, enabling generalisation across a broad range of parameter values.<n>This enables computationally efficient pre-training on smaller domains while requiring only small additional dataset to learn how to generalise to larger domain sizes.
  arXiv  Detail & Related papers  (2025-09-11T16:37:45Z)
• Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems [49.819436680336786]
  We propose an efficient transformed Gaussian process state-space model (ETGPSSM) for scalable and flexible modeling of high-dimensional, non-stationary dynamical systems.<n>Specifically, our ETGPSSM integrates a single shared GP with input-dependent normalizing flows, yielding an expressive implicit process prior that captures complex, non-stationary transition dynamics.<n>Our ETGPSSM outperforms existing GPSSMs and neural network-based SSMs in terms of computational efficiency and accuracy.
  arXiv  Detail & Related papers  (2025-03-24T03:19:45Z)
• Whenever, Wherever: Towards Orchestrating Crowd Simulations with Spatio-Temporal Spawn Dynamics [65.72663487116439]
  We propose nTPP-GMM that models spawn-temporal spawn dynamics using Neural Temporal Point Processes.<n>We evaluate our approach by simulations of three diverse real-world datasets with nTPP-GMM.
  arXiv  Detail & Related papers  (2025-03-20T18:46:41Z)
• Ensemble Kalman Filtering Meets Gaussian Process SSM for Non-Mean-Field and Online Inference [47.460898983429374]
  We introduce an ensemble Kalman filter (EnKF) into the non-mean-field (NMF) variational inference framework to approximate the posterior distribution of the latent states. This novel marriage between EnKF and GPSSM not only eliminates the need for extensive parameterization in learning variational distributions, but also enables an interpretable, closed-form approximation of the evidence lower bound (ELBO) We demonstrate that the resulting EnKF-aided online algorithm embodies a principled objective function by ensuring data-fitting accuracy while incorporating model regularizations to mitigate overfitting.
  arXiv  Detail & Related papers  (2023-12-10T15:22:30Z)
• Learning minimal representations of stochastic processes with variational autoencoders [52.99137594502433]
  We introduce an unsupervised machine learning approach to determine the minimal set of parameters required to describe a process. Our approach enables for the autonomous discovery of unknown parameters describing processes.
  arXiv  Detail & Related papers  (2023-07-21T14:25:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.