Achieving High Convergence Rates by Quasi-Monte Carlo and Importance Sampling for Unbounded Integrands

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-10-21 DOI:10.1137/23m1622489
Du Ouyang, Xiaoqun Wang, Zhijian He
{"title":"Achieving High Convergence Rates by Quasi-Monte Carlo and Importance Sampling for Unbounded Integrands","authors":"Du Ouyang, Xiaoqun Wang, Zhijian He","doi":"10.1137/23m1622489","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 5, Page 2393-2414, October 2024. <br/> Abstract. We consider the problem of estimating an expectation [math] by quasi-Monte Carlo (QMC) methods, where [math] is an unbounded smooth function and [math] is a standard normal random vector. While the classical Koksma–Hlawka inequality cannot be directly applied to unbounded functions, we establish a novel framework to study the convergence rates of QMC for unbounded smooth integrands. We propose a projection method to modify the unbounded integrands into bounded and smooth ones, which differs from the low variation extension strategy of avoiding the singularities along the boundary of the unit cube [math] in Owen [SIAM Rev., 48 (2006), pp. 487–503]. The total error is then bounded by the quadrature error of the transformed integrand and the projection error. We prove that if the function [math] and its mixed partial derivatives do not grow too fast as the Euclidean norm [math] tends to infinity, then projection-based QMC and randomized QMC (RQMC) methods achieve an error rate of [math] with a sample size [math] and an arbitrarily small [math]. However, the error rate turns out to be only [math] when the functions grow exponentially as [math] with [math]. Remarkably, we find that using importance sampling with [math]-distribution as the proposal can dramatically improve the root mean squared error of RQMC from [math] to [math].","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":"125 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1622489","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

SIAM Journal on Numerical Analysis, Volume 62, Issue 5, Page 2393-2414, October 2024.
Abstract. We consider the problem of estimating an expectation [math] by quasi-Monte Carlo (QMC) methods, where [math] is an unbounded smooth function and [math] is a standard normal random vector. While the classical Koksma–Hlawka inequality cannot be directly applied to unbounded functions, we establish a novel framework to study the convergence rates of QMC for unbounded smooth integrands. We propose a projection method to modify the unbounded integrands into bounded and smooth ones, which differs from the low variation extension strategy of avoiding the singularities along the boundary of the unit cube [math] in Owen [SIAM Rev., 48 (2006), pp. 487–503]. The total error is then bounded by the quadrature error of the transformed integrand and the projection error. We prove that if the function [math] and its mixed partial derivatives do not grow too fast as the Euclidean norm [math] tends to infinity, then projection-based QMC and randomized QMC (RQMC) methods achieve an error rate of [math] with a sample size [math] and an arbitrarily small [math]. However, the error rate turns out to be only [math] when the functions grow exponentially as [math] with [math]. Remarkably, we find that using importance sampling with [math]-distribution as the proposal can dramatically improve the root mean squared error of RQMC from [math] to [math].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用准蒙特卡罗和重要性采样实现无界积分的高收敛率
SIAM 数值分析期刊》第 62 卷第 5 期第 2393-2414 页,2024 年 10 月。 摘要。我们考虑了用准蒙特卡罗(QMC)方法估计期望 [math] 的问题,其中 [math] 是一个无界光滑函数,[math] 是一个标准正态随机向量。虽然经典的 Koksma-Hlawka 不等式不能直接应用于无界函数,但我们建立了一个新颖的框架来研究无界光滑积分的 QMC 收敛率。我们提出了一种投影方法,将无界积分修改为有界光滑积分,这种方法不同于欧文[SIAM Rev., 48 (2006), pp.然后,总误差由变换积分的正交误差和投影误差限定。我们证明,如果函数 [math] 及其混合偏导数不会随着欧几里得规范 [math] 趋于无穷大而增长过快,那么基于投影的 QMC 和随机 QMC (RQMC) 方法在样本量 [math] 和任意小 [math] 的情况下,误差率可达 [math]。然而,当函数以[math]为[math]的指数增长时,误差率仅为[math]。值得注意的是,我们发现使用[math]分布的重要性采样作为建议,可以将 RQMC 的均方根误差从[math]大幅提高到[math]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
期刊最新文献
On the Existence of Minimizers in Shallow Residual ReLU Neural Network Optimization Landscapes A Domain Decomposition Method for Stochastic Evolution Equations New Time Domain Decomposition Methods for Parabolic Optimal Control Problems II: Neumann–Neumann Algorithms The Mean-Field Ensemble Kalman Filter: Near-Gaussian Setting The Lanczos Tau Framework for Time-Delay Systems: Padé Approximation and Collocation Revisited
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1