{"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].
期刊介绍:
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.