EDBT 2026 Demo / reviewers in the wild / expert
Gao Huang 0004
dblp:120/2687-4
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-2952-3633ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 2 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
2 papers |
Mathematical optimization · 78% Information theory · 11% Computational complexity · 11% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › signal processing
compressed sensing |
0.9 | 1 | 2025 | Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › statistical estimation › regression › robust regression
least absolute deviations |
0.9 | 1 | 2025 | Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › continuous optimization › matrix optimization › matrix recovery
low-rank matrix recovery |
0.9 | 1 | 2025 | Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › continuous optimization › matrix optimization
matrix recovery |
0.9 | 1 | 2025 | Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › continuous optimization › convex optimization › norm optimization
nuclear norm minimization |
0.9 | 1 | 2025 | Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random Matrix · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › nonconvex optimization
phase retrieval |
0.9 | 1 | 2025 | Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation · IEEE Trans. Inf. Theory 2025 |
Computational complexity
phase transition |
0.9 | 1 | 2025 | Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation · IEEE Trans. Inf. Theory 2025 |
Mathematical optimization › statistical estimation
robust estimation |
0.9 | 1 | 2025 | Adversarial Phase Retrieval via Nonlinear Least Absolute Deviation · IEEE Trans. Inf. Theory 2025 |
Methods — techniques the papers use, named apart from their topics
sub-gaussian measurements · 0.9probability density function analysis · 0.9nonlinear least absolute deviation · 0.9mendelson's small ball method · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Low-Rank Toeplitz Matrix Restoration: Descent Cone Analysis and Structured Random MatrixabstractThis note demonstrates that we can stably recover rank-rToeplitz matrix$\pmb {X}\in \mathbb {R}^{n\times n}$from a number of rank-one subgaussian measurements on the order of$r\log ^{2} n$with an exponentially decreasing failure probability by employing a nuclear norm minimization program. Our approach utilizes descent cone analysis through Mendelson’s small ball method with the Toeplitz constraint. The key ingredient is to determine the spectral norm of the random matrix of the Toeplitz structure, which may be of independent interest. This improves upon earlier analyses and resolves the conjecture in Chen et al. (IEEE Transactions on Information Theory, 61(7):4034–4059, 2015). Gao Huang 0004, Song Li 0002 |
IEEE Trans. Inf. Theory | 1 |
| 2025 | Adversarial Phase Retrieval via Nonlinear Least Absolute DeviationabstractWe investigate the phase retrieval problem perturbed by dense bounded noise and sparse outliers that can change an adversarially chosen s-fraction of the measurement vector. The adversarial sparse outliers may depend on both the observation and measurements. We demonstrate that the nonlinear least absolute deviation based on amplitude measurements can tolerate adversarial outliers up to a fraction ofs*, 1≈ 0.2043, while the intensity-based model can tolerate a fraction ofs*, 2≈ 0.1185. Furthermore, we construct adaptive counterexamples to show that these thresholds are theoretically sharp, thereby showing the presentation of phase transition in the adversarial phase retrieval problem when the corruption fraction exceeds the sharp thresholds. This implies that the amplitude-based model exhibits superior adversarial robustness in comparison with the intensity-based model. Corresponding experimental results are presented to further illustrate our theoretical findings. To the best of our knowledge, our results provide the first theoretical examination of the differences in robustness performance between amplitude and intensity measurement. A crucial aspect of our analysis is the exploration of the exact distribution of a combination of two non-independent Gaussian random variables, leading to the presentation of novel probability density functions to derive the sharp thresholds. Gao Huang 0004, Song Li 0002 |
IEEE Trans. Inf. Theory | 1 |