default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Brown
Person information
- affiliation: Facebook AI Research, USA
- affiliation (former): Carnegie Mellon University, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c32]Samuel Sokota, Gabriele Farina, David J. Wu, Hengyuan Hu, Kevin A. Wang, J. Zico Kolter, Noam Brown:
The Update-Equivalence Framework for Decision-Time Planning. ICLR 2024- 2023
- [c31]Anton Bakhtin, David J. Wu, Adam Lerer, Jonathan Gray, Athul Paul Jacob, Gabriele Farina, Alexander H. Miller, Noam Brown:
Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning. ICLR 2023 - [c30]Samuel Sokota, Ryan D'Orazio, J. Zico Kolter, Nicolas Loizou, Marc Lanctot, Ioannis Mitliagkas, Noam Brown, Christian Kroer:
A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games. ICLR 2023 - [c29]Samuel Sokota, Ryan D'Orazio, Chun Kai Ling, David J. Wu, J. Zico Kolter, Noam Brown:
Abstracting Imperfect Information Away from Two-Player Zero-Sum Games. ICML 2023: 32169-32193 - [i23]Samuel Sokota, Ryan D'Orazio, Chun Kai Ling, David J. Wu, J. Zico Kolter, Noam Brown:
Abstracting Imperfect Information Away from Two-Player Zero-Sum Games. CoRR abs/2301.09159 (2023) - [i22]Samuel Sokota, Gabriele Farina, David J. Wu, Hengyuan Hu, Kevin A. Wang, J. Zico Kolter, Noam Brown:
The Update Equivalence Framework for Decision-Time Planning. CoRR abs/2304.13138 (2023) - 2022
- [c28]Hugh Zhang, Adam Lerer, Noam Brown:
Equilibrium Finding in Normal-Form Games via Greedy Regret Minimization. AAAI 2022: 9484-9492 - [c27]Samuel Sokota, Hengyuan Hu, David J. Wu, J. Zico Kolter, Jakob Nicolaus Foerster, Noam Brown:
A Fine-Tuning Approach to Belief State Modeling. ICLR 2022 - [c26]Athul Paul Jacob, David J. Wu, Gabriele Farina, Adam Lerer, Hengyuan Hu, Anton Bakhtin, Jacob Andreas, Noam Brown:
Modeling Strong and Human-Like Gameplay with KL-Regularized Search. ICML 2022: 9695-9728 - [i21]Hugh Zhang, Adam Lerer, Noam Brown:
Equilibrium Finding in Normal-Form Games Via Greedy Regret Minimization. CoRR abs/2204.04826 (2022) - [i20]Samuel Sokota, Ryan D'Orazio, J. Zico Kolter, Nicolas Loizou, Marc Lanctot, Ioannis Mitliagkas, Noam Brown, Christian Kroer:
A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games. CoRR abs/2206.05825 (2022) - [i19]Hengyuan Hu, David J. Wu, Adam Lerer, Jakob N. Foerster, Noam Brown:
Human-AI Coordination via Human-Regularized Search and Learning. CoRR abs/2210.05125 (2022) - [i18]Anton Bakhtin, David J. Wu, Adam Lerer, Jonathan Gray, Athul Paul Jacob, Gabriele Farina, Alexander H. Miller, Noam Brown:
Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning. CoRR abs/2210.05492 (2022) - 2021
- [c25]Chun Kai Ling, Noam Brown:
Safe Search for Stackelberg Equilibria in Extensive-Form Games. AAAI 2021: 5541-5548 - [c24]Jonathan Gray, Adam Lerer, Anton Bakhtin, Noam Brown:
Human-Level Performance in No-Press Diplomacy via Equilibrium Search. ICLR 2021 - [c23]Hengyuan Hu, Adam Lerer, Brandon Cui, Luis Pineda, Noam Brown, Jakob N. Foerster:
Off-Belief Learning. ICML 2021: 4369-4379 - [c22]Arnaud Fickinger, Hengyuan Hu, Brandon Amos, Stuart J. Russell, Noam Brown:
Scalable Online Planning via Reinforcement Learning Fine-Tuning. NeurIPS 2021: 16951-16963 - [c21]Anton Bakhtin, David J. Wu, Adam Lerer, Noam Brown:
No-Press Diplomacy from Scratch. NeurIPS 2021: 18063-18074 - [i17]Chun Kai Ling, Noam Brown:
Safe Search for Stackelberg Equilibria in Extensive-Form Games. CoRR abs/2102.01775 (2021) - [i16]Hengyuan Hu, Adam Lerer, Brandon Cui, Luis Pineda, David J. Wu, Noam Brown, Jakob N. Foerster:
Off-Belief Learning. CoRR abs/2103.04000 (2021) - [i15]Hengyuan Hu, Adam Lerer, Noam Brown, Jakob N. Foerster:
Learned Belief Search: Efficiently Improving Policies in Partially Observable Settings. CoRR abs/2106.09086 (2021) - [i14]Arnaud Fickinger, Hengyuan Hu, Brandon Amos, Stuart Russell, Noam Brown:
Scalable Online Planning via Reinforcement Learning Fine-Tuning. CoRR abs/2109.15316 (2021) - [i13]Anton Bakhtin, David J. Wu, Adam Lerer, Noam Brown:
No-Press Diplomacy from Scratch. CoRR abs/2110.02924 (2021) - [i12]Athul Paul Jacob, David J. Wu, Gabriele Farina, Adam Lerer, Anton Bakhtin, Jacob Andreas, Noam Brown:
Modeling Strong and Human-Like Gameplay with KL-Regularized Search. CoRR abs/2112.07544 (2021) - 2020
- [c20]Adam Lerer, Hengyuan Hu, Jakob N. Foerster, Noam Brown:
Improving Policies via Search in Cooperative Partially Observable Games. AAAI 2020: 7187-7194 - [c19]Noam Brown, Anton Bakhtin, Adam Lerer, Qucheng Gong:
Combining Deep Reinforcement Learning and Search for Imperfect-Information Games. NeurIPS 2020 - [i11]Eric Steinberger, Adam Lerer, Noam Brown:
DREAM: Deep Regret minimization with Advantage baselines and Model-free learning. CoRR abs/2006.10410 (2020) - [i10]Ryan Zarick, Bryan Pellegrino, Noam Brown, Caleb Banister:
Unlocking the Potential of Deep Counterfactual Value Networks. CoRR abs/2007.10442 (2020) - [i9]Noam Brown, Anton Bakhtin, Adam Lerer, Qucheng Gong:
Combining Deep Reinforcement Learning and Search for Imperfect-Information Games. CoRR abs/2007.13544 (2020) - [i8]Jonathan Gray, Adam Lerer, Anton Bakhtin, Noam Brown:
Human-Level Performance in No-Press Diplomacy via Equilibrium Search. CoRR abs/2010.02923 (2020)
2010 – 2019
- 2019
- [c18]Noam Brown, Tuomas Sandholm:
Solving Imperfect-Information Games via Discounted Regret Minimization. AAAI 2019: 1829-1836 - [c17]Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm:
Deep Counterfactual Regret Minimization. ICML 2019: 793-802 - [c16]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. ICML 2019: 1853-1862 - [i7]Gabriele Farina, Christian Kroer, Noam Brown, Tuomas Sandholm:
Stable-Predictive Optimistic Counterfactual Regret Minimization. CoRR abs/1902.04982 (2019) - [i6]Adam Lerer, Hengyuan Hu, Jakob N. Foerster, Noam Brown:
Improving Policies via Search in Cooperative Partially Observable Games. CoRR abs/1912.02318 (2019) - 2018
- [j1]Bruno Bouchard
, Kevin Bouchard, Noam Brown, Niyati Chhaya, Eitan Farchi, Sébastien Gaboury, Christopher W. Geib, Amelie Gyrard, Kokil Jaidka, Sarah Keren, Roni Khardon, Parisa Kordjamshidi, David R. Martinez, Nicholas Mattei, Martin Michalowski, Reuth Mirsky, Joseph C. Osborn, Cem Sahin, Onn Shehory, Arash Shaban-Nejad, Amit P. Sheth, Ilan Shimshoni, Howard E. Shrobe, Arunesh Sinha, Atanu R. Sinha, Biplav Srivastava, William W. Streilein, Georgios Theocharous, Kristen Brent Venable, Neal Wagner, Anna Zamansky:
Reports of the Workshops of the 32nd AAAI Conference on Artificial Intelligence. AI Mag. 39(4): 45-56 (2018) - [c15]Noam Brown, Tuomas Sandholm, Brandon Amos:
Depth-Limited Solving for Imperfect-Information Games. NeurIPS 2018: 7674-7685 - [i5]Noam Brown, Tuomas Sandholm, Brandon Amos:
Depth-Limited Solving for Imperfect-Information Games. CoRR abs/1805.08195 (2018) - [i4]Noam Brown, Tuomas Sandholm:
Solving Imperfect-Information Games via Discounted Regret Minimization. CoRR abs/1809.04040 (2018) - [i3]Noam Brown, Adam Lerer, Sam Gross, Tuomas Sandholm:
Deep Counterfactual Regret Minimization. CoRR abs/1811.00164 (2018) - 2017
- [c14]Noam Brown, Christian Kroer, Tuomas Sandholm:
Dynamic Thresholding and Pruning for Regret Minimization. AAAI 2017: 421-429 - [c13]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. AAAI Workshops 2017 - [c12]Noam Brown, Tuomas Sandholm:
Safe and Nested Endgame Solving for Imperfect-Information Games. AAAI Workshops 2017 - [c11]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Pruning. ICML 2017: 596-604 - [c10]Noam Brown, Tuomas Sandholm:
Libratus: The Superhuman AI for No-Limit Poker. IJCAI 2017: 5226-5228 - [c9]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. NIPS 2017: 689-699 - [i2]Noam Brown, Tuomas Sandholm:
Safe and Nested Subgame Solving for Imperfect-Information Games. CoRR abs/1705.02955 (2017) - 2016
- [c8]Noam Brown, Tuomas Sandholm:
Strategy-Based Warm Starting for Regret Minimization in Games. AAAI 2016: 432-438 - [c7]Noam Brown, Tuomas Sandholm:
Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition. IJCAI 2016: 4238-4239 - [i1]Noam Brown, Tuomas Sandholm:
Reduced Space and Faster Convergence in Imperfect-Information Games via Regret-Based Pruning. CoRR abs/1609.03234 (2016) - 2015
- [c6]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Tartanian7: A Champion Two-Player No-Limit Texas Hold'em Poker-Playing Program. AAAI 2015: 4270-4271 - [c5]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAAI Workshop: Computer Poker and Imperfect Information 2015 - [c4]Noam Brown, Sam Ganzfried, Tuomas Sandholm:
Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent. AAMAS 2015: 7-15 - [c3]Noam Brown, Tuomas Sandholm:
Simultaneous Abstraction and Equilibrium Finding in Games. IJCAI 2015: 489-496 - [c2]Noam Brown, Tuomas Sandholm:
Regret-Based Pruning in Extensive-Form Games. NIPS 2015: 1972-1980 - 2014
- [c1]Noam Brown, Tuomas Sandholm:
Regret Transfer and Parameter Optimization. AAAI 2014: 594-601
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-08 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
