arXiv Machine Learning By Xiaojing Du

When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects

Read the original on arXiv Machine Learning →

The paper introduces a controlled contrast framework for estimating peer effects when interaction graphs evolve, indexing potential outcomes by own treatment, temporally aggregated peer exposure, and a post‑assignment evolution summary. It proposes the Dynamic Network Doubly Robust estimator (DynaNet‑DR), which uses a temporally factorized propensity and normalized augmentation to achieve consistency under standard causal assumptions. Semi‑synthetic benchmarks on real temporal graph sequences demonstrate that DynaNet‑DR achieves favorable estimation accuracy compared to other methods, and an observational study on MathOverflow illustrates its practical application.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Aug 20

Transportable Causal Effect Estimation across Networks under Interference

The paper introduces TranCE, a doubly‑robust algorithm for estimating causal effects when an intervention is applied to one network but the interest lies in another, differing network. By extending selection diagrams to capture covariate and structural network shifts, the authors derive transport formulas for direct, spillover, and total effects, and validate the method on semi‑synthetic social‑network benchmarks and a real weather‑insurance field experiment.

By Xiaojing Du, Jiuyong Li, Lin Liu, Debo Cheng, Jixue Liu, Thuc Duy Le