Don't Predict Counterfactual Values, Predict Expected Values Instead
Jeremiasz Wolosiuk, Maciej Swiechowski, Jacek Mandziuk
摘要
Counterfactual Regret Minimization algorithms are the most popular way of estimating the Nash Equilibrium in imperfect-information zero-sum games. In particular, DeepStack -- the state-of-the-art Poker bot -- employs the so-called Deep Counterfactual Value Network (DCVN) to learn the Counterfactual Values (CFVs) associated with various states in the game. Each CFV is a multiplication of two factors: (1) the probability that the opponent would reach a given state in a game, which can be explicitly calculated from the input data, and (2) the expected value (EV) of a payoff in that state, which is a complex function of the input data, hard to calculate. In this paper, we propose a simple yet powerful modification to the CFVs estimation process, which consists in utilizing a deep neural network to estimate only the EV factor of CFV. This new target setting significantly simplifies the learning problem and leads to much more accurate CFVs estimation. A direct comparison, in terms of CFVs prediction losses, shows a significant prediction accuracy improvement of the proposed approach (DEVN) over the original DCVN formulation (relatively by 9.18-15.70% when using card abstraction, and by 3.37-8.39% without card abstraction, depending on a particular setting). Furthermore, the application of DEVN improves the theoretical lower bound of the error by 29.05-31.83% compared to the DCVN pipeline when card abstraction is applied. Additionally, DEVN is able to achieve the goal using significantly smaller, and faster to infer, networks. While the proposed modification may seem to be of a rather technical nature, it, in fact, presents a fundamentally different approach to the overall process of learning and estimating CFVs, since the distributions of the training signals differ significantly between DCVN and DEVN. The former estimates CFVs, which are biased by the probability of reaching a given game state, while training the latter relies on a direct EV estimation, regardless of the state probability. In effect, the learning signal of DEVN presents a better estimation of the true value of a given state, thus allowing more accurate CFVs estimation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Combining Deep Reinforcement Learning and Search for Imperfect-Information GamesNoam Brown, Anton Bakhtin, Adam Lerer, Qucheng GongNeurIPS 2020 · 被引用 205 次
- AlphaHoldem: High-Performance Artificial Intelligence for Heads-Up No-Limit Poker via End-to-End Reinforcement LearningEnmin Zhao, Renye Yan, Jinqiu Li, Kai Li 等AAAI 2022 · 被引用 63 次
- Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient ApproachNadav Hallak, Panayotis Mertikopoulos, Volkan CevherICML 2021 · 被引用 24 次
相关 Paper
- Deep (Predictive) Discounted Counterfactual Regret MinimizationHang Xu, Kai Li, Haobo Fu, Qiang Fu 等AAAI 2026
- Efficient Online Pruning and Abstraction for Imperfect Information Extensive-Form GamesBoning Li, Longbo HuangICLR 2025
- An Efficient Deep Reinforcement Learning Algorithm for Solving Imperfect Information Extensive-Form GamesLinjian Meng, Zhenxing Ge, Pinzhuo Tian, Bo An 等AAAI 2023 · 被引用 8 次
- Faster Game Solving via Hyperparameter SchedulesNaifeng Zhang, Stephen Marcus McAleer, Tuomas SandholmAAAI 2026 · 被引用 6 次
- Faster Game Solving via Asymmetry of Step SizesLinjian Meng, Tianpei Yang, Youzhi Zhang, Zhenxing Ge 等AAAI 2026
