Demo Data from VLDB 2026 / reviewers in the wild / expert
Yuhang Wu 0011
dblp:41/7732-11
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0007-4635-8066ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 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 |
Mathematical optimization · 34% Algorithmic game theory and mechanism design · 34% Information theory · 32% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational finance and economics · 77% Computational social science and digital humanities · 23% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization
online optimization |
0.9 | 1 | 2025 | A/B Test and Online Experiment Under Diminishing Marginal Effects: Regret Minimization and Statistical Inference · KDD (2) 2025 |
Algorithmic game theory and mechanism design
regret minimization |
0.9 | 1 | 2025 | A/B Test and Online Experiment Under Diminishing Marginal Effects: Regret Minimization and Statistical Inference · KDD (2) 2025 |
Information theory
statistical inference |
0.8 | 2 | 2025 | Non-stationary A/B Tests · KDD 2022 A/B Test and Online Experiment Under Diminishing Marginal Effects: Regret Minimization and Statistical Inference · KDD (2) 2025 |
Computational finance and economics
algorithmic trading |
0.6 | 1 | 2022 | Non-stationary A/B Tests · KDD 2022 |
Information retrieval › evaluation › online evaluation
a/b testing |
0.3 | 1 | 2025 | A/B Test and Online Experiment Under Diminishing Marginal Effects: Regret Minimization and Statistical Inference · KDD (2) 2025 |
Computational social science and digital humanities
online controlled experiments |
0.2 | 1 | 2022 | Non-stationary A/B Tests · KDD 2022 |
Methods — techniques the papers use, named apart from their topics
central limit theorem · 2.9randomization · 1.1online algorithms · 0.9online algorithm · 0.9post-stratification · 0.6post stratification · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A/B Test and Online Experiment Under Diminishing Marginal Effects: Regret Minimization and Statistical InferenceabstractWhen large online platforms test a new strategy to implement with their user traffic, the phenomenon of diminishing marginal effects may arise. For example, when a strategy is implemented on 100% of the user traffic, the expected per-user effect can be lower compared to the expected per-user effect when a strategy is implemented on 10% of the user traffic, potentially due to limits of overall budget, resource, attention or content involved with that strategy. This diminishing marginal effect phenomenon brings an additional delicacy to online sequential experiments. In particular, for the classical goal of achieving the largest expected reward, the optimal decision may no longer be assigning 100% traffic to one strategy, but instead a mixture of strategies. We deliver two tasks for online sequential experiments in presence of diminishing marginal effect: (1) Adaptively identify the optimal traffic allocation to maximize the expected cumulative reward and (2) Construct valid central limit theorem (which is critically needed for A/B tests in online platforms) to perform reliable statistical inference for the expected reward under the optimal traffic allocation that is a priori unknown. We show that classical algorithms can fail to deliver the second task, especially because the statistical inference task presents its own difficulty. We develop a new online algorithm that leverages an additional smoothness condition on how the marginal effects change to achieve both tasks. We prove that this algorithm obtains the best achievable expected cumulative reward. Further, crucially for online platforms' need to do trustworthy statistical inference, the algorithm is proved to enjoy a valid central limit theorem. The theoretical findings are illustrated through numerical experiments. Jingxu Xu, Yuhang Wu 0011, Yingfei Wang, Zeyu Zheng 0002 |
KDD (2) | 2 |
| 2022 | Non-stationary A/B TestsabstractA/B tests, also known as online controlled experiments, have been used at scale by data-driven enterprises to guide decisions and test innovative ideas. Meanwhile, nonstationarity, such as the time-of-day effect, can commonly arise in various business metrics. We show that inadequately addressing nonstationarity can cause A/B tests to be statistically inefficient or invalid, leading to wrong conclusions. To address these issues, we develop a new framework that provides appropriate modeling and adequate statistical analysis for nonstationary A/B tests. Without changing the infrastructure for any existing A/B test procedure, we propose a new estimator that views time as a continuous covariate to perform post stratification with a sample-dependent number of stratification levels. We prove central limit theorem in a natural limiting regime under nonstationarity, so that valid large-sample statistical inference is available. We show that the proposed estimator achieves the optimal asymptotic variance among all estimators. When the experiment design phase of an A/B test allows, we propose a new time-grouped randomization approach to make a better balance on treatment and control assignments in presence of time nonstationarity. A brief account of numerical experiments are conducted to illustrate the theoretical analysis. Yuhang Wu 0011, Zeyu Zheng 0002, Zuohua Zhang |
KDD | 1 |