VLDB 2026 Research / reviewers in the wild / expert
Bokui Wan
dblp:410/6587
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Theoretical computer science
1 paper |
Mathematical optimization · 67% Approximation and online algorithms · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational social science and digital humanities › online controlled experiments
a/b testing |
0.9 | 1 | 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed Bandit · ICML 2025 |
Computational social science and digital humanities
online controlled experiments |
0.9 | 1 | 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed Bandit · ICML 2025 |
Mathematical optimization › online optimization
bandit optimization |
0.9 | 1 | 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed Bandit · ICML 2025 |
Mathematical optimization
stochastic optimization |
0.9 | 1 | 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed Bandit · ICML 2025 |
Approximation and online algorithms › online learning
two-armed bandit |
0.9 | 1 | 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed Bandit · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
permutation method · 1.7counterfactual outcome framework · 1.7central limit theorem · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Strategic A/B testing via Maximum Probability-driven Two-armed BanditabstractDetecting a minor average treatment effect is a major challenge in large-scale applications, where even minimal improvements can have a significant economic impact. Traditional methods, reliant on normal distribution-based or expanded statistics, often fail to identify such minor effects because of their inability to handle small discrepancies with sufficient sensitivity. This work leverages a counterfactual outcome framework and proposes a maximum probability-driven two-armed bandit (TAB) process by weighting the mean volatility statistic, which controls Type I error. The implementation of permutation methods further enhances the robustness and efficacy. The established strategic central limit theorem (SCLT) demonstrates that our approach yields a more concentrated distribution under the null hypothesis and a less concentrated one under the alternative hypothesis, greatly improving statistical power. The experimental results indicate a significant improvement in the A/B testing, highlighting the potential to reduce experimental costs while maintaining high statistical power. Bokui Wan, Jinjuan Wang |
ICML | 3 |