Demo Data from VLDB 2026 / reviewers in the wild / expert
Kaining Shi
dblp:367/5357
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—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 |
Algorithmic game theory and mechanism design · 50% Mathematical optimization · 50% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
differential privacy |
0.8 | 1 | 2024 | Privacy Preserving Adaptive Experiment Design · ICML 2024 |
Mathematical optimization › experimental design
adaptive experimental design |
0.8 | 1 | 2024 | Privacy Preserving Adaptive Experiment Design · ICML 2024 |
Algorithmic game theory and mechanism design › multi-armed bandit
contextual bandits |
0.8 | 1 | 2024 | Privacy Preserving Adaptive Experiment Design · ICML 2024 |
Mathematical optimization
multi-objective optimization |
0.8 | 1 | 2024 | Privacy Preserving Adaptive Experiment Design · ICML 2024 |
Algorithmic game theory and mechanism design
pareto optimality |
0.8 | 1 | 2024 | Privacy Preserving Adaptive Experiment Design · ICML 2024 |
Methods — techniques the papers use, named apart from their topics
differential privacy · 1.5contextual bandit · 1.5asymptotic normality analysis · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Privacy Preserving Adaptive Experiment DesignabstractAdaptive experiment is widely adopted to estimate conditional average treatment effect (CATE) in clinical trials and many other scenarios. While the primary goal in experiment is to maximize estimation accuracy, due to the imperative of social welfare, it's also crucial to provide treatment with superior outcomes to patients, which is measured by regret in contextual bandit framework. Furthermore, privacy concerns arise in clinical scenarios containing sensitive data like patients health records. Therefore, it's essential for the treatment allocation mechanism to incorporate robust privacy protection measures. In this paper, we investigate the tradeoff between loss of social welfare and statistical power of CATE estimation in contextual bandit experiment. We propose a matched upper and lower bound for the multi-objective optimization problem, and then adopt the concept of Pareto optimality to mathematically characterize the optimality condition. Furthermore, we propose differentially private algorithms which still matches the lower bound, showing that privacy is "almost free". Additionally, we derive the asymptotic normality of the estimator, which is essential in statistical inference and hypothesis testing. Kaining Shi, David Simchi-Levi |
ICML | 2 |