Effective, Efficient, and General Information Abstraction for Imperfect-Information Extensive-Form Games
Boning Li, Longbo Huang

TL;DR
WEVA is a new, simple method for creating game abstractions that outperforms existing techniques, requiring minimal computation and no domain knowledge, by using a warm-up phase with CFR to extract features.
Contribution
The paper introduces WEVA, a novel abstraction method that uses CFR warm-up to generate effective, domain-agnostic information abstractions with minimal overhead.
Findings
WEVA reduces exploitability by up to 80%.
As few as 10 CFR warm-up iterations suffice for superior abstractions.
WEVA outperforms existing equity- and rank-based methods across diverse games.
Abstract
Information abstraction reduces the computational cost of solving imperfect-information games by clustering information sets into a smaller number of \emph{buckets}. Existing methods either rely on domain-specific features such as rank or equity, which are inapplicable to games with non-standard payoff structures, or require expensive offline neural-network training on billions of samples. We propose \textbf{Warm-up Expected Value-based Abstraction (WEVA)}, a simple yet effective alternative: run a small number of Counterfactual Regret Minimization (CFR) iterations on the full game as a \emph{warm-up} phase, extract per-hand expected value features at every decision node, form a depth-weighted multi-node feature vector, and apply -means++ clustering to obtain the abstraction mapping. WEVA requires no domain knowledge, no pre-training, and incurs only a small overhead on top of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
