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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:一般两步估计理论没有专门对应的细分,但摘要明确以资产定价模型为比较场景,因此选择资产定价方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
David T. Frazier
Eric Renault

通过目标化实现高效两步估计

研究问题
当两步估计旨在简化目标参数自身的复杂出现方式时,如何避免一致性问题,并保持第二步估计的渐近效率?
方法与思路
作者提出计算简便的两步程序,结合目标化与惩罚约束来确保一致性,并在 copula 模型和资产定价模型中比较迭代方法。
材料陈述的贡献
摘要称所提程序维持第二步估计的渐近效率,模拟中表现优于既有迭代程序,同时计算成本近乎相同。
阅读关注点
应核对目标化和惩罚项的定义、一致性与效率条件,以及两类应用中与迭代方法比较所采用的误差和计算指标。
阅读边界
仅据所给出版社摘要,不能认定任意两步估计都可如此恢复效率;具体惩罚选择、理论条件及模拟优势幅度未说明。

原文摘要

The standard description of two-step extremum estimation amounts to plugging-in a first-step estimator of nuisance parameters to simplify the optimization problem and then deducing a user friendly, but potentially inefficient, estimator for the parameters of interest. In this paper, we consider a more general setting of two-step estimation where we do not necessarily have ‘nuisance parameters’ but rather awkward occurrences of the parameters of interest. The efficiency problem associated with two-step estimators in this context is more difficult than with standard nuisance parameters as even if the true unknown value of the parameters were plugged-in to alleviate the awkward occurrences of the parameters, the resulting second-step estimator may not be efficient. In addition, standard approaches to restore efficiency for two-step procedures may not work due to a consistency issue. To alleviate this potential issue, we propose a new computationally simple two-step estimation procedure that relies on targeting and penalization to enforce consistency, with the second-step estimators maintaining asymptotic efficiency. We compare this new method with existing iterative methods in the framework of copula models and asset pricing models. Simulation results illustrate that this new method performs better than existing iterative procedures and is (nearly) computationally equivalent.

笔记与分组
相关领域论文