mlsanityData to 14 Oct 2026

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference

arXiv 2412.03727 ↗First posted 4 Dec 2024cs.LG math.OC math.STcited by 9

Not on the map. Why?

Abstract (arXiv)

Network interference has attracted significant attention in the field of causal inference, encapsulating various sociological behaviors where the treatment assigned to one individual within a network may affect the outcomes of others, such as their neighbors. A key challenge in this setting is that standard causal inference methods often assume independent treatment effects among individuals, which may not hold in networked environments. To estimate interference-aware causal effects, a traditional approach is to inherit the independent settings, where practitioners randomly assign experimental participants into different groups and compare their outcomes. While effective in offline settings, this strategy becomes problematic in sequential experiments, where suboptimal decision persists, leading to substantial regret. To address this issue, we introduce a unified interference-aware framework for online experimental design. Compared to existing studies, we extend the definition of arm space by utilizing the statistical concept of exposure mapping, which allows for a more flexible and context-aware representation of treatment effects in networked settings. Crucially, we establish a Pareto-optimal trade-off between estimation accuracy and regret under the network concerning both time period and arm space, which remains superior to baseline models even without network interference. Furthermore, we propose an algorithmic implementation and discuss its generalization across different learning settings and network topology.

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 36 of its 81 references that are in the map. First posted on arXiv 4 Dec 2024.

Builds on

36 of 81 references.

References · 36

  1. 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 149
  2. 2019Confidence Intervals for Policy Evaluation in Adaptive Experimentscited by 95
  3. 2020Inference for Batched Banditscited by 63
  4. 2013Distributed Exploration in Multi-Armed Banditscited by 46
  5. 2015Combinatorial Cascading Banditscited by 40
  6. 2021Statistical Inference with M-Estimators on Adaptively Collected Datacited by 40
  7. 2015Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Playscited by 38
  8. 2020Causal Inference under Networked Interference and Intervention Policy Enhancementcited by 38
  9. 2018Balanced Linear Contextual Banditscited by 30
  10. 2020Power Constrained Banditscited by 30
  11. 2016Multiple-Play Bandits in the Position-Based Modelcited by 28
  12. 2022A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Banditscited by 28
24 more
  1. 2017Estimation Considerations in Contextual Banditscited by 23
  2. 2021Online Multi-Armed Bandits with Adaptive Inferencecited by 22
  3. 2019Combinatorial Bandits with Relative Feedbackcited by 19
  4. 2015A Survey of Online Experiment Design with the Stochastic Multi-Armed Banditcited by 18
  5. 2017A framework for Multi-A(rmed)/B(andit) testing with online FDR controlcited by 17
  6. 2021Treatment Effects in Market Equilibriumcited by 16
  7. 2021Causal inference with misspecified exposure mappings: separating definitions and assumptionscited by 14
  8. 2021Rate-Optimal Cluster-Randomized Designs for Spatial Interferencecited by 14
  9. 2017Budget-Constrained Multi-Armed Bandits with Multiple Playscited by 13
  10. 2019Online Debiasing for Adaptively Collected High-dimensional Data with Applications to Time Series Analysiscited by 13
  11. 2022Communication Efficient Federated Learning for Generalized Linear Banditscited by 13
  12. 2023Causal clustering: design of cluster experiments under network interferencecited by 10
  13. 2024Multi-Armed Bandits with Interferencecited by 10
  14. 2023An Experimental Design for Anytime-Valid Causal Inference on Multi-Armed Banditscited by 9
  15. 2024Multi-Armed Bandits with Network Interferencecited by 8
  16. 2024Linear Contextual Bandits with Interferencecited by 8
  17. 2021Network Cluster-Robust Inferencecited by 6
  18. 2023Adversarial Attacks on Online Learning to Rank with Stochastic Click Modelscited by 6
  19. 2023Pure Exploration in Asynchronous Federated Banditscited by 6
  20. 2023Individualized Policy Evaluation and Learning under Clustered Network Interferencecited by 6
  21. 2024Reward Maximization for Pure Exploration: Minimax Optimal Good Arm Identification for Nonparametric Multi-Armed Banditscited by 5
  22. 2024Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariatescited by 5
  23. 2020Dynamic Window-level Granger Causality of Multi-channel Time Seriescited by 4
  24. 2022Partial Identification with Proxy of Latent Confoundings via Sum-of-ratios Fractional Programmingcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 3.

9 papers.