Tengyu Ma is currently a fourth year graduate student at Princeton University, advised by Professor Sanjeev Arora. He received the Simons Award for Graduate Students in Theoretical Computer Science in 2014, and an IBM PhD Fellowship in 2015. Ma’s work seeks to develop efficient algorithms with provable guarantees for machine learning problems. His research interests include non-convex optimization, deep learning, natural language processing, distributed optimization, and convex relaxation (e.g. sum of squares hierarchy) for machine learning problems.