Yihong Wu

Orcid: 0000-0001-9239-7671

Affiliations:
  • Yale University, New Haven, CT, USA
  • University of Illinois at Urbana-Champaign, IL, USA (former)


According to our database1, Yihong Wu authored at least 80 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature.
IEEE Trans. Inf. Theory, 2024

2023
Spectral Graph Matching and Regularized Quadratic Relaxations II.
Found. Comput. Math., October, 2023

Spectral Graph Matching and Regularized Quadratic Relaxations I Algorithm and Gaussian Analysis.
Found. Comput. Math., October, 2023

Optimal Prediction of Markov Chains With and Without Spectral Gap.
IEEE Trans. Inf. Theory, June, 2023

Random Graph Matching at Otter's Threshold via Counting Chandeliers.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

On the best approximation by finite Gaussian mixtures.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Entropic characterization of optimal rates for learning Gaussian mixtures.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Empirical Bayes via ERM and Rademacher complexities: the Poisson model.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Settling the Sharp Reconstruction Thresholds of Random Graph Matching.
IEEE Trans. Inf. Theory, 2022

Random Graph Matching in Geometric Models: the Case of Complete Graphs.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
Consistent Recovery Threshold of Hidden Nearest Neighbor Graphs.
IEEE Trans. Inf. Theory, 2021

Sharp regret bounds for empirical Bayes and compound decision problems.
CoRR, 2021

The replica-symmetric free energy for Ising spin glasses with orthogonally invariant couplings.
CoRR, 2021

The planted matching problem: Sharp threshold and infinite-order phase transition.
CoRR, 2021

2020
Editorial.
IEEE J. Sel. Areas Inf. Theory, 2020

Hidden Hamiltonian Cycle Recovery via Linear Programming.
Oper. Res., 2020

Polynomial Methods in Statistical Inference: Theory and Practice.
Found. Trends Commun. Inf. Theory, 2020

Learning Mixtures of Permutations: Groups of Pairwise Comparisons and Combinatorial Method of Moments.
CoRR, 2020

Optimal estimation of high-dimensional Gaussian mixtures.
CoRR, 2020

Spectral Graph Matching and Regularized Quadratic Relaxations: Algorithm and Theory.
Proceedings of the 37th International Conference on Machine Learning, 2020

Extrapolating the profile of a finite population.
Proceedings of the Conference on Learning Theory, 2020

2019
Randomly initialized EM algorithm for two-component Gaussian mixture achieves near optimality in O(√n) iterations.
CoRR, 2019

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality.
CoRR, 2019

Spectral Graph Matching and Regularized Quadratic Relaxations I: The Gaussian Model.
CoRR, 2019

Dualizing Le Cam's method, with applications to estimating the unseens.
CoRR, 2019

2018
Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy.
IEEE Trans. Inf. Theory, 2018

Near-Optimal Compressed Sensing of a Class of Sparse Low-Rank Matrices Via Sparse Power Factorization.
IEEE Trans. Inf. Theory, 2018

Strong Data Processing Inequalities for Input Constrained Additive Noise Channels.
IEEE Trans. Inf. Theory, 2018

Recovering a hidden community beyond the Kesten-Stigum threshold in O(|E|log*|V|) time.
J. Appl. Probab., 2018

Efficient random graph matching via degree profiles.
CoRR, 2018

Application of information-percolation method to reconstruction problems on graphs.
CoRR, 2018

Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits.
CoRR, 2018

Statistical and Computational Limits for Sparse Matrix Detection.
CoRR, 2018

Data Amplification: A Unified and Competitive Approach to Property Estimation.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Entropy Rate Estimation for Markov Chains with Large State Space.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Information Limits for Recovering a Hidden Community.
IEEE Trans. Inf. Theory, 2017

Submatrix localization via message passing.
J. Mach. Learn. Res., 2017

Optimal rates of entropy estimation over Lipschitz balls.
CoRR, 2017

Sample complexity of population recovery.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Minimax Rates of Entropy Estimation on Large Alphabets via Best Polynomial Approximation.
IEEE Trans. Inf. Theory, 2016

Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels.
IEEE Trans. Inf. Theory, 2016

Dissipation of Information in Channels With Input Constraints.
IEEE Trans. Inf. Theory, 2016

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions.
IEEE Trans. Inf. Theory, 2016

Achieving Exact Cluster Recovery Threshold via Semidefinite Programming.
IEEE Trans. Inf. Theory, 2016

Converse bounds for interference channels via coupling and proof of Costa's conjecture.
Proceedings of the IEEE International Symposium on Information Theory, 2016

On additive-combinatorial affine inequalities for Shannon entropy and differential entropy.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Semidefinite Programs for Exact Recovery of a Hidden Community.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Information Dimension and the Degrees of Freedom of the Interference Channel.
IEEE Trans. Inf. Theory, 2015

Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms.
IEEE Trans. Inf. Theory, 2015

A note on the strong data-processing inequalities in Bayesian networks.
CoRR, 2015

Recovering a Hidden Community Beyond the Spectral Limit in O(|E|log<sup>*</sup>|V|) Time.
CoRR, 2015

Exact recovery threshold in the binary censored block model.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Optimal entropy estimation on large alphabets via best polynomial approximation.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Strong data processing inequalities in power-constrained Gaussian channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Computational Lower Bounds for Community Detection on Random Graphs.
Proceedings of The 28th Conference on Learning Theory, 2015

Achieving exact cluster recovery threshold via semidefinite programming under the stochastic block model.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
Peak-to-Average Power Ratio of Good Codes for Gaussian Channel.
IEEE Trans. Inf. Theory, 2014

Optimal Detection of Sparse Mixtures Against a Given Null Distribution.
IEEE Trans. Inf. Theory, 2014

2013
Computational Barriers in Minimax Submatrix Detection.
CoRR, 2013

Near Optimal Compressed Sensing of Sparse Rank-One Matrices via Sparse Power Factorization.
CoRR, 2013

Tight Lower Bound for Linear Sketches of Moments.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Recent results on sparse principle component analysis.
Proceedings of the 5th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, 2013

2012
Optimal Phase Transitions in Compressed Sensing.
IEEE Trans. Inf. Theory, 2012

Functional Properties of Minimum Mean-Square Error and Mutual Information.
IEEE Trans. Inf. Theory, 2012

Optimal Detection For Sparse Mixtures
CoRR, 2012

Optimal phase transitions in compressed sensing with noisy measurements.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Piecewise constant prediction.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
MMSE Dimension.
IEEE Trans. Inf. Theory, 2011

Derivative of Mutual Information at Zero SNR: The Gaussian-Noise Case.
IEEE Trans. Inf. Theory, 2011

Estimation in Gaussian Noise: Properties of the Minimum Mean-Square Error.
IEEE Trans. Inf. Theory, 2011

Degrees of freedom of the interference channel: A general formula.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Energy-optimized lossless compression: Rate-variability tradeoff.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Witsenhausen's counterexample: A view from optimal transport theory.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

2010
Rényi information dimension: fundamental limits of almost lossless analog compression.
IEEE Trans. Inf. Theory, 2010

Functional properties of MMSE.
Proceedings of the IEEE International Symposium on Information Theory, 2010

The impact of constellation cardinality on Gaussian channel capacity.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Motion-Indicated Interest Dissemination With Directional Antennas for Wireless Sensor Networks With Mobile Sinks.
IEEE Trans. Veh. Technol., 2009

Fundamental limits of almost lossless analog compression.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Distributed Robust Optimization for Communication Networks.
Proceedings of the INFOCOM 2008. 27th IEEE International Conference on Computer Communications, 2008

2006
Interest dissemination with directional antennas for wireless sensor networks with mobile sinks.
Proceedings of the 4th International Conference on Embedded Networked Sensor Systems, 2006


  Loading...