IR-PRM+ with previous-utility prediction achieves constant regret and best-iterate convergence
Read the original at arxiv.org→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...
Original headline: "IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence"
Coverage timeline
- Oct 15, 04:00 UTC arXiv cs.LG lead source IR-PRM+ with Previous-Utility Prediction: Constant Regret and Best-Iterate Convergence