IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence
arXiv:2610.19016v1 Announce Type: new Abstract: Regret matching (and its variants) and counterfactual regret minimization are central algorithms in practice for normal-form and extensive-form game solving. Yet these have historically lacked the stronger theoretical convergence guarantees available…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-10-15 04:00 · arXiv cs.LG
IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence