VLDB 2026 Research / reviewers in the wild / expert
Jie Wang 0030
dblp:29/5259-30
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-6776-2267ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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.
| Artificial intelligence
1 paper |
Learning theory · 50% Trustworthy machine learning · 50% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning › fairness
model bias |
0.4 | 1 | 2020 | How Biased Is Your Model? Concentration Inequalities, Information and Model Bias · IEEE Trans. Inf. Theory 2020 |
Machine learning › Learning theory
statistical estimation |
0.4 | 1 | 2020 | How Biased Is Your Model? Concentration Inequalities, Information and Model Bias · IEEE Trans. Inf. Theory 2020 |
Information theory › probability theory › measure concentration
concentration inequalities |
0.4 | 1 | 2020 | How Biased Is Your Model? Concentration Inequalities, Information and Model Bias · IEEE Trans. Inf. Theory 2020 |
Information theory › information measures › divergence measures
kullback-leibler divergence |
0.1 | 1 | 2020 | How Biased Is Your Model? Concentration Inequalities, Information and Model Bias · IEEE Trans. Inf. Theory 2020 |
Methods — techniques the papers use, named apart from their topics
hoeffding-azuma inequality · 0.9bennett's inequality · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | How Biased Is Your Model? Concentration Inequalities, Information and Model BiasabstractWe derive tight and computable bounds on the bias of statistical estimators, or more generally of quantities of interest, when evaluated on a baseline model P rather than on the typically unknown true model Q. Our proposed method combines the scalable information inequality derived by P. Dupuis, K.Chowdhary, the authors and their collaborators together with classical concentration inequalities (such as Bennett's and Hoeffding-Azuma inequalities). Our bounds are expressed in terms of the Kullback-Leibler divergence R(QIIP ) of model Q with respect to P and the moment generating function for the statistical estimator under P . Furthermore, concentration inequalities, i.e. bounds on moment generating functions, provide tight and computationally inexpensive model bias bounds for quantities of interest. Finally, they allow us to derive rigorous confidence bands for statistical estimators that account for model bias and are valid for an arbitrary amount of data. Konstantinos Gourgoulias, Markos A. Katsoulakis, Luc Rey-Bellet, Jie Wang 0030 |
IEEE Trans. Inf. Theory | 4 |