mlsanityData to 7 Oct 2026

Cascade-based Randomization for Inferring Causal Effects under Diffusion Interference

arXiv 2405.12340 ↗First posted 20 May 2024cs.LG cs.SIcited by 2

Not on the map. Why?

Abstract (arXiv)

The presence of interference, where the outcome of an individual may depend on the treatment assignment and behavior of neighboring nodes, can lead to biased causal effect estimation. Current approaches to network experiment design focus on limiting interference through cluster-based randomization, in which clusters are identified using graph clustering, and cluster randomization dictates the node assignment to treatment and control. However, cluster-based randomization approaches perform poorly when interference propagates in cascades, whereby the response of individuals to treatment propagates to their multi-hop neighbors. When we have knowledge of the cascade seed nodes, we can leverage this interference structure to mitigate the resulting causal effect estimation bias. With this goal, we propose a cascade-based network experiment design that initiates treatment assignment from the cascade seed node and propagates the assignment to their multi-hop neighbors to limit interference during cascade growth and thereby reduce the overall causal effect estimation error. Our extensive experiments on real-world and synthetic datasets demonstrate that our proposed framework outperforms the existing state-of-the-art approaches in estimating causal effects in network data.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 19 of its 95 references that are in the map. First posted on arXiv 20 May 2024.

Builds on

19 of 95 references.

References · 19

  1. 2018Datasheets for Datasetscited by 1,371
  2. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  3. 2018Characterizing and Detecting Hateful Users on Twittercited by 55
  4. 2016DeepCas: an End-to-end Predictor of Information Cascadescited by 48
  5. 2013Graph cluster randomization: network exposure to multiple universescited by 42
  6. 2014Design and analysis of experiments in networks: Reducing bias from interferencecited by 41
  7. 2020Experimental Design in Two-Sided Platforms: An Analysis of Biascited by 39
  8. 2014Can Cascades be Predicted?cited by 31
  9. 2015Influence maximization in complex networks through optimal percolationcited by 20
  10. 2014Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithmcited by 14
  11. 2020Randomized Graph Cluster Randomizationcited by 14
  12. 2020Reducing Interference Bias in Online Marketplace Pricing Experimentscited by 13
7 more
  1. 2015Inferring Graphs from Cascades: A Sparse Recovery Frameworkcited by 9
  2. 2021Design and Analysis of Bipartite Experiments under a Linear Exposure-Response Modelcited by 9
  3. 2017Testing for arbitrary interference on experimentation platformscited by 8
  4. 2020Minimizing Interference and Selection Bias in Network Experiment Designcited by 8
  5. 2022Cluster Randomized Designs for One-Sided Bipartite Experimentscited by 6
  6. 2019Using Ego-Clusters to Measure Network Effects at LinkedIncited by 3
  7. 2020On the Aggression Diffusion Modeling and Minimization in Online Social Networkscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.