arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2610.26576econ.EMstat.ME
收藏

合成控制法:一种精确的几何公式化

Synthetic Control: An Exact Geometric Formulation

MIT(麻省理工学院)

Alberto Abadie, Yucheng Shang

AI总结:

本文为合成控制法推导精确几何解,将非凸双层优化替换为快速枚举法,通过加州烟草控制计划等应用验证了其优势。

摘要:

合成控制法将受处理单元与供体单元的凸组合进行匹配,每个预测变量的相对重要性由权重矩阵$V$决定。在标准实践中,$V$通过双层优化问题选择,该问题非凸且缺乏收敛性保证。本文为合成控制估计量推导了一种精确的几何解:对于任意正定矩阵$V$,合成控制由受处理单元的预测变量在$V$加权范数下投影到供体预测变量凸包上得到;当$V$在其候选类中变化时,这些投影会追踪可实现的合成控制集合,我们对该集合进行了刻画。当受处理单元的预测向量位于供体预测变量凸包之外时,一般正定$V$下的可实现集合是从受处理单元可见的供体凸包的面的并集;对于对角$V$,符号兼容性检验可识别该可实现集合。当受处理单元位于凸包内部时,存在精确匹配,我们选择使受处理单元与构成合成控制的每个供体之间的成对匹配差异的平均值最小的那个。这些刻画将双层优化替换为一种快速枚举方法,该方法保证能在可实现集合上提供全局最优解。此外,选择供体权重的Karush-Kuhn-Tucker条件刻画了能合理化任意给定供体权重集的正定预测变量权重矩阵集合。将该方法应用于加州烟草控制计划和德国统一的经济效应,说明了所提方法优于现有实践的优势。

英文摘要:

The synthetic control method matches a treated unit to a convex combination of donor units, with the relative importance of each predictor determined by a weight matrix $V$. In standard practice, $V$ is selected through a bi-level optimization problem that is nonconvex and lacks convergence guarantees. This article derives an exact geometric solution for synthetic control estimators. For any positive definite $V$, a synthetic control is given by the projection of the treated unit's predictors onto the convex hull of the donor predictors under a $V$-weighted norm. As $V$ varies over its candidate class, these projections trace out the set of attainable synthetic controls. We characterize this set. When the predictor vector of the treated unit lies outside the convex hull of the donor predictors, the attainable set under general positive definite $V$ is the union of the facets of the donor hull that are visible from the treated unit. For diagonal $V$, a sign-compatibility test identifies the attainable set. When the treated unit lies inside the hull, exact matches exist. We select the one that minimizes the average of the pairwise matching discrepancies between the treated unit and each of the donors contributing to the synthetic control. These characterizations replace bi-level optimization with a fast enumeration method that is guaranteed to deliver the global optimum over the attainable set. Moreover, the Karush-Kuhn-Tucker conditions for the selection of donor weights characterize the set of positive definite predictor weight matrices that rationalize any given set of donor weights. Applications to the California tobacco control program and to the economic effects of German reunification illustrate the advantages of the proposed procedure over existing practice.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑