- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The paper develops a theory for learning the full equilibrium correspondence in finite zero-sum games near bifurcation points. It shows a sharp separation between learning one equilibrium and recovering the entire equilibrium set, and characterizes the statistical resolution limit through perturbation geometry and local minimax analysis.
Critical strengths
The paper studies a gap between finding one equilibrium and recovering the full equilibrium correspondence. It shows that the second task can be much harder near bifurcation points. The paper also develops a coherent theory around this phenomenon, linking perturbation geometry, branch survival, set convergence, and statistical minimax limits.
Critical weaknesses
I do not find the paper well written, and I have several concerns on different aspects:
- The paper is technically comprehensive, but the presentation is often overly dense. Many concepts, definitions, and theorem-level claims are introduced in a small space. For example, Section 4 introduces the finite and limiting targets, two minimax risks, strategic and experiment discrepancies, and the Gaussian comparison theorem in rapid succession, leaving relatively little intuition between the definitions and the main result.
- The sharper minimax results rely on a local, fixed-dimensional setting with known Gaussian noise and deterministic full-support sampling. These assumptions limit the generality of the statistical conclusions.
- The paper is entirely theoretical. Even a small numerical example illustrating the bifurcation and the different statistical resolution regimes would make the results easier to interpret.
- I found at least one concrete reference mismatch: the DOI listed for K. Song (2014) (i.e., 10.1016/j.jmva.2013.12.003) appears to correspond to a different article (F. Camerlenghi et al., (2013)). This is concerning because the paper states that the references were checked against primary or publisher sources.
- The writing is occasionally not sufficiently rigorous. For example, Table 1 makes theorem-level comparisons using only author-name shorthand, such as “Mills; Altman et al.” rather than explicit citations.
Given the extensive role of AI in literature discovery and manuscript preparation disclosed in the AI Use Statement, I feel that the current version has not yet been sufficiently polished by the authors. Although I appreciate the theoretical completeness of the paper, I believe substantial further effort is needed to improve the manuscript.
Questions for authors
- The statistical minimax theory assumes that the base game is known. How difficult would it be to construct a globally implementable procedure that first localizes the game and then achieves the same positive-resolution rate?
- The exact-set lower bound allows arbitrary adaptive querying, while the matching positive-resolution upper theory is developed for deterministic full-support designs. What is the main obstacle to proving a matching adaptive upper bound?
- The Gaussian minimax result is characterized through a random-set decision problem, but the paper does not provide an explicit (near-minimax) decision rule. Can we construct a computationally tractable (minimax) estimator for moderate-size matrix games?