Matching calipers and the precision of index estimation
匹配卡尺与指数估计的精度AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要将倾向得分或预后得分匹配的误差控制与处理效应估计的一致性直接联系。
匹配卡尺与指数估计的精度AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
This paper characterizes the precision of index estimation as it carries over into precision of matching. In a model assuming Gaussian covariates and making best-case assumptions about matching quality, it sharply characterizes average and worst-case discrepancies between paired differences of true versus estimated index values. In this optimistic setting, worst-case true and estimated index differences decline to zero if $p=o[n/(\log n)]$, the same restriction on model size that is needed for consistency of common index models. This remains so as the Gaussian assumption is relaxed to sub-gaussian, if in that case the characterization of paired index errors is less sharp. The formula derived under Gaussian assumptions is used as the basis for a matching caliper. Matching such that paired differences on the estimated index fall below this caliper brings the benefit that after matching, worst-case differences onan underlying index tend to 0 if $p = o\{[n/(\log n)]^{2/3}\}$. (With a linear index model, $p=o[n/(\log n)]$ suffices.) A proposed refinement of the caliper condition brings the same benefits without the sub-gaussian condition on covariates. When strong ignorability holds and the index is a well-specified propensity or prognostic score, ensuring in this way that worst-case matched discrepancies on it tend to 0 with increasing $n$ also ensures the consistency of matched estimators of the treatment effect.