Demo Data from EDBT 2026 / reviewers in the wild / expert
Wei Wang 0182
dblp:35/7092-182
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0002-6082-0639ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% | |
| Artificial intelligence
1 paper |
Reinforcement learning · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems › sequential decision making
contextual bandit recommendation |
0.5 | 1 | 2021 | GuideBoot: Guided Bootstrap for Deep Contextual Banditsin Online Advertising · WWW 2021 |
Machine learning › Reinforcement learning › exploration
exploration-exploitation tradeoff |
0.1 | 1 | 2021 | GuideBoot: Guided Bootstrap for Deep Contextual Banditsin Online Advertising · WWW 2021 |
Methods — techniques the papers use, named apart from their topics
bootstrap · 1.0bayesian uncertainty estimation · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | GuideBoot: Guided Bootstrap for Deep Contextual Banditsin Online AdvertisingabstractThe exploration/exploitation (E&E) dilemma lies at the core of interactive systems such as online advertising, for which contextual bandit algorithms have been proposed. Bayesian approaches provide guided exploration via uncertainty estimation, but the applicability is often limited due to over-simplified assumptions. Non-Bayesian bootstrap methods, on the other hand, can apply to complex problems by using deep reward models, but lack a clear guidance to the exploration behavior. It still remains largely unsolved to develop a practical method for complex deep contextual bandits. Feiyang Pan, Haoming Li 0011, Xiang Ao 0001, Wei Wang 0182, Yanrong Kang, Ao Tan, Qing He 0003 |
WWW | 4 |