Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2001.08558 · IMA Journal of Numerical Analysis

Randomized sparse grid algorithms for multivariate integration on Haar wavelet spaces

M Wnuk, Michael Gnewuch

Published Dec 1, 2021• 2 citations
arXivHTMLPDF

Abstract

Abstract The deterministic sparse grid method, also known as Smolyak’s method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about randomized versions of the sparse grid method. In this paper we analyze randomized sparse grid algorithms, namely randomized sparse grid quadratures for multivariate integration on the $D$-dimensional unit cube $[0,1)^D$. Let $d,s \in {\mathbb {N}}$ be such that $D=d\cdot s$. The $s$-dimensional building blocks of the sparse grid quadratures are based on stratified sampling for $s=1$ and on scrambled $(0,m,s)$-nets for $s\ge 2$. The spaces of integrands and the error criterion we consider are Haar wavelet spaces with parameter $\alpha $ and the randomized error (i.e., the worst case root mean square error), respectively. We prove sharp (i.e., matching) upper and lower bounds for the convergence rates of the $N$th minimal errors for all possible combinations of the parameters $d$ and $s$. Our upper error bounds still hold if we consider as spaces of integrands Sobolev spaces of mixed dominated smoothness with smoothness parameters $1/2< \alpha < 1$ instead of Haar wavelet spaces.

DOI
10.1093/imanum/drab085

Related papers

Randomized Algorithms for High-Dimensional Integration and Approximation

Marcin Wnuk

We prove upper and lower error bounds for error of the randomized Smolyak algorithm and provide a thorough case study of applying the randomized Smolyak algorithm with the building blocks being quadratures based on scrambled nets for integration of functions coming from Haar-wavelets spaces. Moreover, we discuss different notions of negative dependence of randomized point sets which find applications in discrepancy theory and randomized quasi-Monte Carlo integration.

•Dec 20, 2019•0 citations

On the Randomization of Frolov's Algorithm for Multivariate Integration

David Krieg

We are concerned with the numerical integration of functions from the Sobolev space $H^{r,\text{mix}}([0,1]^d)$ of dominating mixed smoothness $r\in\mathbb{N}$ over the $d$-dimensional unit cube. In 1976, K. K. Frolov introduced a deterministic quadrature rule whose worst case error has the order $n^{-r} \, (\log n)^{(d-1)/2}$ with respect to the number $n$ of function evaluations. This is known to be optimal. 39 years later, Erich Novak and me introduced a randomized version of this algorithm using $d$ random dilations. We showed that its error is bounded above by a constant multiple of $n^{-r-1/2} \, (\log n)^{(d-1)/2}$ in expectation and by $n^{-r} \, (\log n)^{(d-1)/2}$ almost surely. The main term $n^{-r-1/2}$ is again optimal and it turns out that the very same algorithm is also optimal for the isotropic Sobolev space $H^s([0,1]^d)$ of smoothness $s>d/2$. We also added a random shift to this algorithm to make it unbiased. Just recently, Mario Ullrich proved that the expected error of the resulting algorithm on $H^{r,\text{mix}}([0,1]^d)$ is even bounded above by $n^{-r-1/2}$. This thesis is a review of the mentioned upper bounds and their proofs.

arXiv:1603.04637•Mar 15, 2016•1 citation

Randomized Smolyak algorithms based on digital sequences for multivariate integration

Josef Dick, Gunther Leobacher, Friedrich Pillichshammer

In this paper, we consider Smolyak algorithms based on quasi-Monte Carlo rules for high-dimensional numerical integration. The quasi-Monte Carlo rules employed here use digital (t, α, β, σ, d)-sequences as quadrature points. We consider the worst-case error for multivariate integration in certain Sobolev spaces and show that our quadrature rules achieve the optimal rate of convergence. By randomizing the underlying digital sequences, we can also obtain a randomized Smolyak algorithm. The bound on the worst-case error holds also for the randomized algorithm in a statistical sense. Further, we also show that the randomized algorithm is unbiased and that the integration error can be approximated as well.

IMA Journal of Numerical Analysis•Feb 17, 2007•5 citations

L2-approximation using randomized lattice algorithms

Mou Cai, Takashi Goda, Yoshihito Kazashi

We propose a randomized lattice algorithm for approximating multivariate periodic functions over the d -dimensional unit cube from the weighted Korobov space with mixed smoothness α > 1 / 2 and product weights γ 1 , γ 2 , … ∈ [ 0 , 1 ] . Building upon the deterministic lattice algorithm by Kuo et al. (2006), we incorporate a randomized quadrature rule by Dick et al. (2022) to accelerate the convergence rate. This randomization involves drawing the number of points for function evaluations randomly, and selecting a good generating vector for rank-1 lattice points using the randomized component-by-component algorithm. We prove that our randomized algorithm achieves a worst-case root mean squared L 2 -approximation error of order ɛ M − α ( 2 α + 1 ) / ( 4 α + 1 ) + ɛ for an arbitrarily small ɛ ɛ > 0 , where M denotes the maximum number of function evaluations, and that the error bound is independent of the dimension d if the weights satisfy ∑ j = 1 ∞ γ j 1 / α < ∞ . Our upper bound converges faster than a lower bound on the worst-case L 2 -approximation error for deterministic rank-1 lattice-based approximation proved by Byrenheid et al. (2017). We also show a lower error bound of order M − α / 2 − 1 / 2 for our randomized algorithm, leaving a slight gap between the upper and lower bounds open for future research.

arXiv:2409.18757•Journal of Approximation Theory•Apr 1, 2026•7 citations

Strong tractability of integration using scrambled Niederreiter points

Rong‐Xian Yue, Fred J. Hickernell

We study the randomized worst-case error and the randomized error of scrambled quasi–Monte Carlo (QMC) quadrature as proposed by Owen. The function spaces considered in this article are the weighted Hilbert spaces generated by Haar-like wavelets and the weighted Sobolev-Hilbert spaces. Conditions are found under which multivariate integration is strongly tractable in the randomized worst-case setting and the randomized setting , respectively. The ε \varepsilon -exponents of strong tractability are found for the scrambled Niederreiter nets and sequences. The sufficient conditions for strong tractability for Sobolev spaces are more lenient for scrambled QMC quadratures than those for deterministic QMC net quadratures.

Mathematics of Computation•Mar 3, 2005•12 citations

Robust high-dimensional integration using medians of coarsely scrambled Sobol' sequences

Ziyang Ye, Chaokun Zhu, Zexin Pan

We study the numerical approximation of high-dimensional integrals using randomized quasi-Monte Carlo (RQMC) methods, with a focus on scrambled Sobol' sequences. While asymptotically faster than Monte Carlo, classical RQMC suffers from error bounds that grow exponentially in the dimension $s$, and its root mean squared error (RMSE) convergence rate is generally no better than $O(N^{-3/2})$. To overcome these limitations, we combine two recent developments: Suzuki's coarse scrambling and the median trick. Coarse scrambling randomizes Sobol' sequences according to their generating base polynomials and significantly reduces the maximal gain coefficient. By appropriately choosing the base polynomials, we show that the coefficient can be made uniformly bounded in $s$, yielding an $O(N^{-1/2})$ RMSE for $L^2$ integrands with a dimension-independent constant. The median trick then enables near-optimal convergence for function classes beyond $L^2$: for $L^p$ integrands with $p\in(1,2)$, the median of independent coarsely scrambled estimates achieves an error of $O(N^{-1+1/p})$ with high probability; for integrands in the Haar wavelet space $\mathcal H_{\mathrm{wav},α,s,p,q}$ with $α_p:=α-(1/p-1/2)_+>0$, we prove a high-probability error bound of $O(N^{-α_p-1/2+\varepsilon})$ for any $\varepsilon>0$; the bound improves to $O(N^{-r-α_p-1/2+\varepsilon})$ when the integrand has dominating mixed derivatives of order $r\ge1$ that belong to $\mathcal H_{\mathrm{wav},α,s,p,q}$. The latter two bounds are uniform in $s$ under suitable conditions on the ANOVA components of the integrands. Numerical experiments confirm the predicted convergence rates and demonstrate the robustness of the proposed approach.

arXiv:2609.05979•Sep 5, 2026•0 citations
Abstract The deterministic sparse grid method, also known as Smolyak’s method, is a well-established and widely used tool to tackle multivariate approximation problems, and there is a vast literature on it. Much less is known about randomized versions of the sparse grid method. In this paper we analyze randomized sparse grid algorithms, namely randomized sparse grid quadratures for multivariate integration on the DDD-dimensional unit cube [0,1)D[0,1)^D[0,1)D. Let d,s∈Nd,s \in {\mathbb {N}}d,s∈N be such that D=d⋅sD=d\cdot sD=d⋅s. The sss-dimensional building blocks of the sparse grid quadratures are based on stratified sampling for s=1s=1s=1 and on scrambled (0,m,s)(0,m,s)(0,m,s)-nets for s≥2s\ge 2s≥2. The spaces of integrands and the error criterion we consider are Haar wavelet spaces with parameter α\alpha α and the randomized error (i.e., the worst case root mean square error), respectively. We prove sharp (i.e., matching) upper and lower bounds for the convergence rates of the NNNth minimal errors for all possible combinations of the parameters ddd and sss. Our upper error bounds still hold if we consider as spaces of integrands Sobolev spaces of mixed dominated smoothness with smoothness parameters 1/2<α<11/2< \alpha < 11/2<α<1 instead of Haar wavelet spaces.
We are concerned with the numerical integration of functions from the Sobolev space Hr,mix([0,1]d)H^{r,\text{mix}}([0,1]^d)Hr,mix([0,1]d) of dominating mixed smoothness r∈Nr\in\mathbb{N}r∈N over the ddd-dimensional unit cube. In 1976, K. K. Frolov introduced a deterministic quadrature rule whose worst case error has the order n−r (log⁡n)(d−1)/2n^{-r} \, (\log n)^{(d-1)/2}n−r(logn)(d−1)/2 with respect to the number nnn of function evaluations. This is known to be optimal. 39 years later, Erich Novak and me introduced a randomized version of this algorithm using ddd random dilations. We showed that its error is bounded above by a constant multiple of n−r−1/2 (log⁡n)(d−1)/2n^{-r-1/2} \, (\log n)^{(d-1)/2}n−r−1/2(logn)(d−1)/2 in expectation and by n−r (log⁡n)(d−1)/2n^{-r} \, (\log n)^{(d-1)/2}n−r(logn)(d−1)/2 almost surely. The main term n−r−1/2n^{-r-1/2}n−r−1/2 is again optimal and it turns out that the very same algorithm is also optimal for the isotropic Sobolev space Hs([0,1]d)H^s([0,1]^d)Hs([0,1]d) of smoothness s>d/2s>d/2s>d/2. We also added a random shift to this algorithm to make it unbiased. Just recently, Mario Ullrich proved that the expected error of the resulting algorithm on Hr,mix([0,1]d)H^{r,\text{mix}}([0,1]^d)Hr,mix([0,1]d) is even bounded above by n−r−1/2n^{-r-1/2}n−r−1/2. This thesis is a review of the mentioned upper bounds and their proofs.
In this paper, we consider Smolyak algorithms based on quasi-Monte Carlo rules for high-dimensional numerical integration. The quasi-Monte Carlo rules employed here use digital (t, α, β, σ, d)-sequences as quadrature points. We consider the worst-case error for multivariate integration in certain Sobolev spaces and show that our quadrature rules achieve the optimal rate of convergence. By randomizing the underlying digital sequences, we can also obtain a randomized Smolyak algorithm. The bound on the worst-case error holds also for the randomized algorithm in a statistical sense. Further, we also show that the randomized algorithm is unbiased and that the integration error can be approximated as well.
We propose a randomized lattice algorithm for approximating multivariate periodic functions over the d -dimensional unit cube from the weighted Korobov space with mixed smoothness α > 1 / 2 and product weights γ 1 , γ 2 , … ∈ [ 0 , 1 ] . Building upon the deterministic lattice algorithm by Kuo et al. (2006), we incorporate a randomized quadrature rule by Dick et al. (2022) to accelerate the convergence rate. This randomization involves drawing the number of points for function evaluations randomly, and selecting a good generating vector for rank-1 lattice points using the randomized component-by-component algorithm. We prove that our randomized algorithm achieves a worst-case root mean squared L 2 -approximation error of order ɛ M − α ( 2 α + 1 ) / ( 4 α + 1 ) + ɛ for an arbitrarily small ɛ ɛ > 0 , where M denotes the maximum number of function evaluations, and that the error bound is independent of the dimension d if the weights satisfy ∑ j = 1 ∞ γ j 1 / α < ∞ . Our upper bound converges faster than a lower bound on the worst-case L 2 -approximation error for deterministic rank-1 lattice-based approximation proved by Byrenheid et al. (2017). We also show a lower error bound of order M − α / 2 − 1 / 2 for our randomized algorithm, leaving a slight gap between the upper and lower bounds open for future research.
We study the randomized worst-case error and the randomized error of scrambled quasi–Monte Carlo (QMC) quadrature as proposed by Owen. The function spaces considered in this article are the weighted Hilbert spaces generated by Haar-like wavelets and the weighted Sobolev-Hilbert spaces. Conditions are found under which multivariate integration is strongly tractable in the randomized worst-case setting and the randomized setting , respectively. The ε \varepsilon -exponents of strong tractability are found for the scrambled Niederreiter nets and sequences. The sufficient conditions for strong tractability for Sobolev spaces are more lenient for scrambled QMC quadratures than those for deterministic QMC net quadratures.
We study the numerical approximation of high-dimensional integrals using randomized quasi-Monte Carlo (RQMC) methods, with a focus on scrambled Sobol' sequences. While asymptotically faster than Monte Carlo, classical RQMC suffers from error bounds that grow exponentially in the dimension sss, and its root mean squared error (RMSE) convergence rate is generally no better than O(N−3/2)O(N^{-3/2})O(N−3/2). To overcome these limitations, we combine two recent developments: Suzuki's coarse scrambling and the median trick. Coarse scrambling randomizes Sobol' sequences according to their generating base polynomials and significantly reduces the maximal gain coefficient. By appropriately choosing the base polynomials, we show that the coefficient can be made uniformly bounded in sss, yielding an O(N−1/2)O(N^{-1/2})O(N−1/2) RMSE for L2L^2L2 integrands with a dimension-independent constant. The median trick then enables near-optimal convergence for function classes beyond L2L^2L2: for LpL^pLp integrands with p∈(1,2)p\in(1,2)p∈(1,2), the median of independent coarsely scrambled estimates achieves an error of O(N−1+1/p)O(N^{-1+1/p})O(N−1+1/p) with high probability; for integrands in the Haar wavelet space Hwav,α,s,p,q\mathcal H_{\mathrm{wav},α,s,p,q}Hwav,α,s,p,q​ with αp:=α−(1/p−1/2)+>0α_p:=α-(1/p-1/2)_+>0αp​:=α−(1/p−1/2)+​>0, we prove a high-probability error bound of O(N−αp−1/2+ε)O(N^{-α_p-1/2+\varepsilon})O(N−αp​−1/2+ε) for any ε>0\varepsilon>0ε>0; the bound improves to O(N−r−αp−1/2+ε)O(N^{-r-α_p-1/2+\varepsilon})O(N−r−αp​−1/2+ε) when the integrand has dominating mixed derivatives of order r≥1r\ge1r≥1 that belong to Hwav,α,s,p,q\mathcal H_{\mathrm{wav},α,s,p,q}Hwav,α,s,p,q​. The latter two bounds are uniform in sss under suitable conditions on the ANOVA components of the integrands. Numerical experiments confirm the predicted convergence rates and demonstrate the robustness of the proposed approach.