Prof. Sanjeev Arora

Sanjeev Arora is a theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem. More recently he works on theory of machine learning, especially deep learning. Currently the Charles C. Fitzmorris Professor in Computer Science and a visiting Professor of Mathematics at the Institute for Advanced Study, he joined Princeton in 1994 after earning his doctorate from the University of California, Berkeley.

Professor Arora’s honors include the D.R. Fulkerson Prize in Discrete Mathematics (awarded by the American Mathematical Society and Math Optimization Society) in 2012, the ACM-Infosys Foundation Award in the Computing Sciences in the same year, the Best paper award from IEEE Foundations of Computer Science in 2010, and the EATCS-SIGACT Gödel Prize (co-winner), in 2001 and 2010. He was appointed a Simons Foundation investigator in 2012, and was elected an ACM fellow in 2009. In 2012 he became a Simons Investigator and he was elected to the National Academy of Sciences on May 2, 2018.