Demo Data from SIGIR 2026 / reviewers in the wild / expert
Hui Wang 0003
dblp:39/721-3
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2005
0000-0003-2633-6015ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1Applied, interdisciplinary, general and emerging computing · 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 |
Probabilistic and Bayesian machine learning · 50% Learning theory · 50% | |
| Theoretical computer science
1 paper |
Information theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Probabilistic and Bayesian machine learning
conditional expectation |
0.1 | 1 | 2005 | On the optimality of conditional expectation as a Bregman predictor · IEEE Trans. Inf. Theory 2005 |
Machine learning › Learning theory
loss function |
0.1 | 1 | 2005 | On the optimality of conditional expectation as a Bregman predictor · IEEE Trans. Inf. Theory 2005 |
Information theory › algorithmic information theory
optimal predictor |
0.0 | 1 | 2005 | On the optimality of conditional expectation as a Bregman predictor · IEEE Trans. Inf. Theory 2005 |
Methods — techniques the papers use, named apart from their topics
l2 loss · 0.1bregman divergence · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | On the optimality of conditional expectation as a Bregman predictorabstractWe consider the problem of predicting a random variable X from observations, denoted by a random variable Z. It is well known that the conditional expectation E[X|Z] is the optimal L/sup 2/ predictor (also known as "the least-mean-square error" predictor) of X, among all (Borel measurable) functions of Z. In this orrespondence, we provide necessary and sufficient conditions for the general loss functions under which the conditional expectation is the unique optimal predictor. We show that E[X|Z] is the optimal predictor for all Bregman loss functions (BLFs), of which the L/sup 2/ loss function is a special case. Moreover, under mild conditions, we show that the BLFs are exhaustive, i.e., if for every random variable X, the infimum of E[F(X,y)] over all constants y is attained by the expectation E[X], then F is a BLF. Arindam Banerjee 0001, Xin Guo 0001, Hui Wang 0003 |
IEEE Trans. Inf. Theory | 3 |
| 2004 | Optimal Bregman prediction and Jensen's equalityabstractThis paper provides necessary and sufficient conditions for general loss functions under which the conditional expectation is the unique optimal predictor of a random variable. Further, using such loss functions, we give an exact characterization of the difference between the two sides of Jensen's inequality. Arindam Banerjee 0001, Xin Guo 0001, Hui Wang 0003 |
ISIT | 3 |