
Yihong Wu
· James A. Attwood Professor of Statistics and Data ScienceYale University · Department of Statistics and Data Science
Active 2008–2025
Academic metrics are sourced from OpenAlex and public funding records; values may differ from Google Scholar.
About
Yihong Wu is the James A. Attwood Professor of Statistics and Data Science and serves as the Chair of the Department of Statistics and Data Science at Yale University. His research broadly focuses on the theoretical and algorithmic aspects of high-dimensional statistics, information theory, and optimization. Wu's work addresses fundamental problems in these areas, contributing to the understanding and development of statistical methods and algorithms that are applicable to complex, high-dimensional data settings.
Research topics
- Mathematics
- Statistics
- Combinatorics
- Mathematical optimization
- Algorithm
- Mathematical analysis
- Computer Science
- Theoretical computer science
- Discrete mathematics
- Physics
Selected publications
Heteroskedastic PCA: Algorithm, optimality, and applications
The Annals of Statistics · 2022 · 69 citations
Senior authorCorrespondingA general framework for principal component analysis (PCA) in the presence of heteroskedastic noise is introduced. We propose an algorithm called HeteroPCA, which involves iteratively imputing the diagonal entries of the sample covariance matrix to remove estimation bias due to heteroskedasticity. This procedure is computationally efficient and provably optimal under the generalized spiked covariance model. A key technical step is a deterministic robust perturbation analysis on singular subspace…
Cambridge University Press eBooks · 2024-12-31 · 63 citations
bookSenior authorThis enthusiastic introduction to the fundamentals of information theory builds from classical Shannon theory through to modern applications in statistical learning, equipping students with a uniquely well-rounded and rigorous foundation for further study. Introduces core topics such as data compression, channel coding, and rate-distortion theory using a unique finite block-length approach. With over 210 end-of-part exercises and numerous examples, students are introduced to contemporary applica…
Efficient random graph matching via degree profiles
Probability Theory and Related Fields · 2020 · 59 citations
Optimal rates of entropy estimation over Lipschitz balls
The Annals of Statistics · 2020 · 57 citations
Senior authorCorrespondingWe consider the problem of minimax estimation of the entropy of a density over Lipschitz balls. Dropping the usual assumption that the density is bounded away from zero, we obtain the minimax rates $(n\ln n)^{-s/(s+d)}+n^{-1/2}$ for $0<s\leq 2$ for densities supported on $[0,1]^{d}$, where $s$ is the smoothness parameter and $n$ is the number of independent samples. We generalize the results to densities with unbounded support: given an Orlicz functions $\Psi $ of rapid growth (such as the subex…
Random Graph Matching at Otter’s Threshold via Counting Chandeliers
2023-05-16 · 31 citations
articleWe propose an efficient algorithm for graph matching based on similarity scores constructed from counting a certain family of weighted trees rooted at each vertex. For two Erdős–Rényi graphs G(n,q) whose edges are correlated through a latent vertex correspondence, we show that this algorithm correctly matches all but a vanishing fraction of the vertices with high probability, provided that nq→∞ and the edge correlation coefficient ρ satisfies ρ2>α ≈ 0.338, where α is Otter’s tree-counting consta…
Recent grants
NSF · $206k · 2016–2019
NSF · $250k · 2015–2017
NSF · $571k · 2017–2023
Frequent coauthors
- 52 shared
Jiaming Xu
- 30 shared
Yury Polyanskiy
- 23 shared
Bruce Hajek
- 19 shared
Pengkun Yang
- 18 shared
Sergio Verdú
- 14 shared
Zongming Ma
- 11 shared
Zhou Fan
Shandong Provincial Hospital
- 10 shared
Cheng Mao
Georgia Institute of Technology
Similar researchers at Yale University
- Resume-aware match score
- Save to shortlist
- AI-drafted outreach
See your match with Yihong Wu
PhdFit ranks faculty by your research interests, methods, and publications — grounded in their actual work, not templates.
- Free to start
- No credit card
- 30-second signup
