2023/08/19 by Klebanov, Ilja, Sullivan, T. J. · 1 citation
#11K36 #62D99 #65C05 #65D32 #65D40 #FOS: Computer and information sciences #FOS: Mathematics #Methodology (stat.ME) #Numerical Analysis (math.NA)
paper · doi:10.48550/arxiv.2308.10081
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 ℙtar using transport maps: if ℙtar = T_# ℙref is the pushforward of an easily-sampled probability distribution ℙref under the transport map T, then the application of T to ℙref-distributed samples yields ℙtar-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 original convergence rates that are often better than N-1/2, N being the number of samples/quadrature nodes. Our main result is the derivation of an explicit transport map for the case that ℙtar is a mixture of simple distributions, e.g. a Gaussian mixture, in which case application of the transport map T requires the solution of an explicit ODE with closed-form right-hand side. Mixture distributions are of particular applicability and interest since many methods proceed by first approximating ℙtar by a mixture and then sampling from that mixture (often using importance reweighting). Hence, this paper allows for the sampling step to provide a better convergence rate than N-1/2 for all such methods.