Asymptotic efficiency of estimates for models with incidental nuisance parameters
附带干扰参数模型中估计量的渐近效率AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用附带参数效率理论,未明确涉及面板数据,不能仅凭附带参数概念归入面板方向。
附带干扰参数模型中估计量的渐近效率AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
In this paper we show that the well-known asymptotic efficiency bounds for full mixture models remain valid if individual sequences of nuisance parameters are considered. This is made precise both for some classes of random (i.i.d.) and nonrandom nuisance parameters. For the random case it is shown that superefficiency of the kind given by an example of Pfanzagl can happen only with low probability. The nonrandom case deals with permutation-invariant estimators under one-dimensional nuisance parameters. It is shown that the efficiency bounds remain valid for individual nonrandom arrays of nuisance parameters whose empirical process, if it is centered around its limit and standardized, satisfies a compactness condition. The compactness condition is satisfied in the random case with high probability. The results make use of basic LAN theory. Regularity conditions are stated in terms of $L^2$-differentiability.