Optimistic Algorithms for Adaptive Estimation of the Average Treatment Effect
Ojash Neopane, Aaditya Ramdas, Aarti Singh
Abstract
Estimation and inference for the Average Treatment Effect (ATE) is a cornerstone of causal inference and often serves as the foundation for developing procedures for more complicated settings. Although traditionally analyzed in a batch setting, recent advances in martingale theory have paved the way for adaptive methods that can enhance the power of downstream inference. Despite these advances, progress in understanding and developing adaptive algorithms remains in its early stages. Existing work either focus on asymptotic analyses that overlook exploration-exploitation tradeoffs relevant in finite-sample regimes or rely on simpler but suboptimal estimators. In this work, we address these limitations by studying adaptive sampling procedures that take advantage of the asymptotically optimal Augmented Inverse Probability Weighting (AIPW) estimator. Our analysis uncovers challenges obscured by asymptotic approaches and introduces a novel algorithmic design principle reminiscent of optimism in multiarmed bandits. This principled approach enables our algorithm to achieve significant theoretical and empirical gains compared to prior methods. Our findings mark a step forward in advancing adaptive causal inference methods in theory and practice.
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.
Cited by top-tier papers2
- Efficient Adaptive Experimentation with NoncomplianceMiruna Oprescu, Brian Cho, Nathan KallusNeurIPS 2025
- Stronger Neyman Regret Guarantees for Adaptive Experimental DesignGeorgy Noarov, Riccardo Fogliato, Martin Bertran Lopez, Aaron RothICML 2025
Builds on5
- Minimax-Optimal Off-Policy Evaluation with Linear Function ApproximationYaqi Duan, Zeyu Jia, Mengdi WangICML 2020 · 161 citations
- Inference for Batched BanditsKelly W. Zhang, Lucas Janson, Susan A. MurphyNeurIPS 2020 · 115 citations
- Active Offline Policy SelectionKsenia Konyushkova, Yutian Chen, Thomas Paine, Çaglar Gülçehre et al.NeurIPS 2021 · 35 citations
- Optimal Treatment Allocation for Efficient Policy Evaluation in Sequential Decision MakingTing Li, Chengchun Shi, Jianing Wang, Fan Zhou et al.NeurIPS 2023 · 21 citations
- CLIP-OGD: An Experimental Design for Adaptive Neyman Allocation in Sequential ExperimentsJessica Dai, Paula Gradu, Christopher HarshawNeurIPS 2023 · 21 citations
Related papers
- Off-policy estimation with adaptively collected data: the power of online learningJeonghwan Lee, Cong MaNeurIPS 2024 · 4 citations
- Online Multi-Armed Bandits with Adaptive InferenceMaria Dimakopoulou, Zhimei Ren, Zhengyuan ZhouNeurIPS 2021 · 47 citations
- Design-Based Anytime-Valid Inference for Randomized Experiments with Delayed Outcomes and Staggered EntryMichael Lindon, Nathan KallusICML 2026 · 1 citation
- Federated Causal Inference on Multi-Site Observational Data via Propensity Score AggregationRémi Khellaf, Aurélien Bellet, julie JosseICML 2026 · 6 citations
- Simulation-Based Inference for Adaptive ExperimentsBrian Cho, Aurélien Bibaut, Nathan KallusNeurIPS 2025 · 3 citations
