econ.EMDate pending

Synthetic Blips: Generalizing Synthetic Controls for Dynamic Treatment Effects

Authors: Anish AgarwalSukjin HanDwaipayan SahaVasilis SyrgkanisHaeyeon Yoon

Abstract

We propose a generalization of the synthetic control methods to the setting with dynamic treatment effects, in which each unit receives multiple treatments sequentially, according to an adaptive policy that depends on a latent, endogenously time-varying confounding state. Under a low-rank latent factor model assumption, which admits linear time-varying and time-invariant dynamic triangular systems as special cases, we develop an identification strategy for any unit-specific mean outcome under any sequence of interventions. Our method, which we term synthetic blips, is a backward induction process in which the blip effect of a treatment at each period for a target unit is recursively expressed as a linear combination of the blip effects of other units that received the designated treatment, avoiding the combinatorial donor requirements of naive synthetic control extensions. We provide easy-to-implement estimation algorithms that yield consistent estimators. Using unique Korean firm-level panel data, we estimate individualized dynamic treatment effects and optimal allocation rules in the context of financial support for exporting firms.

Explore similar work

Sep 21, 2026stat.ML

Exponential Family Synthetic Controls

We develop exponential family synthetic controls (EFSC), a distributional version of synthetic controls for a panel of datasets. Each cell of the panel corresponds to a dataset drawn from an exponential family whose natural parameters factorize probabilistically across units and times. We estimate the latent factors using black-box variational inference. This replaces the usual weighted-average view of synthetic controls with a flexible probabilistic model that operates on full distributions. We propose causal estimands based on divergences between pre- and post-intervention distributions induced by the posterior of the natural parameters, together with distributional placebo tests to support causal inference and assess the significance of the estimated effects. We validate the proposed framework on synthetic and real data. Across a variety of exponential-family distributions, EFSC accurately recovers causal effects induced by exponential tilts, together with the corresponding divergences between treated and counterfactual distributions. The framework also captures effects induced by structural perturbations of the latent factors and by heavy-tailed noise contamination. Finally, we apply EFSC to study the expansion of Medicaid under the Affordable Care Act (ACA) and its impact on the distribution of health insurance coverage across U.S. states. Code is available at https://github.com/blei-lab/efsc.
Hector Rodriguez-Deniz, David M. Blei
Jul 27, 2026stat.ME

Spectral Truncation in Synthetic Control

Synthetic control (SC) matches a treated unit's pre-treatment trajectory to a weighted combination of donor units. We study Spectral SC, which instead matches the treated unit in coordinates defined by the leading temporal singular vectors of the donor panel, and a hybrid estimator that places separately tunable weight on retained and discarded directions, nesting raw-path SC and truncated Spectral SC as endpoints. We prove that the family reduces exactly to raw-path SC at full rank, that exact balance on KK retained dimensions with N0N_0 donors is underdetermined whenever N0>K+1N_0>K+1, with an affine solution set of dimension N0K1N_0-K-1, and that spectral imbalance maps to treatment-effect bias through a finite-sample best-linear-predictor decomposition. We evaluate the estimators across eleven data-generating regimes, using 400400 replications per regime and donor-only placebo validation to select regularization and the mixing weight. Truncated Spectral SC has significantly higher RMSE than tuned raw-path SC in every regime, with paired differences equal to 44 to 1111 Monte Carlo standard errors. The hybrid estimator selects raw-path matching in most replications and is statistically indistinguishable from tuned SC in most regimes. The result is highly sensitive to preprocessing. With raw inputs, the performance gap is large; after removing unit and time fixed effects before spectral decomposition, as suggested by the assumptions behind our bound, the gap nearly disappears and placebo validation begins to favor truncation. We interpret these findings diagnostically rather than as evidence that Spectral SC should replace raw-path SC. Basis-estimation noise, balancing underdetermination, and fixed-effects contamination determine when spectral matching can help.
Mojtaba Eslami
May 7, 2026stat.ML

Dynamic Treatment on Networks

In networks, effective dynamic treatment allocation requires deciding both whom to treat and also when, so as to amplify policy impact through spillovers. An early intervention at a well-connected node can trigger cascades that change which nodes are worth targeting in the next period. Existing treatment strategies under network interference are largely static while dynamic treatment frameworks typically ignore network structure altogether. We integrate these perspectives and propose Q-Ising, a three-stage pipeline that (i) estimates network adoption dynamics via a Bayesian dynamic Ising model from a single observed panel, (ii) augments treatment adoption histories with continuous posterior latent states, and (iii) learns a dynamic policy via offline reinforcement learning. The Bayesian mechanism enables uncertainty quantification over dynamic decisions, yielding posterior ensemble policies with interpretable spillover estimates. We provide a finite-sample regret upper bound that decomposes into standard offline-RL uncertainty, network abstraction error, and first stage error in Ising state estimation. We apply our method to data from Indian village microfinance networks and synthetic stochastic block models under simulated heterogeneous susceptible-infected-susceptible (SIS) dynamics and demonstrate that adaptive targeting outperforms static centrality benchmarks.
Bengusu Nar, Jiguang Li, Veronika Ročková +1