Sanjeev Arora

Sanjeev Arora is the Charles C. Fitzmorris Professor in the Department of Computer Science at Princeton University, where he has been since 1994. He earned his Ph.D. from UC Berkeley in 1994 and holds a B.S. in Math with Computer Science from MIT. His research focuses on Machine Learning Theory, Natural Language Processing, and Computational Complexity.

• Education
  • SB in Math with Computer Science, MIT (1990)
  • PhD in Computer Science, UC Berkeley (1994)

Recent research explores emergence of skill compositionality in LLMs, context-enhanced learning, and provably safe AI techniques. His lab has published 15 papers since 2023 on topics like automated theorem proving, visual reasoning, and mathematical reasoning in AI.

Key scientific awards include:

• Fulkerson Prize (2012)
• ACM Prize in Computing (2011)
• Twin Gödel Prizes (2001, 2010)
• Packard Fellowship (1997)
• ACM Doctoral Dissertation Award (1995)

He has advised numerous Ph.D. students including Subhash Khot and Tengyu Ma, and led the NSF-funded Center for Computational Intractability (2008-13). His work spans approximation algorithms, probabilistically checkable proofs, and AI model interpretability.