Ryan O'Donnell
Artificial Intelligence · 2003–2015
A researcher in the Science corpus: 4 papers; trusts 4 researchers and is trusted by 7 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 17 citations into it; #25,165 of 35,345 by trust here, #23,077 by citations
- Computational Theory and Mathematics — 11 citations into it; #5,794 of 12,182 by trust here, #2,565 by citations
Whom Ryan O'Donnell trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Adam R. Klivans
- Subhash Khot
- Rocco A. Servedio
- Leslie G. Valiant
- Dan A. Simovici
- Dana Angluin
- R. Beigel
- Harry Buhrman
- David Haussler
- Guy Kindler
Who trusts Ryan O'Donnell overall
- Guang Hao Low
- Elchanan Mossel
- Subhash Khot
- Oded Goldreich
- Isaac L. Chuang
- Adam Tauman Kalai
- Adam R. Klivans
- Hsin-Yuan Huang
- Zeyuan Allen-Zhu
- Badih Ghazi
Papers from Ryan O'Donnell's perspective
Ordered by how strongly the researchers Ryan O'Donnell trusts endorse each paper. Same corpus, a different order for every researcher.
- A theory of the learnable
- Toward efficient agnostic learning
- Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications
- Perceptrons
- On the power of unique 2-prover 1-round games (Proceedings 17th IEEE Annual Conference on Computational Complexity)
- Agnostically learning halfspaces (IEEE Annual Symposium on Foundations of Computer Science)
- Hardness of Learning Halfspaces with Noise
- On Agnostic Learning of Parities, Monomials, and Halfspaces
- Reducibility Among Combinatorial Problems
- Some optimal inapproximability results
Their papers
- New degree bounds for polynomial threshold functions (2003) — 83 citations
- Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? (2004) — 885 citations
- Efficient quantum tomography (2015) — 338 citations
- Hardness results for agnostically learning low-degree polynomial threshold functions (2010) — 26 citations