IEEE Annual Symposium on Foundations of Computer Science · 2019
Cited
63
Resume (English only)
Academic Achievements
Published multiple academic papers, including:
- Improving the Threshold for Finding Rank-1 Matrices in a Subspace
- Stochastic Block Models with Many Communities and the Kesten-Stigum Bound
- Sharp Phase Transitions in Estimation with Low-Degree Polynomials
- Overcomplete Tensor Decomposition via Koszul-Young Flattenings
- Statistical Inference of a Ranked Community in a Directed Graph
- Tensor Cumulants for Statistical Inference on Invariant Distributions
- Low-Degree Phase Transitions for Detecting a Planted Clique in Sublinear Time
- Information-Theoretic Thresholds for Planted Dense Cycles
- Time Lower Bounds for the Metropolis Process and Simulated Annealing
- Precise Error Rates for Computationally Efficient Testing
- Detection of Dense Subhypergraphs by Low-Degree Polynomials
- Is Planted Coloring Easier than Planted Clique?
- Detection-Recovery Gap for Planted Dense Cycles
- Is it Easier to Count Communities than Find Them?
Research Experience
Serves as an Assistant Professor in the Department of Mathematics at UC Davis, involved in multiple research projects and has published several papers.
Education
No detailed educational background information provided.
Background
Assistant Professor of Mathematics at UC Davis. Research interests include theoretical computer science, statistics, probability, and data science, specifically: math of data science (optimal algorithms for finding hidden structures in random noise), computational complexity of statistical inference, tensors and associated computational challenges, connections between Bayesian inference and statistical physics, problems involving group actions (e.g., determining 3D molecular structure via cryo-EM).
Miscellany
Family members include wife Melissa, sisters Nicole and Natasha, and sister-in-law Maya.