Tengyu Ma is currently a fourth-year graduate student at Princeton University, advised by Prof. Sanjeev Arora. He received his BS in Computer Science from Tsinghua University in 2012. He won the Simons Award for Graduate Students in Theoretical Computer Science, IBM Ph.D. Fellowship, Wu Prize for Excellence, and Dodds Fellowship. Before his Ph.D. career, he obtained 8th Place in the Putnam Mathematical Competition and a silver medal in the International Mathematical Olympic (IMO). Ma’s research seeks to develop efficient algorithms with provable guarantees for machine learning problems. His research papers contribute to the areas and topics including non-convex optimization, deep learning, natural language processing, distributed optimization, convex relaxation (e.g. sum of squares hierarchy), and control theory. He has interned at Google and Microsoft Research.