Noam Brown

Noam Brown

Auto-generated profile, based on publicly available information

Noam Brown

Computer Science Department Carnegie Mellon University

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 August 2019 in Science
Verified
Journal Article
Closed access
PDF file
NBNoam Brown
Noam Brown
TSTuomas Sandholm
Tuomas Sandholm
AI now masters six-player poker: Computer programs have shown superiority over humans in two-player games such as chess, Go, and heads-up, no-limit Texas hold'em poker. However, poker games usually include six players—a much trickier challenge for artificial intelligence than the two-player variant. Brown and Sandholm developed a program, dubbed Pluribus, that learned how to play six-player no-limit Texas hold'em by playing against five copies of itself (see the Perspective by Blair and Saffidine). When pitted against five elite professional poker players, or with five copies of Pluribus playing against one professional, the computer performed significantly better than humans over the course of 10,000 hands of poker. Science , this issue p. 885 ; see also p. 864

26 January 2018 in Science
Verified
Journal Article
Closed access
PDF file
NBNoam Brown
Noam Brown
TSTuomas Sandholm
Tuomas Sandholm
Libratus versus humans: Pitting artificial intelligence (AI) against top human players demonstrates just how far AI has come. Brown and Sandholm built a poker-playing AI called Libratus that decisively beat four leading human professionals in the two-player variant of poker called heads-up no-limit Texas hold'em (HUNL). Over nearly 3 weeks, Libratus played 120,000 hands of HUNL against the human professionals, using a three-pronged approach that included precomputing an overall strategy, adapting the strategy to actual gameplay, and learning from its opponent. Science , this issue p. 418

9 December 2022 in Science
Verified
Journal Article
Closed access
M(Meta Fundamental AI Research Diplomacy Team (FAIR)†
Meta Fundamental AI Research Diplomacy Team (FAIR)†
ABAnton Bakhtin
Anton Bakhtin
NBNoam Brown
Noam Brown
EDEmily Dinan
Emily Dinan
GFGabriele Farina
Gabriele Farina
MZMarkus Zijlstra
Markus Zijlstra
Despite much progress in training artificial intelligence (AI) systems to imitate human language, building agents that use language to communicate intentionally with humans in interactive environments remains a major challenge. We introduce Cicero, the first AI agent to achieve human-level performance inDiplomacy, a strategy game involving both cooperation and competition that emphasizes natural language negotiation and tactical coordination between seven players. Cicero integrates a language model with planning and reinforcement learning algorithms by inferring players’ beliefs and intentions from its conversations and generating dialogue in pursuit of its plans. Across 40 games of an anonymous onlineDiplomacyleague, Cicero achieved more than double the average score of the human players and ranked in the top 10% of participants who played more than one game.

17 November 2017 in arXiv
Verified
Preprint
Open access
PDF file
NBNoam Brown
Noam Brown
TSTuomas Sandholm
Tuomas Sandholm
In imperfect-information games, the optimal strategy in a subgame may depend on the strategy in other, unreached subgames. Thus a subgame cannot be solved in isolation and must instead consider the strategy for the entire game as a whole, unlike perfect-information games. Nevertheless, it is possible to first approximate a solution for the whole game and then improve it by solving individual subgames. This is referred to as subgame solving. We introduce subgame-solving techniques that outperform prior methods both in theory and practice. We also show how to adapt them, and past subgame-solving techniques, to respond to opponent actions that are outside the original action abstraction; this significantly outperforms the prior state-of-the-art approach, action translation. Finally, we show that subgame solving can be repeated as the game progresses down the game tree, leading to far lower exploitability. These techniques were a key component of Libratus, the first AI to defeat top humans in heads-up no-limit Texas hold'em poker.

21 May 2018 in arXiv
Verified
Preprint
Open access
PDF file
NBNoam Brown
Noam Brown
TSTuomas Sandholm
Tuomas Sandholm
BABrandon Amos
Brandon Amos
A fundamental challenge in imperfect-information games is that states do not have well-defined values. As a result, depth-limited search algorithms used in single-agent settings and perfect-information games do not apply. This paper introduces a principled way to conduct depth-limited solving in imperfect-information games by allowing the opponent to choose among a number of strategies for the remainder of the game at the depth limit. Each one of these strategies results in a different set of values for leaf nodes. This forces an agent to be robust to the different strategies an opponent may employ. We demonstrate the effectiveness of this approach by building a master-level heads-up no-limit Texas hold'em poker AI that defeats two prior top agents using only a 4-core CPU and 16 GB of memory. Developing such a powerful agent would have previously required a supercomputer.

21 February 2019 in arXiv
Verified
Preprint
Open access
PDF file
NBNoam Brown
Noam Brown
TSTuomas Sandholm
Tuomas Sandholm
Counterfactual regret minimization (CFR) is a family of iterative algorithms that are the most popular and, in practice, fastest approach to approximately solving large imperfect-information games. In this paper we introduce novel CFR variants that 1) discount regrets from earlier iterations in various ways (in some cases differently for positive and negative regrets), 2) reweight iterations in various ways to obtain the output strategies, 3) use a non-standard regret minimizer and/or 4) leverage "optimistic regret matching". They lead to dramatically improved performance in many settings. For one, we introduce a variant that outperforms CFR+, the prior state-of-the-art algorithm, in every game tested, including large-scale realistic settings. CFR+ is a formidable benchmark: no other algorithm has been able to outperform it. Finally, we show that, unlike CFR+, many of the important new variants are compatible with modern imperfect-information-game pruning techniques and one is also compatible with sampling in the game tree.