Quasi-random sampling for multivariate distributions via generative neural networks
This provides a more flexible and efficient method for risk management and other applications requiring variance reduction in estimates under dependence, though it is incremental as it builds on existing quasi-Monte Carlo and neural network techniques.
The paper tackles the problem of generating quasi-random samples from multivariate distributions, which was previously limited to specific models, by introducing Generative Moment Matching Networks (GMMNs) that enable this for a wider variety of distributions, including empirical ones, and demonstrate variance reduction in numerical examples.
Generative moment matching networks (GMMNs) are introduced for generating quasi-random samples from multivariate models with any underlying copula in order to compute estimates under variance reduction. So far, quasi-random sampling for multivariate distributions required a careful design, exploiting specific properties (such as conditional distributions) of the implied parametric copula or the underlying quasi-Monte Carlo (QMC) point set, and was only tractable for a small number of models. Utilizing GMMNs allows one to construct quasi-random samples for a much larger variety of multivariate distributions without such restrictions, including empirical ones from real data with dependence structures not well captured by parametric copulas. Once trained on pseudo-random samples from a parametric model or on real data, these neural networks only require a multivariate standard uniform randomized QMC point set as input and are thus fast in estimating expectations of interest under dependence with variance reduction. Numerical examples are considered to demonstrate the approach, including applications inspired by risk management practice. All results are reproducible with the demos GMMN_QMC_paper, GMMN_QMC_data and GMMN_QMC_timings as part of the R package gnn.