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

Hao Wu 0115

dblp:72/4250-115 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0002-2545-0692ORCID · conflict

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

Theory of computation · 2 · 1 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
Information theory · 75% Combinatorics and discrete mathematics · 25%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures › entropy
entropy inequalities
1.822026
Entropic Isoperimetric and Cramér-Rao Inequalities for Rényi-Fisher Information · IEEE Trans. Inf. Theory 2026
Rényi-Sobolev Inequalities and Connections to Spectral Graph Theory · IEEE Trans. Inf. Theory 2024
Information theory › information measures
fisher information
1.012026
Entropic Isoperimetric and Cramér-Rao Inequalities for Rényi-Fisher Information · IEEE Trans. Inf. Theory 2026
Combinatorics and discrete mathematics › extremal combinatorics
isoperimetric inequality
1.012026
Entropic Isoperimetric and Cramér-Rao Inequalities for Rényi-Fisher Information · IEEE Trans. Inf. Theory 2026
Information theory › estimation theory › estimation bounds
cramér-rao bound
0.312026
Entropic Isoperimetric and Cramér-Rao Inequalities for Rényi-Fisher Information · IEEE Trans. Inf. Theory 2026

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

heat flow · 1.0de bruijn identity · 1.0method of types · 0.8data processing inequality · 0.8
YearPublicationVenuePosition
2026 Entropic Isoperimetric and Cramér-Rao Inequalities for Rényi-Fisher Information
abstract
The de Bruijn identity states that Fisher information is equal to twice the time-derivative of Shannon differential entropy along heat flow. In the same spirit, a generalized version of Fisher information, termed the Rényi–Fisher information, was introduced by Jizba, Dunningham, and Prokš [Entropy, 2021], which is defined as twice the time-derivative of Rényi differential entropy along heat flow. Based on this Rényi–Fisher information, we establish several sharp Rényi-entropic isoperimetric inequalities, which generalize the classic entropic isoperimetric inequality to the Rényi setting. Utilizing these isoperimetric inequalities, we extend the classical Cramér–Rao inequality from Fisher information to Rényi–Fisher information. We then use these generalized Cramér–Rao inequalities to determine the signs of derivatives of Rényi entropy along heat flow, strengthening existing results on the complete monotonicity of Rényi entropy. We lastly explore applications of our Rényi-entropic isoperimetric inequalities in entropy power inequalities. We establish a sharp Rényi entropy power inequality under the assumption that one of two independent random vectors is Gaussian.
Hao Wu 0115, Lei Yu 0003
IEEE Trans. Inf. Theory1
2024 Rényi-Sobolev Inequalities and Connections to Spectral Graph Theory
abstract
In this paper, we generalize the log-Sobolev inequalities to Rényi–Sobolev inequalities by replacing the entropy with the two-parameter entropy, which is a generalized version of entropy and closely related to Rényi divergences. We derive the sharp nonlinear dimension-free version of this kind of inequalities. Interestingly, the resultant inequalities show a transition phenomenon depending on the parameters. We then connect Rényi–Sobolev inequalities to contractive and data-processing inequalities, concentration inequalities, and spectral graph theory. Our proofs in this paper are based on the information-theoretic characterization of the Rényi–Sobolev inequalities, as well as the method of types.
Lei Yu 0003, Hao Wu 0115
IEEE Trans. Inf. Theory2