Synthetic Principal Component Design: Fast Covariate Balancing with Synthetic Controls
Not on the map. Why?
Abstract (arXiv)
The optimal design of experiments typically involves solving an NP-hard combinatorial optimization problem. In this paper, we aim to develop a globally convergent and practically efficient optimization algorithm. Specifically, we consider a setting where the pre-treatment outcome data is available and the synthetic control estimator is invoked. The average treatment effect is estimated via the difference between the weighted average outcomes of the treated and control units, where the weights are learned from the observed data. Under this setting, we surprisingly observed that the optimal experimental design problem could be reduced to a so-called textitphase synchronization problem. We solve this problem via a normalized variant of the generalized power method with spectral initialization. On the theoretical side, we establish the first global optimality guarantee for experiment design when pre-treatment data is sampled from certain data-generating processes. Empirically, we conduct extensive experiments to demonstrate the effectiveness of our method on both the US Bureau of Labor Statistics and the Abadie-Diemond-Hainmueller California Smoking Data. In terms of the root mean square error, our algorithm surpasses the random design by a large margin.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 58 references that are in the map. First posted on arXiv 28 Nov 2022.
Builds on
24 of 58 references.
References · 24
- 2015An Introduction to Matrix Concentration Inequalitiescited by 397
- 2014Phase Retrieval via Wirtinger Flow: Theory and Algorithmscited by 125
- 2020Spectral Methods for Data Science: A Statistical Perspectivecited by 112
- 2015Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systemscited by 50
- 2018Synthetic Difference in Differencescited by 41
- 2016Covariate Balancing Propensity Score by Tailored Loss Functionscited by 34
- 2017Near-optimal bounds for phase synchronizationcited by 32
- 2016Nonconvex phase synchronizationcited by 30
- 2014Optimization Techniques on Riemannian Manifoldscited by 27
- 2017Robust Synthetic Controlcited by 25
- 2014Tightness of the maximum likelihood semidefinite relaxation for angular synchronizationcited by 23
- 2014Riemannian preconditioningcited by 19
12 more
- 2016On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronizationcited by 17
- 2015Sync-Rank: Robust Ranking, Constrained Ranking and Rank Aggregation via Eigenvector and Semidefinite Programming Synchronizationcited by 14
- 2019Balancing Covariates in Randomized Experiments with the Gram-Schmidt Walk Designcited by 13
- 2021On the Assumptions of Synthetic Control Methodscited by 12
- 2017The Gram-Schmidt Walk: A Cure for the Banaszczyk Bluescited by 10
- 2018Improvements on SCORE, Especially for Weak Signalscited by 5
- 2020Non-Convex Exact Community Recovery in Stochastic Block Modelcited by 5
- 2021Synthetic Controls for Experimental Designcited by 5
- 2021Synthetic Design: An Optimization Approach to Experimental Design with Synthetic Controlscited by 3
- 2016An Algorithm for Koml'os Conjecture Matching Banaszczyk's boundcited by 2
- 2021Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for ℓ1-Norm Principal Component Analysiscited by 2
- 2020On the Optimality of Randomization in Experimental Design: How to Randomize for Minimax Variance and Design-Based Inferencecited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Spectral Truncation in Synthetic Controlcited by 0
- 2026Spectral Truncation in Synthetic Control27 Jul 2026