Research Post
Abstract: Games have a long history of serving as a benchmark for progress in artificial intelligence. Recently, approaches using search and learning have shown strong performance across a set of perfect information games, and approaches using game-theoretic reasoning and learning have shown strong performance for specific imperfect information poker variants. We introduce Player of Games, a general-purpose algorithm that unifies previous approaches, combining guided search, self-play learning, and game-theoretic reasoning. Player of Games is the first algorithm to achieve strong empirical performance in large perfect and imperfect information games -- an important step towards truly general algorithms for arbitrary environments. We prove that Player of Games is sound, converging to perfect play as available computation time and approximation capacity increases. Player of Games reaches strong performance in chess and Go, beats the strongest openly available agent in heads-up no-limit Texas hold'em poker (Slumbot), and defeats the state-of-the-art agent in Scotland Yard, an imperfect information game that illustrates the value of guided search, learning, and game-theoretic reasoning.
Aug 8th 2022
Research Post
Read this research paper co-authored by Canada CIFAR AI Chair Angel Chang: Learning Expected Emphatic Traces for Deep RL
Jul 22nd 2022
Research Post
Read this research paper, co-authored by Canada CIFAR AI Chair Angel Chang: D3Net: A Unified Speaker-Listener Architecture for 3D Dense Captioning and Visual Grounding
Jul 7th 2022
Research Post
Read this research paper, co-authored by Fellow & Canada CIFAR AI Chair Russ Greiner: Prediction of Obsessive-Compulsive Disorder: Importance of neurobiology-aided feature design and cross-diagnosis transfer learning
Looking to build AI capacity? Need a speaker at your event?