papersSEP 12 04:00 UTC
GPU-CFR Compiles Game Trees to Dataflow for 80x Faster Regret Minimization
A new arXiv paper presents GPU-CFR, a technique that compiles game trees into static dataflow graphs so that counterfactual regret minimization can run efficiently on GPUs. The approach uses CUDA graph replay to reduce the overhead of the many small, interdependent memory operations that previously made CPUs faster for this workload. The authors report speedups of up to 80x over existing implementations.