Privacy Preserving Adaptive Experiment Design
Jiachun Li, Kaining Shi, David Simchi-Levi
Abstract
Adaptive 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. These two objectives often lead to contrast optimal allocation mechanism. 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 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 528f33b0-5ccb-45fe-b3d4-bc6d8f93e09bBuilds on9
- Exploiting Unintended Feature Leakage in Collaborative LearningLuca Melis, Congzheng Song, Emiliano De Cristofaro, Vitaly ShmatikovS&P 2019 · 1,736 citations
- The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural NetworksNicholas Carlini, Chang Liu, Úlfar Erlingsson, Jernej Kos et al.USENIX Security 2019 · 1,386 citations
- Locally Differentially Private (Contextual) Bandits LearningKai Zheng, Tianle Cai, Weiran Huang, Zhenguo Li et al.NeurIPS 2020 · 76 citations
- Generalized Linear Bandits with Local Differential PrivacyYuxuan Han, Zhipeng Liang, Yang Wang, Jiheng ZhangNeurIPS 2021 · 39 citations
- Differentially Private Multi-Armed Bandits in the Shuffle ModelJay Tenenbaum, Haim Kaplan, Yishay Mansour, Uri StemmerNeurIPS 2021 · 37 citations
Related papers
- Non-stationary Experimental Design under Linear TrendsDavid Simchi-Levi, Chonghuan Wang, Zeyu ZhengNeurIPS 2023 · 6 citations
- Statistical Parity with Exponential WeightsStephen Pasteris, Chris Hicks, Vasilios MavroudisNeurIPS 2025
- DP-NCB: Privacy Preserving Fair BanditsDhruv Sarkar, Nishant Pandey, Sayak Ray ChowdhuryAAAI 2026 · 2 citations
- Proportional Response: Contextual Bandits for Simple and Cumulative Regret MinimizationSanath Kumar Krishnamurthy, Ruohan Zhan, Susan Athey, Emma BrunskillNeurIPS 2023 · 15 citations
- Fair Adaptive ExperimentsWaverly Wei, Xinwei Ma, Jingshen WangNeurIPS 2023 · 7 citations
