用深度学习近似扑克概率
Approximating Poker Probabilities with Deep Learning
摘要:
许多扑克系统,无论是用数学还是机器学习创建的,都依赖于获胜的概率作为关键输入。然而,使用组合数学计算精确的概率是一个棘手的问题,所以我们近似它。蒙特卡洛模拟是一种有效的技术,可以用来近似的概率,一个球员将赢得和/或平局。然而,如果不使用内存密集型查找表或超级计算机,在训练具有自我游戏的代理时,运行数百万次是不可行的。为了克服时空权衡,我们使用深度学习来近似从蒙特卡洛模拟中获得的高精度概率。学习的模型被证明是蒙特卡罗模拟的轻量级替代方案,最终允许我们在自我游戏期间有效地使用概率作为输入。源代码和优化的神经网络可以在https://github.com/brandinho/Poker-Probability-Approximation上找到
英文摘要:
Many poker systems, whether created with heuristics or machine learning, rely on the probability of winning as a key input. However calculating the precise probability using combinatorics is an intractable problem, so instead we approximate it. Monte Carlo simulation is an effective technique that can be used to approximate the probability that a player will win and/or tie a hand. However, without the use of a memory-intensive lookup table or a supercomputer, it becomes infeasible to run millions of times when training an agent with self-play. To combat the space-time tradeoff, we use deep learning to approximate the probabilities obtained from the Monte Carlo simulation with high accuracy. The learned model proves to be a lightweight alternative to Monte Carlo simulation, which ultimately allows us to use the probabilities as inputs during self-play efficiently. The source code and optimized neural network can be found at https://github.com/brandinho/Poker-Probability-Approximation
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。