KrwEmd: Revising the Imperfect-Recall Abstraction from Forgetting Everything
Not on the map. Why?
Abstract (arXiv)
Excessive abstraction is a critical challenge in hand abstraction-a task specific to games like Texas hold'em-when solving large-scale imperfect-information games, as it impairs AI performance. This issue arises from extreme implementations of imperfect-recall abstraction, which entirely discard historical information. This paper presents KrwEmd, the first practical algorithm designed to address this problem. We first introduce the k-recall winrate feature, which not only qualitatively distinguishes signal observation infosets by leveraging both future and, crucially, historical game information, but also quantitatively captures their similarity. We then develop the KrwEmd algorithm, which clusters signal observation infosets using earth mover's distance to measure discrepancies between their features. Experimental results demonstrate that KrwEmd significantly improves AI gameplay performance compared to existing algorithms.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 8 of its 29 references that are in the map. First posted on arXiv 15 Nov 2025.
Builds on
8 of 29 references.
References · 8
- 2017DeepStack: Expert-Level Artificial Intelligence in No-Limit Pokercited by 228
- 2016Deep Reinforcement Learning from Self-Play in Imperfect-Information Gamescited by 155
- 2020Combining Deep Reinforcement Learning and Search for Imperfect-Information Gamescited by 110
- 2018Deep Counterfactual Regret Minimizationcited by 102
- 2020DREAM: Deep Regret minimization with Advantage baselines and Model-free learningcited by 36
- 2022ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regretcited by 24
- 2020Model-free Neural Counterfactual Regret Minimization with Bootstrap Learningcited by 5
- 2025Beyond Outcome-Based Imperfect-Recall: Higher-Resolution Abstractions for Imperfect-Information Gamescited by 1
Built on by
Not cited yet.