Confidence Sets under Weak Identification: Theory and Practice
弱识别下的置信集:理论与实践AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
本页为预印本版本;arXiv 收录、作者填写的期刊信息以及作者既有发表经历,都不单独证明本篇已接收。作者发表记录按 OpenAlex 身份与完整姓名、本站覆盖期刊 ISSN 及正式卷期核对,只展示已核实例,档案仍可能误合并。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要围绕线性工具变量模型的弱识别稳健推断,直接关联工具变量因果推断方法;未提供其他细分方向的充分依据。
弱识别下的置信集:理论与实践AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We develop new methods for constructing confidence sets and intervals in linear instrumental variables (IV) models based on tests that remain valid under weak identification and under heteroskedastic, autocorrelated, or clustered errors. In practice, researchers typically recover such sets by grid search, a procedure that can miss parts of the confidence region, truncate unbounded sets, and deliver misleading inference. We replace grid inversion with exact and approximation-based methods that are both reliable and computationally efficient. Our approach exploits the polynomial and rational structure of the Anderson-Rubin and Lagrange multiplier statistics to obtain exact confidence sets via polynomial root finding. For the conditional quasi-likelihood ratio test, we derive an exact inversion algorithm based on the geometry of the statistic and its critical value function. For more general conditional tests, we construct polynomial approximations whose coverage error vanishes with approximation degree, allowing numerical accuracy to be made arbitrarily high. In many empirical applications with weak instruments, standard grid methods produce incorrect confidence regions, while our procedures reliably recover sets with correct nominal coverage. The framework extends beyond linear IV to models with piecewise polynomial or rational moment conditions, offering a general tool for reliable weak-identification robust inference.