Quasi-Monte Carlo methods for mixture distributions and approximated distributions via piecewise linear interpolation

• Published in: Advances in computational mathematics Vol. 51; no. 1
• Main Authors: Cui, Tiangang, Dick, Josef, Pillichshammer, Friedrich
• Format: Journal Article
• Language: English
• Published: New York Springer Nature B.V 01.02.2025
• Subjects: Adaptive algorithms; Adaptive sampling; Algorithms; Approximation; Convergence; Fields (mathematics); Mathematical analysis; Mathematics; Mixtures; Monte Carlo simulation; Normal distribution; Numerical integration; Probability density functions; Random sampling; Sequences; Tensors
• ISSN: 1019-7168; 1572-9044
• DOI: 10.1007/s10444-025-10223-1

We study numerical integration over bounded regions in $$\mathbb {R}^s$$ R s , $$s \ge 1$$ s ≥ 1 , with respect to some probability measure. We replace random sampling with quasi-Monte Carlo methods, where the underlying point set is derived from deterministic constructions which aim to fill the space more evenly than random points. Ordinarily, such quasi-Monte Carlo point sets are designed for the uniform measure, and the theory only works for product measures when a coordinate-wise transformation is applied. Going beyond this setting, we first consider the case where the target density is a mixture distribution where each term in the mixture comes from a product distribution. Next, we consider target densities which can be approximated with such mixture distributions. In order to be able to use an approximation of the target density, we require the approximation to be a sum of coordinate-wise products and that the approximation is positive everywhere (so that they can be re-scaled to probability density functions). We use tensor product hat function approximations for this purpose here, since a hat function approximation of a positive function is itself positive. We also study more complex algorithms, where we first approximate the target density with a general Gaussian mixture distribution and approximate this mixture distribution with an adaptive hat function approximation on rotated intervals. The Gaussian mixture approximation allows us (at least to some degree) to locate the essential parts of the target density, whereas the adaptive hat function approximation allows us to approximate the finer structure of the target density. We prove convergence rates for each of the integration techniques based on quasi-Monte Carlo sampling for integrands with bounded partial mixed derivatives. The employed algorithms are based on digital ( t ,  s )-sequences over the finite field $$\mathbb {F}_2$$ F 2 and an inversion method. Numerical examples illustrate the performance of the algorithms for some target densities and integrands.