Noam Brown
Noam Brown | |
|---|---|
| Education | Rutgers University (BA) Carnegie Mellon University (MS, PhD) |
| Occupation | Computer scientist |
| Employer(s) | OpenAI (2023–present) Facebook AI Research (2018–2023) |
| Known for | Libratus Pluribus CICERO o1 |
| Awards | Marvin Minsky Medal (2019) NeurIPS Best Paper Award (2017) MIT Technology Review Innovators Under 35 (2019) |
| Scientific career | |
| Tuomas Sandholm | |
Noam Brown is a computer scientist and artificial intelligence researcher whose work has focused on strategic reasoning, imperfect-information games, reinforcement learning, and reasoning in large language models.[1] He developed Libratus (2017) and Pluribus (2019) with Thomas Sandholm, the first artificial intelligence systems to defeat top human professionals in heads-up and multiplayer no-limit Texas hold 'em, respectively.[2][3] He later helped develop CICERO (2022), an AI system that achieved human-level performance in the strategy game Diplomacy.[4]
Since 2023, Brown has been a research scientist at OpenAI, where he was a foundational contributor to the research behind the reasoning model o1 and has worked on test-time scaling and multi-agent systems.[1][5]
Early life and education
[edit]Brown attended Rutgers University, where he earned a Bachelor of Arts in mathematics and computer science in 2008, graduating summa cum laude as a member of the Rutgers College Honors Program.[6]
From 2006 to 2010, Brown worked in algorithmic trading at MJM Trading Group in New York, before joining the Federal Reserve Board of Governors as a research assistant from 2010 to 2012, where he studied algorithmic trading in financial markets.[6][7]
In 2012, Brown enrolled at Carnegie Mellon University, earning a master's degree in robotics in 2014 under the supervision of Sandholm, before continuing into the doctoral program in computer science.[6][8] He completed his PhD in 2020 with the dissertation Equilibrium Finding for Large Adversarial Imperfect-Information Games, also supervised by Sandholm, which built on the algorithms he had developed for Libratus and Pluribus.[8] The dissertation received the Carnegie Mellon School of Computer Science Distinguished Dissertation Award, the AAAI/ACM SIGAI Dissertation Award, and the International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS) Victor Lesser Distinguished Dissertation Award, all in 2020.[6][9] He spent part of his graduate studies as a research intern at DeepMind in London in 2017.[6]
Career
[edit]Carnegie Mellon University: Libratus and Pluribus
[edit]As a graduate student in Sandholm's research group, Brown worked on computational game theory and equilibrium-finding algorithms for large adversarial games, building on the group's earlier poker programs, including Tartanian7 and Claudico.[6] In January 2017, Libratus became the first computer program to defeat top professional players in heads-up no-limit Texas hold 'em, beating four professionals—Dong Kim, Jason Les, Jimmy Chou, and Daniel McAulay—over 120,000 hands in a 20-day competition at Rivers Casino in Pittsburgh, "Brains vs. Artificial Intelligence: Upping the Ante," and winning by more than $1.76 million in chips.[2] A paper describing Libratus, co-authored by Brown and Sandholm, was published in Science in 2018.[10] A related paper, "Safe and Nested Subgame Solving for Imperfect-Information Games," describing a core technique behind Libratus, received a Best Paper Award at NeurIPS 2017.[11]
In July 2019, while completing his PhD and concurrently working as a research scientist at Facebook AI Research, Brown and Sandholm unveiled Pluribus, an AI that defeated elite professionals at six-player no-limit Texas hold 'em. Unlike heads-up poker, six-player poker is not a two-player zero-sum game, so many of the theoretical guarantees available for two-player games do not directly apply.[3] In one experiment, professionals Darren Elias and Chris Ferguson each played 5,000 hands as the sole human against five independent copies of Pluribus; in another, one copy of Pluribus played 10,000 hands against five professionals at a time, drawn from a pool of thirteen. Pluribus was profitable in both settings.[12] The result was published as the cover article of Science and was named one of nine runners-up for the journal's Breakthrough of the Year for 2019.[6]
Facebook AI Research: CICERO
[edit]Brown joined Facebook AI Research (FAIR) in 2018, initially continuing his poker research.[6] At FAIR he later worked on systems combining strategic planning with natural-language interaction. In November 2022, Brown was part of the Meta FAIR Diplomacy team that introduced CICERO, described in its Science publication as the first AI agent to achieve human-level performance in Diplomacy, a seven-player strategy game that requires natural-language negotiation and tactical coordination between cooperation and competition.[4] CICERO integrated a language model with planning and reinforcement-learning components that inferred other players' beliefs and intentions from their conversations and generated dialogue in pursuit of its plans.[4] Playing anonymously against humans on the online platform webDiplomacy.net across 40 games, it achieved more than double the average score of human participants and ranked in the top 10 percent of players who had played more than one game.[13]
OpenAI: reasoning models and multi-agent systems
[edit]Brown joined OpenAI as a research scientist in 2023.[6] At OpenAI, Brown describes himself as a foundational contributor to the reasoning research that led to o1, which was released in September 2024 and had been developed internally under the codename "Strawberry."[1][14] TechCrunch has independently described him as one of the model's architects.[5]
Brown has argued that increasing computation at inference ("test") time can produce substantial performance gains without proportionally increasing model size or training compute.[15] In an October 2024 talk at the TEDAI conference in San Francisco, he cited an earlier poker experiment in which extending a bot's "thinking" time by roughly 20 seconds produced a performance improvement that he compared to scaling model size and training compute by a factor of about 100,000.[16]
Brown subsequently worked on multi-agent systems as a means of scaling inference-time computation in parallel, and in late 2024 he publicly announced that OpenAI was expanding a research team in this area.[17] In March 2025, TechCrunch described Brown as leading AI-reasoning research at OpenAI.[5]
In September 2026, OpenAI announced that an internal, unreleased model operating through roughly 10,000 coordinating agents had produced a proposed resolution of the Navier–Stokes existence and smoothness problem, one of the Millennium Prize Problems, finding a construction exhibiting finite-time blowup. The result was formally checked using the Lean proof assistant but had not, as of the announcement, been independently peer-reviewed.[18][19] Brown, who works on OpenAI's multi-agent research, said afterward that he would attribute little of the result to the multi-agent architecture itself, pointing instead to the strength of the underlying model, and that OpenAI had not yet run controlled experiments at that scale to isolate the contribution of coordination among agents.[20][21]
Awards and honors
[edit]- Marvin Minsky Medal for Outstanding Achievements in AI, International Joint Conference on Artificial Intelligence (2019), shared with Tuomas Sandholm, for the development of Libratus[7]
- MIT Technology Review 35 Innovators Under 35, Visionary category (2019)[22]
- NeurIPS Best Paper Award (2017), for "Safe and Nested Subgame Solving for Imperfect-Information Games"[11]
- AAAI/ACM SIGAI Dissertation Award (2020)[6]
- IFAAMAS Victor Lesser Distinguished Dissertation Award (2020)[9]
- Carnegie Mellon School of Computer Science Distinguished Dissertation Award (2020)[6]
- Allen Newell Award for Research Excellence, Carnegie Mellon University (2017)[6]
- Open Philanthropy AI Fellowship (2018)[6]
Selected publications
[edit]- Brown, Noam; Sandholm, Tuomas (2017). "Safe and Nested Subgame Solving for Imperfect-Information Games." Advances in Neural Information Processing Systems 30 (NeurIPS).
- Brown, Noam; Sandholm, Tuomas (2018). "Superhuman AI for heads-up no-limit poker: Libratus beats top professionals." Science 359 (6374): 418–424.
- Brown, Noam; Lerer, Adam; Gross, Sam; Sandholm, Tuomas (2019). "Deep Counterfactual Regret Minimization." Proceedings of the 36th International Conference on Machine Learning (ICML).
- Brown, Noam; Sandholm, Tuomas (2019). "Superhuman AI for multiplayer poker." Science 365 (6456): 885–890.
- Brown, Noam; Bakhtin, Anton; Lerer, Adam; Gong, Qucheng (2020). "Combining Deep Reinforcement Learning and Search for Imperfect-Information Games." Advances in Neural Information Processing Systems 33 (NeurIPS).
- Meta Fundamental AI Research Diplomacy Team (FAIR); Bakhtin, Anton; Brown, Noam; et al. (2022). "Human-level play in the game of Diplomacy by combining language models with strategic reasoning." Science 378 (6624): 1067–1074.
See also
[edit]References
[edit]- 1 2 3 "Noam Brown". Retrieved 2026-09-22.
- 1 2 Spice, Byron (2017-01-31). "Carnegie Mellon Artificial Intelligence Beats Top Poker Pros". Carnegie Mellon University. Retrieved 2026-09-22.
- 1 2 Brown, Noam; Sandholm, Tuomas (2019). "Superhuman AI for multiplayer poker". Science. 365 (6456): 885–890. doi:10.1126/science.aay2400.
- 1 2 3 Meta Fundamental AI Research Diplomacy Team (FAIR); et al. (2022). "Human-level play in the game of Diplomacy by combining language models with strategic reasoning". Science. 378 (6624): 1067–1074. doi:10.1126/science.ade9097.
- 1 2 3 "OpenAI research lead Noam Brown thinks certain AI 'reasoning' models could've arrived decades ago". TechCrunch. 2025-03-19. Retrieved 2026-09-22.
- 1 2 3 4 5 6 7 8 9 10 11 12 13 "Curriculum Vitae" (PDF). Noam Brown. Retrieved 2026-09-22.
- 1 2 Spice, Byron (2018-11-06). "CSD's Sandholm, Brown To Receive Minsky Medal". Carnegie Mellon University. Retrieved 2026-09-22.
- 1 2 "Noam Brown | Carnegie Mellon University Computer Science Department". Carnegie Mellon University. Retrieved 2026-09-22.
- 1 2 "Dissertation Award". International Foundation for Autonomous Agents and Multiagent Systems. Retrieved 2026-09-22.
- ↑ Brown, Noam; Sandholm, Tuomas (2018). "Superhuman AI for heads-up no-limit poker: Libratus beats top professionals". Science. 359 (6374): 418–424. doi:10.1126/science.aao1733.
- 1 2 "Safe and Nested Subgame Solving for Imperfect-Information Games". NeurIPS. Retrieved 2026-09-22.
- ↑ "Bet On The Bot: AI Beats The Professionals At 6-Player Texas Hold 'Em". NPR. 2019-07-11. Retrieved 2026-09-22.
- ↑ "Cicero: An AI agent that negotiates, persuades, and cooperates with people". Meta AI. Retrieved 2026-09-22.
- ↑ "Noam Brown, Ilge Akkaya & Hunter Lightman of OpenAI's o1 Research Team on Teaching LLMs to Reason Better by Thinking Longer". Sequoia Capital. Retrieved 2026-09-22.
- ↑ "AI won't plateau — if we give it time to think". TED. October 2024. Retrieved 2026-09-22.
- ↑ "OpenAI and Others Seek New Path to Smarter AI as Current Methods Hit Limitations". Retrieved 2026-09-22.
- ↑ "What comes after o1: OpenAI builds multi-agent research team". The Decoder. Retrieved 2026-09-22.
- ↑ "AI Has Solved One of Math's $1 Million Millennium Prize Problems". Quanta Magazine. 2026-09-08. Retrieved 2026-09-22.
- ↑ "OpenAI claims huge maths breakthrough on a famed 'Millennium Problem'". Nature. 2026-09-08. Retrieved 2026-09-22.
- ↑ "Noam Brown – Agent swarms, alignment, & recursive self-improvement". Dwarkesh Podcast. Retrieved 2026-09-22.
- ↑ "OpenAI claims 10,000 of its AI agents solved one of mathematics' hardest problems in 88 hours". TechSpot. Retrieved 2026-09-22.
- ↑ Spice, Byron (2019-06-25). "Noam Brown Named MIT Technology Review 2019 Innovator Under 35". Carnegie Mellon University. Retrieved 2026-09-22.