Implicit profiling estimation for semiparametric models with bundled parameters

IF 1.2 3区 数学 Q2 STATISTICS & PROBABILITY
{"title":"Implicit profiling estimation for semiparametric models with bundled parameters","authors":"","doi":"10.1007/s00362-023-01519-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Solving semiparametric models can be computationally challenging because the dimension of parameter space may grow large with increasing sample size. Classical Newton’s method becomes quite slow and unstable with an intensive calculation of the large Hessian matrix and its inverse. Iterative methods separately updating parameters for the finite dimensional component and the infinite dimensional component have been developed to speed up single iterations, but they often take more steps until convergence or even sometimes sacrifice estimation precision due to sub-optimal update direction. We propose a computationally efficient implicit profiling algorithm that achieves simultaneously the fast iteration step in iterative methods and the optimal update direction in Newton’s method by profiling out the infinite dimensional component as the function of the finite-dimensional component. We devise a first-order approximation when the profiling function has no explicit analytical form. We show that our implicit profiling method always solves any local quadratic programming problem in two steps. In two numerical experiments under semiparametric transformation models and GARCH-M models, as well as a real application using NTP data, we demonstrated the computational efficiency and statistical precision of our implicit profiling method. Finally, we implement the proposed implicit profiling method in the R package <em>SemiEstimate</em></p>","PeriodicalId":51166,"journal":{"name":"Statistical Papers","volume":"13 1","pages":""},"PeriodicalIF":1.2000,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Statistical Papers","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00362-023-01519-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

Abstract

Solving semiparametric models can be computationally challenging because the dimension of parameter space may grow large with increasing sample size. Classical Newton’s method becomes quite slow and unstable with an intensive calculation of the large Hessian matrix and its inverse. Iterative methods separately updating parameters for the finite dimensional component and the infinite dimensional component have been developed to speed up single iterations, but they often take more steps until convergence or even sometimes sacrifice estimation precision due to sub-optimal update direction. We propose a computationally efficient implicit profiling algorithm that achieves simultaneously the fast iteration step in iterative methods and the optimal update direction in Newton’s method by profiling out the infinite dimensional component as the function of the finite-dimensional component. We devise a first-order approximation when the profiling function has no explicit analytical form. We show that our implicit profiling method always solves any local quadratic programming problem in two steps. In two numerical experiments under semiparametric transformation models and GARCH-M models, as well as a real application using NTP data, we demonstrated the computational efficiency and statistical precision of our implicit profiling method. Finally, we implement the proposed implicit profiling method in the R package SemiEstimate

带有捆绑参数的半参数模型的隐式剖析估计
摘要 半参数模型的求解在计算上具有挑战性,因为参数空间的维度可能会随着样本量的增加而变大。经典的牛顿法需要大量计算庞大的 Hessian 矩阵及其逆矩阵,因此变得相当缓慢且不稳定。为了加快单次迭代速度,人们开发了分别更新有限维分量和无限维分量参数的迭代方法,但这些方法往往需要更多步骤才能收敛,甚至有时会由于更新方向不够理想而牺牲估计精度。我们提出了一种计算效率很高的隐式剖析算法,通过将无限维分量剖析为有限维分量的函数,同时实现迭代法中的快速迭代步长和牛顿法中的最优更新方向。当剖析函数没有明确的解析形式时,我们设计了一种一阶近似方法。我们的研究表明,我们的隐式剖析法总是能在两步内解决任何局部二次编程问题。在半参数变换模型和 GARCH-M 模型下的两个数值实验中,以及使用 NTP 数据的实际应用中,我们证明了隐式剖析方法的计算效率和统计精度。最后,我们在 R 软件包 SemiEstimate 中实现了所提出的隐式剖析方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Statistical Papers
Statistical Papers 数学-统计学与概率论
CiteScore
2.80
自引率
7.70%
发文量
95
审稿时长
6-12 weeks
期刊介绍: The journal Statistical Papers addresses itself to all persons and organizations that have to deal with statistical methods in their own field of work. It attempts to provide a forum for the presentation and critical assessment of statistical methods, in particular for the discussion of their methodological foundations as well as their potential applications. Methods that have broad applications will be preferred. However, special attention is given to those statistical methods which are relevant to the economic and social sciences. In addition to original research papers, readers will find survey articles, short notes, reports on statistical software, problem section, and book reviews.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信