This paper is a contemporary review of QMC (‘quasi-Monte Carlo’) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s , where s may be large, or even infinite. After a general introduction, the paper surveys recent developments in lattice methods, digital nets, and related themes. Among those recent developments are methods of construction of both lattices and digital nets, to yield QMC rules that have a prescribed rate of convergence for sufficiently smooth functions, and ideally also guaranteed slow growth (or no growth) of the worst-case error as s increases. A crucial role is played by parameters called ‘weights’, since a careful use of the weight parameters is needed to ensure that the worst-case errors in an appropriately weighted function space are bounded, or grow only slowly, as the dimension s increases. Important tools for the analysis are weighted function spaces, reproducing kernel Hilbert spaces, and discrepancy, all of which are discussed with an appropriate level of detail.
Quasi-Monte Carlo (QMC) methods are known to achieve faster convergence rates than Monte Carlo (MC), but their effectiveness in high dimensions often relies on additional structure, such as low effective dimension or carefully chosen coordinate weights. Moreover, in many applications one has access only to random samples rather than deterministic QMC constructions. In this work, we extend the recent method of N. Bansal and H. Jiang and construct high-dimensional QMC point sets from random samples via combinatorial discrepancy. We establish error bounds for these constructions in weighted function spaces, including settings with low effective dimension in both the superposition and truncation senses. We also implement the resulting Subgaussian Transference algorithm and present numerical experiments to assess empirically the performance of these constructions.
Despite possessing the low-discrepancy property, the classical d-dimensional Halton sequence is known to exhibit poorly distributed projections when
dbecomes even moderately large. This, in turn, often implies bad performance when implemented in quasi-Monte Carlo (QMC) methods in comparison to, for example, the Sobol’ sequence. As an attempt to eradicate this issue, we propose an adapted Halton sequence built by integer and irrational based van der Corput sequences and show empirically improved performance with respect to the accuracy of estimates in numerical integration and simulation. In addition, for the first time, a scrambling algorithm is proposed for irrational based digital sequences.
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
L2 integrands with a dimension-independent constant. The median trick then enables near-optimal convergence for function classes beyond
L2: for
Lp integrands with
p∈(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
Hwav,α,s,p,q with
αp:=α−(1/p−1/2)+>0, we prove a high-probability error bound of
O(N−αp−1/2+ε) for any
ε>0; the bound improves to
O(N−r−αp−1/2+ε) when the integrand has dominating mixed derivatives of order
r≥1 that belong to
Hwav,α,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.
Abstract A crude Monte Carlo (MC) method allows to calculate integrals over a d-dimensional cube. As the number N of integration nodes becomes large, the rate of probable error of the MC method decreases as O ( 1 / N ) {O(1/\sqrt{N})} . The use of quasi-random points instead of random points in the MC algorithm converts it to the quasi-Monte Carlo (QMC) method. The asymptotic error estimate of QMC integration of d-dimensional functions contains a multiplier 1 / N {1/N} . However, the multiplier ( ln N ) d {(\ln N)^{d}} is also a part of the error estimate, which makes it virtually useless. We have proved that, in the general case, the QMC error estimate is not limited to the factor 1 / N {1/N} . However, our numerical experiments show that using quasi-random points of Sobol sequences with N = 2 m {N=2^{m}} with natural m makes the integration error approximately proportional to 1 / N {1/N} . In our numerical experiments, d ≤ 15 {d\leq 15} , and we used N ≤ 2 40 {N\leq 2^{40}} points generated by the SOBOLSEQ16384 code published in 2011. In this code, d ≤ 2 14 {d\leq 2^{14}} and N ≤ 2 63 {N\leq 2^{63}} .