- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper analyzes the average-strategy update of MCCFR. The paper shows the code in OpenSpiel is not right and give some theory of why it works. The paper proposes the parent-read rule, and shows the advantage of the method.
Critical strengths
-
The defect lives in a default of a widely used implementation and in the published pseudo-code; the paper characterizes it precisely and provides a fix that is essentially free.
-
The paper gives some useful theory for MCCFR solving.
-
The reproducibility is good.
Critical weaknesses
-
The headline problem largely disappears under external sampling (ES). The good results comes entirely from outcome sampling (OS) with one-sided exploration. Under ES the default rule is at most 7.9% below the exact average on Openspiel, so there is nothing urgent to fix. Considering ES is a more practical method in MCCFR, the good results are not good in the real world. If the method only works on OS, it should shows the good results work beyond tabular. The paper needs to improving neural settings OS MCCFR [1] (large game), or showing its MCCFR works better than any other tabular CFR methods (small/medium game).
-
The novelty is limited and the related-work coverage needs to be sharpened. The original MCCFR is not right has been known since 2013 [2], in which also proposed a fix method. The paper should state explicitly what was unknown beyond prior works. The pruning family [3-6] is not discussed although "deliberately skipping iterations plus compensation" is exactly the window/tail setting. Recent MCCFR sampling methods should be discussed [7].
-
The empirical claims are narrower than the paper's framing. The good results are all shown on three small games. The largest game works not so good. And the paper's own data show rules ending below the exact average.
[1] S. McAleer, G. Farina, M. Lanctot, and T. Sandholm. ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret. ICLR 2023.
[2] M. Lanctot. Monte Carlo Sampling and Regret Minimization for Equilibrium Computation and Decision-Making in Large Extensive Form Games. PhD thesis, University of Alberta, 2013.
[3] N. Brown and T. Sandholm. Regret-Based Pruning in Extensive-Form Games. NeurIPS 2015.
[4] N. Brown and T. Sandholm. Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. ICML 2017.
[5] N. Brown, C. Kroer, and T. Sandholm. Dynamic Thresholding and Pruning for Regret Minimization. AAAI 2017.
[6] B. Li and L. Huang. Efficient Online Pruning and Abstraction for Imperfect Information Extensive-Form Games. ICLR 2025.
[7] B. Li, Y. Chen, and L. Huang. Correlated Chance Sampling for Monte Carlo Counterfactual Regret Minimization. arXiv 2026.
Questions for authors
-
Can you extend your method to external sampling? What does parent-read do there?
-
Can you report gap-vs-iterations curves on the larger instances rather than a single time point, to show whether the growth trend persists?
-
Can your method be applied to Deep CFR or Escher like method?