博弈论和AI研究者终于有了加速CFR的实用方案——GPU并行化让求解速度提升万倍，做不完美信息博弈的团队可以直接用这个框架改造现有算法。
这篇论文提出了一种将反事实遗憾最小化（CFR）算法并行化的通用框架，通过将CFR重新表述为一系列线性代数运算，从而利用现有的并行线性代数技术加速。实验表明，在GPU上实现的CFR比Google DeepMind的OpenSpiel库在CPU上的实现快高达四个数量级。该框架还适用于CFR+、折扣CFR和预测变体等最先进的表格型CFR算法。这项工作填补了并行化在博弈求解领域应用的空白，有望大幅加速大型不完美信息博弈的求解。
Parallelizing Counterfactual Regret Minimization
Parallelization has played an instrumental role in the field of artificial intelligence (AI), drastically reducing the time taken to train and evaluate large AI models. In contrast to its impact in the broader field of AI, applying parallelization to computational game solving is relatively unexplored, despite its great potential. In this paper, we parallelize the family of counterfactual regret minimization (CFR) algorithms, which were central to important breakthroughs for solving large imperfect-information games. We present a generalized parallelization framework, reframing CFR as a series of linear algebra operations. Then, existing techniques for parallelizing linear algebra operations can be applied to accelerate CFR. We also describe how our technique can be applied to other tabular members of the CFR family of algorithms, including the state-of-the-art, such as CFR+, discounted CFR, and predictive variants of CFR. Experimentally, we show that our CFR implementation on a GPU is up to four orders of magnitude faster than Google DeepMind OpenSpiel's CFR implementations on a CPU.