Pith. sign in

REVIEW 1 cited by

Estimating Peer Direct and Indirect Effects in Observational Network Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.11492 v2 pith:K4EUH2SX submitted 2024-08-21 cs.AI

classification cs.AI
keywords effectspeercausaldatanetworkapplicationsdirectestimate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Estimating causal effects is crucial for decision-makers in many applications, but it is particularly challenging with observational network data due to peer interactions. Many algorithms have been proposed to estimate causal effects involving network data, particularly peer effects, but they often overlook the variety of peer effects. To address this issue, we propose a general setting which considers both peer direct effects and peer indirect effects, and the effect of an individual's own treatment, and provide identification conditions of these causal effects and proofs. To estimate these causal effects, we utilize attention mechanisms to distinguish the influences of different neighbors and explore high-order neighbor effects through multi-layer graph neural networks (GNNs). Additionally, to control the dependency between node features and representations, we incorporate the Hilbert-Schmidt Independence Criterion (HSIC) into the GNN, fully utilizing the structural information of the graph, to enhance the robustness and accuracy of the model. Extensive experiments on two semi-synthetic datasets confirm the effectiveness of our approach. Our theoretical findings have the potential to improve intervention strategies in networked systems, with applications in areas such as social networks and epidemiology.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Are Heterogeneous Graph Neural Networks Truly Effective for Node Classification? A Causal Perspective

    cs.LG 2025-10 reject novelty 5.0 of 10

    A large benchmark suggests tuned RGCN matches complex HGNNs and heterogeneous graphs help mainly via homophily and local-global label discrepancy, but the causal analysis is circular.

Pith tools