Graph-Regularized Synthetic Control for Stable Counterfactual Estimation under Donor Redundancy
Abstract
Synthetic control methods estimate counterfactual outcomes by weighting untreated donor units to match a treated unit before treatment. In recent applications, however, the donor pool can be large, highly correlated, and short in pre-treatment history, yielding many near-equivalent solutions with unstable and difficult-to-interpret donor weights. We propose Graph-Regularized Synthetic Control (Graph-SC), a convex estimator that augments the classical pre-treatment matching objective with a graph Laplacian penalty. The graph encodes similarity among donor trajectories, encouraging coherent weights over structurally related donors while preserving the transparency of synthetic controls. We provide theoretical results characterizing the bias-variance tradeoff induced by graph regularization and establish efficient convergence guarantees with an accelerated proximal gradient method. Across a controlled simulation under donor redundancy, the California Proposition 99 benchmark, and observational counterfactual analyses on the Waymo Open Motion Dataset, Graph-SC improves weight stability, reduces sensitivity to redundant donor pools, and maintains competitive pre- and post-treatment accuracy relative to classical and regularized synthetic control baselines. Our results suggest that graph regularization is most valuable not as a universal accuracy booster, but as a principled mechanism for selecting stable and interpretable counterfactuals from near-equivalent synthetic controls with comparable pre-treatment fit.
Related
- Robust Estimation under Spurious Correlation via Statistical Counterfactual Augmentation
- Regularized Small Area Estimation with Graph Laplacian Benchmarking priors
- Regularized Estimation of Spatial Patterns
- Online Control via Counterfactual Tracking
- Entropy-Regularized Optimal Transport for Time-Varying Multi-Agent Coverage Control
BibTeX
@misc{zhang2026graphregularized,
title = {{Graph-Regularized Synthetic Control for Stable Counterfactual Estimation under Donor Redundancy}},
author = {Yanlin Zhang and Sungyong Chung and Alireza Talebpour},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.24113},
eprint = {2610.24113},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.24113},
}
RIS
TY - UNPB
TI - Graph-Regularized Synthetic Control for Stable Counterfactual Estimation under Donor Redundancy
AU - Yanlin Zhang
AU - Sungyong Chung
AU - Alireza Talebpour
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.24113
UR - https://arxiv.org/abs/2610.24113
AB - Synthetic control methods estimate counterfactual outcomes by weighting untreated donor units to match a treated unit before treatment. In recent applications, however, the donor pool can be large, highly correlated, and short in pre-treatment history, yielding many near-equivalent solutions with unstable and difficult-to-interpret donor weights. We propose Graph-Regularized Synthetic Control (Graph-SC), a convex estimator that augments the classical pre-treatment matching objective with a graph Laplacian penalty. The graph encodes similarity among donor trajectories, encouraging coherent weights over structurally related donors while preserving the transparency of synthetic controls. We provide theoretical results characterizing the bias-variance tradeoff induced by graph regularization and establish efficient convergence guarantees with an accelerated proximal gradient method. Across a controlled simulation under donor redundancy, the California Proposition 99 benchmark, and observational counterfactual analyses on the Waymo Open Motion Dataset, Graph-SC improves weight stability, reduces sensitivity to redundant donor pools, and maintains competitive pre- and post-treatment accuracy relative to classical and regularized synthetic control baselines. Our results suggest that graph regularization is most valuable not as a universal accuracy booster, but as a principled mechanism for selecting stable and interpretable counterfactuals from near-equivalent synthetic controls with comparable pre-treatment fit.
ER -