mlsanityData to 14 Oct 2026

Beyond ATE: Multi-Criteria Design for A/B Testing

arXiv 2509.05864 ↗First posted 6 Sep 2025stat.ME stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

In the era of large-scale AI deployment and high-stakes clinical trials, adaptive experimentation faces a ``trilemma'' of conflicting objectives: minimizing cumulative regret (welfare loss during the experiment), maximizing the estimation accuracy of heterogeneous treatment effects (CATE), and ensuring differential privacy (DP) for participants. Existing literature typically optimizes these metrics in isolation or under restrictive parametric assumptions. In this work, we study the multi-objective design of adaptive experiments in a general non-parametric setting. First, we rigorously characterize the instance-dependent Pareto frontier between cumulative regret and estimation error, revealing the fundamental statistical limits of dual-objective optimization. We propose ConSE, a sequential segmentation and elimination algorithm that adaptively discretizes the covariate space to achieve the Pareto-optimal frontier. Second, we introduce DP-ConSE, a privacy-preserving extension that satisfies Joint Differential Privacy. We demonstrate that privacy comes ``for free'' in our framework, incurring only asymptotically negligible costs to regret and estimation accuracy. Finally, we establish a robust link between experimental design and long-term utility: we prove that any policy derived from our Pareto-optimal algorithms minimizes post-experiment simple regret, regardless of the specific exploration-exploitation trade-off chosen during the trial. Our results provide a theoretical foundation for designing ethical, private, and efficient adaptive experiments in sensitive domains.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 44 of its 83 references that are in the map. First posted on arXiv 6 Sep 2025.

Builds on

44 of 83 references.

References · 44

  1. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 864
  2. 2015Estimation and Inference of Heterogeneous Treatment Effects using Random Forestscited by 600
  3. 2018Exploiting Unintended Feature Leakage in Collaborative Learningcited by 520
  4. 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 272
  5. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
  6. 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 115
  7. 2018Offline A/B testing for Recommender Systemscited by 96
  8. 2018Differentially Private Contextual Linear Banditscited by 82
  9. 2020Locally Differentially Private (Contextual) Bandits Learningcited by 53
  10. 2016The End of Optimism? An Asymptotic Analysis of Finite-Armed Linear Banditscited by 49
  11. 2015Algorithms for Differentially Private Multi-Armed Banditscited by 45
  12. 2019Adaptive Exploration in Linear Contextual Banditcited by 43
32 more
  1. 2020Design and Analysis of Switchback Experimentscited by 38
  2. 2019An Optimal Private Stochastic-MAB Algorithm Based on an Optimal Private Stopping Rulecited by 37
  3. 2020Multi-Armed Bandits with Local Differential Privacycited by 37
  4. 2017Why Adaptively Collected Data Have Negative Bias and How to Correct for Itcited by 36
  5. 2020Power Constrained Banditscited by 30
  6. 2020A Primer on Private Statisticscited by 30
  7. 2021Generalized Linear Bandits with Local Differential Privacycited by 29
  8. 2022When Privacy Meets Partial Information: A Refined Analysis of Differentially Private Banditscited by 28
  9. 2022Shuffle Private Linear Contextual Banditscited by 27
  10. 2019Smooth Contextual Bandits: Bridging the Parametric and Non-differentiable Regret Regimescited by 25
  11. 2021Differentially Private Multi-Armed Bandits in the Shuffle Modelcited by 24
  12. 2020Efficient Adaptive Experimental Design for Average Treatment Effect Estimationcited by 23
  13. 2020Privacy-Preserving Dynamic Personalized Pricing with Demand Learningcited by 23
  14. 2018Mitigating Bias in Adaptive Data Gathering via Differential Privacycited by 21
  15. 2015Always Valid Inference: Bringing Sequential Analysis to A/B Testingcited by 20
  16. 2022Differentially Private Stochastic Linear Bandits: (Almost) for Freecited by 19
  17. 2021Causal Inference with Corrupted Data: Measurement Error, Missing Values, Discretization, and Differential Privacycited by 18
  18. 2017A framework for Multi-A(rmed)/B(andit) testing with online FDR controlcited by 17
  19. 2023Clip-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential Experimentscited by 16
  20. 2022Differentially Private Estimation of Heterogeneous Causal Effectscited by 14
  21. 2019Optimal Experimental Design for Staggered Rolloutscited by 13
  22. 2021Differential Privacy in Personalized Pricing with Nonparametric Demand Modelscited by 13
  23. 2021Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Banditscited by 13
  24. 2015Private Causal Inferencecited by 10
  25. 2024Online Experimental Design With Estimation-Regret Trade-off Under Network Interferencecited by 9
  26. 2020Panel Experiments and Dynamic Causal Effects: A Finite Population Perspectivecited by 8
  27. 2023Adaptive Neyman Allocationcited by 8
  28. 2024Treatment Effect Estimation for User Interest Exploration on Recommender Systemscited by 6
  29. 2024Optimal Adaptive Experimental Design for Estimating Treatment Effectcited by 5
  30. 2024Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariatescited by 5
  31. 2014Active Clinical Trials for Personalized Medicinecited by 2
  32. 2019A Dimension-free Algorithm for Contextual Continuum-armed Banditscited by 2

Built on by

Not cited yet.