Transporting Higher-Order Quadrature Rules: Quasi-Monte Carlo Points and Sparse Grids for Mixture Distributions
Ilja Klebanov, T. J. Sullivan

TL;DR
This paper develops a method to transform quasi-Monte Carlo points and sparse grids via explicit transport maps for mixture distributions, enabling higher convergence rates in high-dimensional integration tasks.
Contribution
It introduces an explicit transport map for mixture distributions that preserves convergence rates of advanced quadrature and sampling methods.
Findings
Transport maps for mixture distributions are explicitly derived.
Application of these maps improves convergence rates beyond $N^{-1/2}$.
Method is applicable to Gaussian mixtures and enhances sampling efficiency.
Abstract
Integration against, and hence sampling from, high-dimensional probability distributions is of essential importance in many application areas and has been an active research area for decades. One approach that has drawn increasing attention in recent years has been the generation of samples from a target distribution using transport maps: if is the pushforward of an easily-sampled probability distribution under the transport map , then the application of to -distributed samples yields -distributed samples. This paper proposes the application of transport maps not just to random samples, but also to quasi-Monte Carlo points, higher-order nets, and sparse grids in order for the transformed samples to inherit the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Markov Chains and Monte Carlo Methods · Probabilistic and Robust Engineering Design
