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

双重机器学习中的病态正交分数

Ill-Conditioned Orthogonal Scores in Double Machine Learning

Universidad del Pacífico(太平洋大学)

Gabriel Saco

AI总结:

本文研究了双重机器学习中正交分数雅可比矩阵的条件数问题,推导了PLR-DML估计量的精确恒等式,并提出通过诊断方法评估模型脆弱性。

摘要:

双重机器学习通常通过干扰率条件来论证,但有限样本的可靠性也依赖于正交分数雅可比矩阵的条件数。这种条件数通常被假设而非跟踪。当残差化处理方差较小时,雅可比矩阵会变得病态,导致小的系统性干扰误差被放大,从而名义上的置信区间可能看起来精确但系统性地低估了覆盖率。我们的主要结果是交叉拟合PLR-DML估计量的一个精确恒等式,无需泰勒近似。从这个恒等式中,我们推导出一个随机阶界,将Oracle噪声与条件放大干扰余项分开,并得出根n推断的充分条件。我们进一步通过里斯代表将放大因子与半参数效率几何联系起来,并使用三角数组框架来刻画随着残差处理方差减弱而变化的区域。这些结果促使一种折中诊断,总结了隐含的放大尺度。我们不提出通用阈值。相反,我们建议在交叉学习者敏感性总结中报告诊断作为脆弱性评估,通过模拟和实证例子进行说明。

英文摘要:

Double Machine Learning is often justified by nuisance-rate conditions, yet finite-sample reliability also depends on the conditioning of the orthogonal-score Jacobian. This conditioning is typically assumed rather than tracked. When residualized treatment variance is small, the Jacobian is ill-conditioned and small systematic nuisance errors can be amplified, so nominal confidence intervals may look precise yet systematically under-cover. Our main result is an exact identity for the cross-fitted PLR-DML estimator, with no Taylor approximation. From this identity, we derive a stochastic-order bound that separates oracle noise from a conditioning-amplified nuisance remainder and yields a sufficiency condition for root-n-inference. We further connect the amplification factor to semiparametric efficiency geometry via the Riesz representer and use a triangular-array framework to characterize regimes as residual treatment variation weakens. These results motivate an out-of-fold diagnostic that summarizes the implied amplification scale. We do not propose universal thresholds. Instead, we recommend reporting the diagnostic alongside cross-learner sensitivity summaries as a fragility assessment, illustrated in simulation and an empirical example.

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

↑