Communications of the ACM
Carnegie Mellon Reveals Inner Workings of Victorious AI
Carnegie Mellon University's Noam Brown and Professor Tuomas Sandholm.
Credit: University of California, San Diego
Libratus, an artificial intelligence that defeated four top professional poker players in no-limit Texas Hold'em earlier this year, uses a three-pronged approach to master a game with more decision points than atoms in the universe, researchers at Carnegie Mellon University report.
In "Superhuman AI for Heads-Up No-Limit Poker: Libratus Beats Top Professionals," published in the journal Science, Tuomas Sandholm, professor of computer science, and Noam Brown, a Ph.D. student in the Computer Science Department, detail how their AI achieved superhuman performance by breaking the game into computationally manageable parts and, based on its opponents' game play, fix potential weaknesses in its strategy during the competition.
AI programs have defeated top humans in checkers, chess, and Go — all challenging games, but ones in which both players know the exact state of the game at all times. Poker players, by contrast, contend with hidden information: what cards their opponents hold and whether an opponent is bluffing.
In a 20-day competition involving 120,000 hands at Rivers Casino in Pittsburgh this past January, Libratus became the first AI to defeat top human players at Head's-Up, No-Limit Texas Hold'em — the primary benchmark and longstanding challenge problem for imperfect-information game-solving by AIs.
Libratus beat each of the players individually in the two-player game and collectively amassed more than $1.8 million in chips. Measured in milli-big blinds per hand (mbb/hand), a standard used by imperfect-information game AI researchers, Libratus decisively defeated the humans by 147 mmb/hand. In poker lingo, this is 14.7 big blinds per game.
"The techniques in Libratus do not use expert domain knowledge or human data and are not specific to poker," Sandholm and Brown say in the paper. "Thus, they apply to a host of imperfect-information games." Such hidden information is ubiquitous in real-world strategic interactions, they note, including business negotiation, cybersecurity, finance, strategic pricing, and military applications.
Libratus includes three main modules, the first of which computes an abstraction of the game that is smaller and easier to solve than by considering all 10161 (the number 1 followed by 161 zeroes) possible decision points in the game. It then creates its own detailed strategy for the early rounds of Texas Hold'em and a coarse strategy for the later rounds. This strategy is called the blueprint strategy.
One example of these abstractions in poker is grouping similar hands together and treating them identically.
"Intuitively, there is little difference between a king-high flush and a queen-high flush," Brown says. "Treating those hands as identical reduces the complexity of the game and, thus, makes it computationally easier." In the same vein, similar bet sizes also can be grouped together.
But in the final rounds of the game, a second module constructs a new, finer-grained abstraction based on the state of play. It also computes a strategy for this subgame in real-time that balances strategies across different subgames using the blueprint strategy for guidance — something that needs to be done to achieve safe subgame solving. During the January competition, Libratus performed this computation using the Pittsburgh Supercomputing Center's Bridges computer.
When an opponent makes a move that is not in the abstraction, the module computes a solution to this subgame that includes the opponent's move. Sandholm and Brown call this nested subgame solving. DeepStack, an AI created by the University of Alberta to play Heads-Up, No-Limit Texas Hold'em, also includes a similar algorithm, called continual re-solving. DeepStack has yet to be tested against top professional players, however.
The third module is designed to improve the blueprint strategy as competition proceeds. Typically, Sandholm says, AIs use machine learning to find mistakes in the opponent's strategy and exploit them. But that also opens the AI to exploitation if the opponent shifts strategy. Instead, Libratus' self-improver module analyzes opponents' bet sizes to detect potential holes in Libratus' blueprint strategy. Libratus then adds these missing decision branches, computes strategies for them, and adds them to the blueprint.
In addition to beating the human pros, Libratus was evaluated against the best prior poker AIs. These included Baby Tartanian8, a bot developed by Sandholm and Brown that won the 2016 Annual Computer Poker Competition held in conjunction with the Association for the Advancement of Artificial Intelligence Annual Conference. Whereas Baby Tartanian8 beat the next two strongest AIs in the competition by 12 (plus/minus 10) mbb/hand and 24 (plus/minus 20) mbb/hand, Libratus bested Baby Tartanian8 by 63 (plus/minus 28) mbb/hand. DeepStack has not been tested against other AIs, the authors note.
"The techniques that we developed are largely domain independent and can thus be applied to other strategic imperfect-information interactions, including nonrecreational applications," Sandholm and Brown conclude. "Due to the ubiquity of hidden information in real-world strategic interactions, we believe the paradigm introduced in Libratus will be critical to the future growth and widespread application of AI."
The technology has been exclusively licensed to Strategic Machine Inc., a company founded by Sandholm to apply strategic reasoning technologies to many different applications.
"Safe and Nested Subgame Solving for Imperfect-Information Games," a paper by Brown and Sandholm regarding nested subgame solving, recently won a Best Paper award at the Neural Information Processing Systems (NIPS 2017) conference. Libratus received the HPCwire Reader's Choice Award for Best Use of AI at the 2017 International Conference for High Performance Computing, Networking, Storage and Analysis (SC17).
The U.S. National Science Foundation and the Army Research Office supported this research.
No entries found