arxiv
PublishedSeptember 12, 2026 at 4:00 AM
—neutral
GPU-CFR: 80x Faster Counterfactual Regret Minimization by Compiling the Game to Static Dataflow and CUDA Graph Replay
Publisher summary· verbatim
arXiv:2609.11923v1 Announce Type: cross Abstract: Counterfactual regret minimization (CFR) is one of the few large numerical workloads that still runs faster on CPUs than on GPUs. Each iteration sweeps a game tree with up to billions of states in millions of small, interdependent gather and scatter
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivAn AI Security Agent for University ACMIS: Multi-Vector Threat Detection and Automated Response3harxivNavalia: Advancing Cowork Agents through Verifiable Task Synthesis and Long-Horizon Post-Training3harxivLarge language model and reinforcement learning based autonomous construction and progress updates3harxivMedPAO-Assist: Edge-Deployable, Modality-Aware Agentic AI for Radiology Report Structuring3hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗