- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies Bayesian parameter inference in mean field games (MFGs) with common noise, where unknown parameters govern the reward functions and transition dynamics, and only partial population-level trajectories are observed. The authors propose a Bayesian-Extended Mean Field Game (BE-MFG) formulation that embeds the parameter space into an augmented game, allowing a single Nash equilibrium to represent equilibria across different parameter values. They develop a computational pipeline combining fictitious play, FiLM-conditioned neural policies, and conditional density estimation using normalizing flows or Gaussian processes to perform Bayesian inference. Theoretical results concerning parameter identifiability and equilibrium equivalence are established. Experiments on three synthetic environments and real-world electricity market data demonstrate parameter recovery and compare the proposed method against an adapted mean-field inverse reinforcement learning baseline.
Critical strengths
Interesting formulation: The proposed BE-MFG provides a unified framework for learning parameter-dependent equilibrium policies, avoiding repeated Nash equilibrium computations during Bayesian inference.
Practical methodology: The combination of fictitious play, parameter-conditioned neural networks, and conditional density estimation offers a flexible approach to recovering unknown reward and transition parameters from partial, stochastic population observations.
Diverse experiments: The paper evaluates the method on several synthetic environments with different parameter dimensions and observation settings, as well as a real-world electricity market dataset, demonstrating its potential applicability.
Critical weaknesses
1. Methodological novelty
The proposed BE-MFG formulation is closely related to amortized equilibrium learning, where a parameter-conditioned policy is trained to represent equilibria across different parameter values. Moreover, the computational pipeline primarily combines existing techniques, including fictitious play, FiLM, and normalizing flows. The authors could better clarify the methodological novelty relative to existing parameter-conditioned equilibrium solvers and explain which components are essential to the proposed approach.
2. Theoretical contributions
Although the paper presents several theoretical results, most are structural properties of the proposed formulation rather than substantive learning guarantees. In particular, Theorem 3.6 follows almost immediately from the definitions, while Theorem 4.2 primarily exploits the decomposition of the augmented game into parameter-specific MFGs. The latter provides useful justification for the proposed construction, but the overall technical depth appears limited.
More importantly, despite the paper's emphasis on Bayesian parameter learning and identifiability, it provides neither asymptotic consistency results for the proposed MAP estimator nor finite-sample estimation bounds or posterior concentration guarantees. The effects of approximate equilibrium computation, policy distillation, and conditional density estimation on the final parameter recovery are also not analyzed. Consequently, the current theoretical results do not establish when or how accurately the proposed pipeline can recover the true parameter from finitely many observations.
Additionally, the applicability of Assumption 2 to the experimental environments deserves clarification. Since the synthetic experiments involve continuous unknown parameters but discrete common noise, the conditional laws of exact mean-field trajectories may be atomic and need not be absolutely continuous with respect to the prior predictive distribution. It is therefore unclear whether the Radon–Nikodym likelihood assumed in Lemma 4.1 exists in the experimental settings.
3. Experimental validation
The experiments cover several settings, but additional comparisons would help establish the advantages of the proposed method. In particular, the MF-IRL baseline is not originally designed for common noise, and its adaptation averages out common-noise effects. Comparisons with stronger parameter-conditioned equilibrium learning or inverse-MFG baselines would be informative. The grid-search comparison could also be made more balanced by accounting for differences in parameter resolution. Furthermore, reporting end-to-end computational costs, evaluating more diverse high-dimensional parameter configurations, and including ablation studies and posterior calibration metrics would provide stronger evidence of the method's effectiveness and robustness.
Questions for authors
-
Methodological novelty: How does the BE-MFG formulation differ from directly training a parameter-conditioned equilibrium policy using fictitious play? Beyond theoretical interpretation, what specific advantages does the augmented game formulation provide?
-
Validity of theoretical assumptions: Can the authors clarify whether Assumptions 1 and 2 hold in the experimental environments? In particular, given continuous parameter spaces and discrete common noise, how is the absolute continuity required for the likelihood in Lemma 4.1 guaranteed?
-
Statistical guarantees: Can the authors provide further insight into the statistical properties of the proposed estimator? In particular, under what conditions can parameter consistency or posterior concentration be expected, and how might equilibrium approximation and density estimation errors affect parameter recovery? (I know this is hard, but will strengthens this work substantially if established)
-
Computational efficiency: Since avoiding repeated equilibrium computations is a central motivation, how does the end-to-end computational cost compare with alternative approaches when policy distillation and conditional density estimation are included? Under what conditions does the amortized approach offer a substantial computational advantage?
-
Experiments: Please address my concern in the "Weakness-Experimental validation" part.
5 comments
Q3:
We agree this question is important.
- Posterior consistency. Our observations are i.i.d. episodes given , and identifiability (Section 3) is exactly the injectivity of . Doob's consistency theorem (Doob, 1949) then applies: the posterior concentrates at for -almost every , without any further regularity. This is precisely why identifiability is the right notion, and Theorem 3.6 gives a sufficient condition for it. Under the classical Wald conditions (Wald, 1949; compact , continuity of the likelihood in , identifiability), the MAP is also consistent.
- Effect of the approximation errors. The approximate BE-NE and the density estimator give an approximate likelihood , so the posterior we compute is that of a misspecified model. For misspecified models, under regularity conditions on the model and the prior, the posterior is known to concentrate on the parameters that minimize the Kullback-Leibler divergence from the true law of the observations (Kleijn and van der Vaart, 2006, 2012). Checking these conditions for a learned likelihood, and quantifying the resulting displacement of the parameter, would require a stability estimate of the equilibrium laws with respect to , which is an open question for MFGs with common noise.
We will add the first two points to the paper. Finite-sample bounds would require new results on the stability of MFG equilibria under common noise, which we believe are beyond the scope of this paper.
We would also like to emphasize that theoretical guarantees for Bayesian inference are an extremely challenging topic, (Ghosh and Ramamoorthi, 2003; Ghosal and van der Vaart, 2017). Asking for such derivations in a conference paper limited to 9 pages seems excessive, especially since the paper already formalizes the main concepts that make such derivations possible. Our paper lays the theoretical and empirical groundwork for such studies, and should be assessed as such.
Q4:
Could you please let us know specifically what you would to like know, which is not already in our paper? We would like to draw your attention to the following elements:
- Section 4.1 (after the definition of the MAP and BMA estimators) explains why a grid of dedicated solves is not viable, and refers to App. J for the quantitative comparison.
- Section 4.2 (end of "Link between the models") states that the BE-MFG is a standard MFG with common noise, solved with the same algorithms as a single PMFG and at a comparable cost (App. B and App. J).
- App. J, "Computational cost", Table 8 (Beach Bar): at each , a dedicated PMFG reaches relative exploitability in a time comparable to the single BE-MFG solve. A grid of nodes costs s, whereas a single BE-MFG solve reaches at all the nodes in s.
- App. J, Table 9 (District, ): a single BE-MFG solve costs about as much as one dedicated solve, whereas a grid with only three points per axis would require dedicated solves.
- App. J, "Accuracy", Table 10: at a lower cost, the BE-MFG recovers the parameter about times more accurately than the grid.
The answer to the second question follows from these tables: the amortized approach offers a substantial advantage as soon as the equilibrium is needed at more than a few parameters, which is the case already in dimension , and its advantage grows exponentially with the dimension of the parameter, since the cost of a grid does, while the cost of the BE-MFG stays comparable to one dedicated solve.
Q5:
Please see our answer to W3.
In light of these answers, we kindly ask the reviewer to reassess the value of our work and to consider raising the score. If any concern remains, we would be glad to answer further questions during the discussion period.
References
- Doob, J. L. (1949). Application of the theory of martingales. Le Calcul des Probabilités et ses Applications, Colloques Internationaux du CNRS 13, 23--27.
- Ghosal, S. and van der Vaart, A. (2017). Fundamentals of Nonparametric Bayesian Inference. Cambridge University Press.
- Ghosh, J. K. and Ramamoorthi, R. V. (2003). Bayesian Nonparametrics. Springer.
- Kleijn, B. J. K. and van der Vaart, A. W. (2006). Misspecification in infinite-dimensional Bayesian statistics. The Annals of Statistics, 34(2), 837--877.
- Kleijn, B. J. K. and van der Vaart, A. W. (2012). The Bernstein--von Mises theorem under misspecification. Electronic Journal of Statistics, 6, 354--381.
- Wald, A. (1949). Note on the consistency of the maximum likelihood estimate. The Annals of Mathematical Statistics, 20(4), 595--601.
Thank you for the response and clarifications. I unterstand that the primary contribution is the BE-MFG formulation rather than the individual computational components, and I appreciate the additional discussion of the theoretical and computational aspects. However, I still have several concerns.
-
Methodological novelty. By 'amortized equilibrium learning', I refer to learning a parameter-conditioned policy that represents equilibria across a family of games, rather than solving each equilibrium independently. Related examples include Generalization in Mean Field Games by Learning Master Policies (Perrin et al., AAAI 2022) and Neural Parameter Calibration for Finite-State Mean Field Games (Thöni et al., 2026). Although these works address different settings, I believe a clearer comparison would help establish the distinctive contribution of BE-MFG beyond parameter-conditioned equilibrium learning.
-
Theoretical guarantees. I agree that Doob's theorem provides a general posterior consistency result under appropriate assumptions. However, this concerns the exact Bayesian posterior, whereas the proposed method relies on approximate equilibria and learned likelihoods. The connection between these two remains unclear. In particular, while Assumption 2 may not be necessary to run the numerical pipeline. I would appreciate clarification of how the continuous density estimator relates to the exact conditional observation laws when these laws are potentially atomic.
-
Computational efficiency. I acknowledge that Appendix J demonstrates the computational advantage of amortizing equilibrium solves compared with grid search. My concern is specifically about the end-to-end inference pipeline, including policy distillation and conditional density estimation, which are excluded from the reported timing comparisons. Since computational efficiency is a central contribution, clarifying these additional costs and the circumstances under which amortization becomes beneficial would strengthen the evidence.
Overall, I appreciate the usefulness of the proposed formulation, but I remain concerned about the extent of its methodological novelty and the connection between the theoretical formulation and the practical algorithm. I therefore raised my score to 2.
We thank the reviewer for their review and for acknowledging the interest of the formulation, the practical methodology, and the diversity of the experiments. We respectfully believe that some of the concerns do not fully reflect the content of the paper, and we clarify each of them below.
W1:
We are sorry but we did not find any reference corresponding to the exact expression “amortized equilibrium learning” so we are not sure what you mean. Can you please clarify precisely with respect to which paper(s) you would like us to compare our contributions?
Our contribution is not a new neural architecture, and we do not claim it is. It is:
As for the components: fictitious play, FiLM and normalizing flows can be replaced by other methods. What is essential is the augmented game: any MFG solver can compute the BE-NE, and any conditional density estimator can learn the likelihood. Relying on standard, well-understood components for each step is precisely what makes the pipeline credible.
W2:
We address the three paragraphs in turn.
Technical depth. Theorem 4.2 is the result that makes the method correct: without it, there is no reason why a policy trained by fictitious play on a single augmented game should induce an equilibrium of each PMFG. Its proof requires handling the mean field on the product space Θˉ×X under common noise (the lemmas of App. B). The identifiability results are, to our knowledge, the first for inverse problems in discrete-time MFGs with common noise. We claim that they are the right notions for this problem, which had not been formalized before. The main contribution of our paper is the formulation of the problem.
Statistical guarantees. Please see our answer to Q3.
Assumption 2 and the atomic laws. Assumption 2 is not required to run the method, and none of our experiments relies on it. One must distinguish the mathematical assumptions, which are needed to treat the theory rigorously, from the numerical experiments, which, as is common practice, are designed to go beyond them. Assumption 2 is used in a single place: to guarantee that the likelihood of Lemma 4.1 exists as a Radon-Nikodym derivative, so that the posterior is well defined mathematically. The pipeline itself never uses it: the normalizing flow learns a continuous conditional density from simulated trajectories, and the posterior is computed from this learned density, whatever the nature of the exact laws.
W3:
We respectfully disagree with several points.
Q1/Q2:
Please see our answer to W1/W2.