Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Jonah Brown-Cohen
Observed names:
Brown-Cohen, Jonah,
Jonah Brown-cohen
Institution:
The University of Texas at Austin
Observed institutions:
Google DeepMind (United Kingdom),
Google (United Kingdom),
The University of Texas at Austin,
KTH Royal Institute of Technology,
University of California, Berkeley
ORCID:
0000-0002-4294-8671
Observed ORCID:
0000-0002-4294-8671
OpenAlex ID:
A5050009197
Scalable watermarking for identifying large language model outputs
2024
·
Sumanth Dathathri
, Abigail See
, et al.
·
Nature
·
470
PDF
On scalable oversight with weak LLMs judging strong LLMs
2024
·
Zachary Kenton
, Noah Siegel
, et al.
·
neural information processing systems
·
164
PDF
Formal Barriers to Longest-Chain Proof-of-Stake Protocols
2019
·
Jonah Brown-Cohen
, Arvind Narayanan
, et al.
·
ACM Conference on Economics and Computation (EC)
·
129
PDF
Skill-Mix: a Flexible and Expandable Family of Evaluations for AI models
2023
·
Yu, Dingli
, Kaur, Simran
, et al.
·
arXiv (Cornell University)
·
60
PDF
Scalable AI Safety via Doubly-Efficient Debate
2023
·
Brown-Cohen, Jonah
, Irving, Geoffrey
, et al.
·
arXiv (Cornell University)
·
50
PDF
Avoiding Obfuscation with Prover-Estimator Debate
2025
·
Brown-Cohen, Jonah
, Irving, Geoffrey
, et al.
·
arXiv (Cornell University)
·
31
PDF
Detecting Adversarial Directions in Deep Reinforcement Learning to Make Robust Decisions
2023
·
Korkmaz, Ezgi
, Brown-Cohen, Jonah
·
arXiv (Cornell University)
·
13
PDF
Correlation Decay and Tractability of CSPs
2016
·
Brown-Cohen, Jonah
, Raghavendra, Prasad
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
10
PDF
Quantifying the Necessity of Chain of Thought through Opaque Serial Depth
2026
·
Brown-Cohen, Jonah
, Lindner, David
, et al.
·
arXiv (Cornell University)
·
9
PDF
The matching problem has no small symmetric SDP
2015
·
Gábor Braun
, Jonah Brown-Cohen
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
8
The matching problem has no small symmetric SDP
2016
·
Gábor Braun
, Jonah Brown-Cohen
, et al.
·
Mathematical Programming
·
7
PDF
Optimal Inapproximability with Universal Factor Graphs
2021
·
Per Austrin
, Jonah Brown-Cohen
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
6
Debate Training Reduces Reward Hacking in RLAIF
2026
·
Kenton, Zachary
, Janzer, Lili
, et al.
·
arXiv (Cornell University)
·
5
PDF
Debate is efficient with your time
2026
·
Brown-Cohen, Jonah
, Irving, Geoffrey
, et al.
·
arXiv (Cornell University)
·
5
PDF
Extended Formulation Lower Bounds for Refuting Random CSPs
2019
·
Jonah Brown-Cohen
, Prasad Raghavendra
·
Society for Industrial and Applied Mathematics eBooks
·
4
PDF
Optimal Inapproximability with Universal Factor Graphs
2023
·
Per Austrin
, Jonah Brown-Cohen
, et al.
·
ACM Transactions on Algorithms
·
3
PDF
How to Have a Sensitive Debate: An Instance-Optimal Protocol for AI Debate
2026
·
Li, Jiawei
, Xun, Zhiyang
, et al.
·
arXiv (Cornell University)
PDF
Faster Algorithms and Constant Lower Bounds for the Worst-Case Expected Error
2021
·
Brown-Cohen, Jonah
·
arXiv (Cornell University)
PDF
Extended Formulation Lower Bounds for Combinatorial Optimization
2018
·
Jonah Brown-Cohen
·
UC Berkeley
Show more works
View as search
Works count:
21
Citation count:
1,090
H-index:
9
I10-index:
9
Year
Topic
Type