activity
20122022
most citedSpectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

21 citations · 98 across the 13 of their papers we have counts for

collaborators

25 papers

math.ST20226 cited

Random Graph Matching in Geometric Models: the Case of Complete Graphs

Haoyu Wang, Yihong Wu, Jiaming Xu +1

This paper studies the problem of matching two complete graphs with edge weights correlated through latent geometries, extending a recent line of research on random graph matching…

math.ST20216 cited

Sharp regret bounds for empirical Bayes and compound decision problems

Yury Polyanskiy, Yihong Wu

We consider the classical problems of estimating the mean of an -dimensional normally (with identity covariance matrix) or Poisson distributed vector under the squared loss. In…

math.ST202112 cited

Polynomial methods in statistical inference: theory and practice

Yihong Wu, Pengkun Yang

This survey provides an exposition of a suite of techniques based on the theory of polynomials, collectively referred to as polynomial methods, which have recently been applied to…

math.ST20213 cited

The planted matching problem: Sharp threshold and infinite-order phase transition

Jian Ding, Yihong Wu, Jiaming Xu +1

We study the problem of reconstructing a perfect matching hidden in a randomly weighted bipartite graph. The edge set includes every node pair in and each o…

math.ST202017 cited

Self-regularizing Property of Nonparametric Maximum Likelihood Estimator in Mixture Models

Yury Polyanskiy, Yihong Wu

Introduced by Kiefer and Wolfowitz \cite{KW56}, the nonparametric maximum likelihood estimator (NPMLE) is a widely used methodology for learning mixture odels and empirical Bayes e…

math.ST20201 cited

Note on approximating the Laplace transform of a Gaussian on a complex disk

Yury Polyanskiy, Yihong Wu

In this short note we study how well a Gaussian distribution can be approximated by distributions supported on . Perhaps, the natural conjecture is that for large the a…