Sotabase

Career

· Director, Princeton Language and Intelligence, Princeton University2023–
· Visiting Professor, Weizmann Institute2007–2007
· Visiting Researcher, Microsoft Research2006–2007
· Charles C. Fitzmorris Professor of Computer Science, Princeton University2003–
· Visiting Associate Professor, UC Berkeley2001–2002
· Associate Professor, Princeton University1999–2003
· Assistant Professor, Princeton University1994–1999
· PhD in Computer Science, University of California, Berkeley1990–1994
· SB in Mathematics with Computer Science, Massachusetts Institute of Technology1986–1990

Publications (762)

Proof verification and hardness of approximation problems
Proceedings., 33rd Annual Symposium on Foundations of Computer Science · 1992
2,297
cited
Probabilistic checking of proofs: a new characterization of NP
JACM · 1998
1,404
cited
A Simple but Tough-to-Beat Baseline for Sentence Embeddings
International Conference on Learning Representations · 2017
1,382
cited
Ledipasvir and sofosbuvir for previously treated HCV genotype 1 infection.
New England Journal of Medicine · 2014
1,360
cited
The Multiplicative Weights Update Method: a Meta-Algorithm and Applications
Theory of Computing · 2012
1,142
cited
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
JACM · 1998
1,140
cited
Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networks
International Conference on Machine Learning · 2019
1,030
cited
Outcomes of treatment for hepatitis C virus infection by primary care providers.
New England Journal of Medicine · 2011
1,027
cited
On Exact Computation with an Infinitely Wide Neural Net
Neural Information Processing Systems · 2019
997
cited
Generalization and Equilibrium in Generative Adversarial Nets (GANs)
International Conference on Machine Learning · 2017
712
cited
Stronger generalization bounds for deep nets via a compression approach
International Conference on Machine Learning · 2018
687
cited
Expander flows, geometric embeddings and graph partitioning
Symposium on the Theory of Computing · 2004
671
cited
Implicit Regularization in Deep Matrix Factorization
Neural Information Processing Systems · 2019
565
cited
The shocking cost of turnover in health care.
Health Care Management Review · 2010
552
cited
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
Proceedings of 37th Conference on Foundations of Computer Science · 1996
543
cited
On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization
International Conference on Machine Learning · 2018
530
cited
The hardness of approximate optima in lattices, codes, and systems of linear equations
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science · 1993
517
cited
A Practical Algorithm for Topic Modeling with Provable Guarantees
International Conference on Machine Learning · 2012
454
cited
Learning Topic Models -- Going beyond SVD
IEEE Annual Symposium on Foundations of Computer Science · 2012
452
cited
Polynomial time approximation schemes for dense instances of NP-hard problems
Symposium on the Theory of Computing · 1995
441
cited
Sotabase