🤖 AI Summary
To address the instability of counterfactual predictions in Synthetic Control Methods (SCM) when the number of donor units exceeds the number of time periods (N > T), this paper proposes an information-entropy-regularized SCM with relaxed constraints. Building upon the standard simplex constraints—nonnegativity and unit-sum weights—the method introduces relaxed linear inequality constraints and minimizes the Shannon entropy of the weight distribution, thereby promoting intra-group weight balance and mitigating overfitting. Theoretically, the estimator achieves oracle prediction performance asymptotically. Monte Carlo simulations and empirical analysis—including an evaluation of Brexit’s impact on UK real GDP—demonstrate that the proposed method significantly improves both predictive accuracy and robustness relative to conventional SCM, particularly in high-dimensional donor pools and short-time-series settings.
📝 Abstract
The synthetic control method (SCM) is widely used for constructing the counterfactual of a treated unit based on data from control units in a donor pool. Allowing the donor pool contains more control units than time periods, we propose a novel machine learning algorithm, named SCM-relaxation, for counterfactual prediction. Our relaxation approach minimizes an information-theoretic measure of the weights subject to a set of relaxed linear inequality constraints in addition to the simplex constraint. When the donor pool exhibits a group structure, SCM-relaxation approximates the equal weights within each group to diversify the prediction risk. Asymptotically, the proposed estimator achieves oracle performance in terms of out-of-sample prediction accuracy. We demonstrate our method by Monte Carlo simulations and by an empirical application that assesses the economic impact of Brexit on the United Kingdom's real GDP.