REVIEW 1 cited by
Graph Neural Networks: Theory for Estimation with Application on Network Heterogeneity
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
read the original abstract
This paper presents a novel application of graph neural networks for modeling and estimating network heterogeneity. Network heterogeneity is characterized by variations in unit's decisions or outcomes that depend not only on its own attributes but also on the conditions of its surrounding neighborhood. We delineate the convergence rate of the graph neural networks estimator, as well as its applicability in semiparametric causal inference with heterogeneous treatment effects. The finite-sample performance of our estimator is evaluated through Monte Carlo simulations. In an empirical setting related to microfinance program participation, we apply the new estimator to examine the average treatment effects and outcomes of counterfactual policies, and to propose an enhanced strategy for selecting the initial recipients of program information in social networks.
Forward citations
Cited by 1 Pith paper
-
Balancing Interference and Correlation in Spatial Experimental Designs: A Causal Graph Cut Approach
A surrogate for the ATE estimator's MSE is optimized with spectral graph cuts to produce cluster-randomized designs that adapt to the spatial covariance and accommodate moderate-to-large interference.
Discussion (0). Continue with ORCID to comment.