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

部分识别计量经济学模型的线性规划方法

The Linear Programming Approach to Partially Identified Models

UCLA(加州大学洛杉矶分校)

Andrei Voronin

AI总结:

本文针对部分识别计量模型的LP值估计,提出根n一致的新估计量,推导一般识别下的LP精确界,并提出cMIV假设应用于哥伦比亚教育回报率估计,得出大学教育至少提升5.5%平均工资的结论。

摘要:

部分识别参数的精确界通常由线性规划(LP)的值给出。本文提出了一种全新的LP值估计量。与现有方法不同,只要总体LP可行且取值有限,我们的估计量在概率测度上逐点满足根n一致性。该估计量在点识别、过度识别约束和解多重性的情形下均有效。\n关于一致性的一致性质,我们证明了若不对可能分布的集合加以限制,无法对LP值进行一致一致估计。随后我们表明,在任何此类估计量存在所需的最弱条件下,我们的估计量可实现一致一致性。我们得到了计算高效、渐近正态的推断程序,该程序在任意固定概率测度下具有精确的渐近覆盖率。\n为补充我们的估计结果,我们在一般识别设定下推导了LP精确界。我们将研究发现应用于教育回报率估计。为此,我们提出了条件单调工具变量假设(cMIV),该假设收紧了经典单调工具变量(MIV)界,且在较弱的正则条件下可检验。在cMIV假设下,哥伦比亚的大学教育被证明可使平均工资至少提高5.5%,而经典条件无法给出有信息量的界。

英文摘要:

In many partially identified models, sharp bounds on structural or causal parameters are values of linear programs (LPs) with estimated coefficients. We introduce a debiased penalty estimator of the LP value. It is pointwise root-n-consistent whenever the population feasible set is nonempty and bounded. Although no estimator is uniformly consistent over the unrestricted collection of distributions, ours retains a one-sided guarantee: the extent to which it can overestimate a sharp lower bound vanishes uniformly. Under a condition ruling out weak identification of the bound, it is also uniformly consistent. We develop two inference procedures exploiting LP structure: a simple pointwise procedure with exact asymptotic coverage, and a uniformly valid procedure. In simulations calibrated to Holmes (2011), our estimator avoids the anticonservative bias of unregularized benchmark estimators and the conservativeness of the set expansion estimator. Both inference procedures deliver reliable coverage, small excess length, and orders-of-magnitude computational gains over test-inversion benchmarks.

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

↑