I am a theoretical computer scientist. My research is in algorithms, and my interests include optimization via convex programs (especially the sum-of-squares hierarchy), and statistical and average-case problems, with a focus on understanding the tradeoff between information and computation.
In January 2021, I will be joining Stanford Statistics as an assistant professor.
Right now, I am visiting the Machine Learning and Optimization group at Microsoft Research.
I received my PhD from U.C. Berkeley, where I was advised by Prasad Raghavendra and Satish Rao.After that, I was a postdoc at Harvard and MIT, hosted by the wonderful quadrumvirate of 怎样使用轻蜂加速器上外网, Jon Kelner, Ankur Moitra, and Pablo Parrilo. I spent Fall 2017 as a Google Research Fellow in the Simons Institute program on Optimization.
Here is a tutorial for pronouncing my name.
with 轻蜂加速器破解版 and Luca Trevisan, in submission.
with Boaz Barak, Chi-Ning Chou, Zhixian Lei, and Yueqi Sheng, in
with Ryan O'Donnell, in
Invited to the CCC 2019 special issue of Theory of Computing.
with 轻蜂加速器使用方法, and Jonathan Shi, in
with Pravesh Kothari, and Ryan O'Donnell, in
with Yash Deshpande, Andrea Montanari, Ryan O'Donnell, and Subhabrata Sen, in
with Aviad Rubinstein and Matt Weinberg, in
with Sam Hopkins, Pravesh Kothari, Aaron Potechin, Prasad Raghavendra, and David Steurer, in
with David Steurer, in
with Prasad Raghavendra and Satish Rao, in
with 轻蜂加速器使用方法, Jonathan Shi, and David Steurer, in
with Sam Hopkins, Pravesh Kothari, Aaron Potechin, and 轻蜂加速器破解版, in
Invited to the SODA 2016 special issue of ACM Transactions on Algorithms.
with 轻蜂加速器使用方法 and 怎样使用轻蜂加速器上外网, in
with Shuchi Chawla, Konstantin Makarychev, and Grigory Yaroslavtsev, in
with 怎样使用轻蜂加速器上外网, in
with Varun Kanade and Elchanan Mossel , in