Towards Provable Bounds for Machine Learning – Lecture 4


December 21, 2012



Sanjeev Arora

Sanjeev Arora received his PhD from UC Berkeley in 1994, and since then has been a faculty member at the Computer Science department at Princeton University. His research interests include complexity theory (especially probabilistically checkable proofs), computing approximate solutions to NP-hard problems, and geometric embeddings of finite metric spaces.