arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.09627econ.EMmath.STstat.TH
收藏

随机优化推理:一个免费午餐的自助程序

Inference by Stochastic Optimization: A Free-Lunch Bootstrap

Jean-Jacques Forneron, Serena Ng

摘要:

当渐近方差不容易解析时,评估极值估计中的采样不确定性可能具有挑战性。Bootstrap推理提供了一个可行的解决方案,但计算成本很高,特别是当模型很复杂时。本文使用一个专门设计的随机优化算法的迭代作为借鉴,从点估计和自助标准误差可以计算在一个单一的运行。绘制是由梯度和Hessian生成的,这些梯度和Hessian是从每次迭代时重新采样的数据批次中计算出来的。我们表明,这些提请产生一致的估计和渐近有效的频率论推理的一大类经常性问题。该算法提供了准确的标准误差在模拟的例子和经验的应用,在低计算成本。从算法中得出的结论也提供了一种方便的方法来检测数据的不规则性。

英文摘要:

Assessing sampling uncertainty in extremum estimation can be challenging when the asymptotic variance is not analytically tractable. Bootstrap inference offers a feasible solution but can be computationally costly especially when the model is complex. This paper uses iterates of a specially designed stochastic optimization algorithm as draws from which both point estimates and bootstrap standard errors can be computed in a single run. The draws are generated by the gradient and Hessian computed from batches of data that are resampled at each iteration. We show that these draws yield consistent estimates and asymptotically valid frequentist inference for a large class of regular problems. The algorithm provides accurate standard errors in simulation examples and empirical applications at low computational costs. The draws from the algorithm also provide a convenient way to detect data irregularities.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑