307 citations · 907 across the 65 of their papers we have counts for
6 papers · 1 filter
Consistent recovery threshold of hidden nearest neighbor graphs
Jian Ding, Yihong Wu, Jiaming Xu +1
Motivated by applications such as discovering strong ties in social networks and assembling genome subsequences in biology, we study the problem of recovering a hidden -nearest…
Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in iterations
Yihong Wu, Harrison H. Zhou
We analyze the classical EM algorithm for parameter estimation in the symmetric two-component Gaussian mixtures in dimensions. We show that, even in the absence of any separati…
Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality
Zhou Fan, Cheng Mao, Yihong Wu +1
We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edg…
Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model
Zhou Fan, Cheng Mao, Yihong Wu +1
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally in…
Data Amplification: A Unified and Competitive Approach to Property Estimation
Yi Hao, Alon Orlitsky, Ananda T. Suresh +1
Estimating properties of discrete distributions is a fundamental problem in statistical learning. We design the first unified, linear-time, competitive, property estimator that for…
Dualizing Le Cam's method for functional estimation, with applications to estimating the unseens
Yury Polyanskiy, Yihong Wu
Le Cam's method (or the two-point method) is a commonly used tool for obtaining statistical lower bound and especially popular for functional estimation problems. This work aims to…