mlsanityData to 7 Oct 2026

Optimizing Treatment Allocation in the Presence of Interference

arXiv 2410.00075 ↗First posted 30 Sep 2024cs.SI cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

In Influence Maximization (IM), the objective is to -- given a budget -- select the optimal set of entities in a network to target with a treatment so as to maximize the total effect. For instance, in marketing, the objective is to target the set of customers that maximizes the total response rate, resulting from both direct treatment effects on targeted customers and indirect, spillover, effects that follow from targeting these customers. Recently, new methods to estimate treatment effects in the presence of network interference have been proposed. However, the issue of how to leverage these models to make better treatment allocation decisions has been largely overlooked. Traditionally, in Uplift Modeling (UM), entities are ranked according to estimated treatment effect, and the top entities are allocated treatment. Since, in a network context, entities influence each other, the UM ranking approach will be suboptimal. The problem of finding the optimal treatment allocation in a network setting is textcolorredNP-hard, and generally has to be solved heuristically. To fill the gap between IM and UM, we propose OTAPI: Optimizing Treatment Allocation in the Presence of Interference to find solutions to the IM problem using treatment effect estimates. OTAPI consists of two steps. First, a causal estimator is trained to predict treatment effects in a network setting. Second, this estimator is leveraged to identify an optimal treatment allocation by integrating it into classic IM algorithms. We demonstrate that this novel method outperforms classic IM and UM approaches on both synthetic and semi-synthetic datasets.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 18 of its 61 references that are in the map. First posted on arXiv 30 Sep 2024.

Builds on

18 of 61 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2018How Powerful are Graph Neural Networks?cited by 4,355
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  5. 2016Learning Representations for Counterfactual Inferencecited by 327
  6. 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 254
  7. 2019Learning Individual Causal Effects from Networked Observational Datacited by 56
  8. 2016Identification and estimation of treatment and interference effects in observational studies on networkscited by 43
  9. 2020Causal Inference under Networked Interference and Intervention Policy Enhancementcited by 37
  10. 2023In Search of Insights, Not Magic Bullets: Towards Demystification of the Model Selection Dilemma in Heterogeneous Treatment Effect Estimationcited by 29
  11. 2021PyGAD: An Intuitive Genetic Algorithm Python Librarycited by 24
  12. 2014Causal Diagrams for Interferencecited by 18
6 more
  1. 2020Learning to rank for uplift modelingcited by 18
  2. 2022Learning Individual Treatment Effects under Heterogeneous Interference in Networkscited by 11
  3. 2023Generalization bound for estimating causal effects from observational network datacited by 11
  4. 2013Estimating Average Causal Effects Under General Interference, with Application to a Social Network Experimentcited by 10
  5. 2020The foundations of cost-sensitive causal classificationcited by 7
  6. 2022Heterogeneous Peer Effects in the Linear Threshold Modelcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.