跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:核心是通用线性与非线性矩条件推断,线性工具变量仅为特例,不足以限定到所列细分。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者

矩条件模型中对识别强度与奇异性稳健的推断

研究问题
当矩条件模型的识别较弱,或矩方差等相关矩阵出现奇异性时,如何构造计算快速、仍能一致保持渐近检验水平的程序?
方法与思路
作者提出对识别和奇异性稳健的条件准似然比检验及 Anderson–Rubin 检验,研究其一致渐近性质,并扩展到子向量假设。
材料陈述的贡献
摘要称,两种检验具有正确渐近水平和一致渐近相似性;条件准似然比检验在强及半强识别下达到所述 GMM 渐近效率。
阅读关注点
应核对弱条件的完整范围、奇异矩阵的处理方式、与 CLR 检验等价的具体情形,以及子向量推断对其余参数强识别的要求。
阅读边界
仅依据所给 Crossref 摘要版本;渐近水平不等于有限样本精确水平,摘要未给出实际计算耗时,子向量结论也有额外识别要求。

原文摘要

This paper introduces a new identification‐ and singularity‐robust conditional quasi‐likelihood ratio (SR‐CQLR) test and a new identification‐ and singularity‐robust Anderson and Rubin (1949) (SR‐AR) test for linear and nonlinear moment condition models. Both tests are very fast to compute. The paper shows that the tests have correct asymptotic size and are asymptotically similar (in a uniform sense) under very weak conditions. For example, in i.i.d. scenarios, all that is required is that the moment functions and their derivatives have 2 + γ bounded moments for some γ > 0. No conditions are placed on the expected Jacobian of the moment functions, on the eigenvalues of the variance matrix of the moment functions, or on the eigenvalues of the expected outer product of the (vectorized) orthogonalized sample Jacobian of the moment functions. The SR‐CQLR test is shown to be asymptotically efficient in a GMM sense under strong and semi‐strong identification (for all k ≥ p , where k and p are the numbers of moment conditions and parameters, respectively). The SR‐CQLR test reduces asymptotically to Moreira's CLR test when p = 1 in the homoskedastic linear IV model. The same is true for p ≥ 2 in most, but not all, identification scenarios. We also introduce versions of the SR‐CQLR and SR‐AR tests for subvector hypotheses and show that they have correct asymptotic size under the assumption that the parameters not under test are strongly identified. The subvector SR‐CQLR test is shown to be asymptotically efficient in a GMM sense under strong and semi‐strong identification.

笔记与分组
相关领域论文