Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhuohang He

dblp:234/2655 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0008-5373-8515ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 51% Information theory · 34% Quantum computing and quantum information · 10%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › channel capacity
blahut-arimoto algorithm
0.912025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Information theory
channel capacity
0.912025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Mathematical optimization › continuous optimization
convex optimization
0.912025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Mathematical optimization › continuous optimization › convex optimization › first-order methods
mirror descent
0.912025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Mathematical optimization › continuous optimization › convex optimization
proximal methods
0.912025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information
quantum information theory
0.312025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Coding theory › source coding
rate-distortion theory
0.312025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025
Quantum computing and quantum information › entanglement measures
relative entropy of entanglement
0.312025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis · IEEE Trans. Inf. Theory 2025

Methods — techniques the papers use, named apart from their topics

mirror descent · 0.9convex analysis · 0.9bregman proximal method · 0.9
YearPublicationVenuePosition
2025 Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis
abstract
Compressive Robust Principal Component Analysis (CRPCA) naturally arises in various applications as a means to recover a low-rank matrix low-rank matrix$\boldsymbol {L}$and a sparse matrix$\boldsymbol {S}$from compressive measurements. In this paper, we approach the problem from a Bayesian inference perspective. We establish a probabilistic model for the problem and develop an improved turbo message passing (ITMP) algorithm based on the sum-product rule and the appropriate approximations. Additionally, we establish a state evolution framework to characterize the asymptotic behavior of the ITMP algorithm in the large-system limit. By analyzing the established state evolution, we further propose sufficient conditions for the global convergence of our algorithm. Our numerical results validate the theoretical results, demonstrating that the proposed asymptotic framework accurately characterize the dynamical behavior of the ITMP algorithm, and the phase transition curve specified by the sufficient condition agrees well with numerical simulations.
Zhuohang He, Junjie Ma 0001, Xiaojun Yuan 0002
IEEE Trans. Inf. Theory1
2024 Asymptotic Estimates for Spectral Estimators of Rotationally Invariant Matrices
abstract
In this paper, we consider the recovery of low-rank matrices from noisy observations using spectral denoisers, where the singular values are denoised through an identical scalar smoothing function. We explore the asymptotic mean squared error (AMSE) of these denoisers within a framework where the rank of the matrix to be recovered grows linearly with the matrix size. We demonstrate that, under arbitrary i.i.d. noise and some mild regularity assumptions, the AMSE converges in probability to a deterministic function of the noise power. Our results are applicable to commonly used denoisers, including the best-rank-r denoiser, the singular-value soft-threshold denoiser, and the singular-value hard-threshold denoiser. To the best of our knowledge, this is the first study to establish an analytical expression for the asymptotic MSE under arbitrary i.i.d. noise. The derived analytical expression depends solely on the empirical distribution of the singular values of the low-rank matrix and the specific form of the spectral denoiser employed.
Zhuohang He, Xiaojun Yuan 0002, Junjie Ma 0001
ISIT1