High-dimensional integration: The quasi-Monte Carlo way*†

@article{Dick2013HighdimensionalIT,
  title={High-dimensional integration: The quasi-Monte Carlo way*†},
  author={Josef Dick and Frances Y. Kuo and Ian H. Sloan},
  journal={Acta Numerica},
  year={2013},
  volume={22},
  pages={133 - 288}
}
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… 
Numerical integration in log-Korobov and log-cosine spaces
TLDR
A more refined estimate of the integration error using QMC rules for Korobov spaces with α arbitrarily close to 1/2 is given, and dimension independent error bounds are shown under the condition that ∑j=1∞γjmax{1,logγj−1}μ(1−λ)<∞, which shows that one can obtain error bounds which are independent of the dimension.
On Quasi-Monte Carlo Methods in Weighted ANOVA Spaces
TLDR
A formula for the worst case error of quasi-Monte Carlo rules for functions from weighted ANOVA spaces is provided and a general lower bound in terms of the number of used integration nodes is obtained.
Enhancing Quasi-Monte Carlo Simulation by Minimizing Effective Dimension for Derivative Pricing
Many problems in derivative pricing can be formulated as high-dimensional integrals. Many of them do not have closed-form solutions and have to be estimated by numerical integrations such as Monte
Quasi-Monte Carlo integration with product weights for elliptic PDEs with log-normal coefficients
Quasi-Monte Carlo (QMC) integration of output functionals of solutions of the diffusion problem with a log-normal random coefficient is considered. The random coefficient is assumed to be given by an
Derandomised lattice rules for high dimensional integration
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first
Multi-level Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic PDEs with Random Coefficients
TLDR
Families of QMC rules with “POD weights” (“product and order dependent weights’) which quantify the relative importance of subsets of the variables are found to be natural for proving convergence rates of Q MC errors that are independent of the number of parametric variables.
On the Choice of Weights in a Function Space for Quasi-Monte Carlo Methods for a Class of Generalised Response Models in Statistics
Evaluation of the likelihood of generalised response models in statistics leads to integrals over unbounded regions in high dimensions. In order to apply a quasi-Monte Carlo (QMC) method to
A Generic C++ Library for Multilevel Quasi-Monte Carlo
TLDR
The goal of the software presented in this paper is to allow recently developed quasi-Monte Carlo methods with high, dimension-independent orders of convergence to be combined with a multilevel approach and applied to large problems in a generic way, easing distributed memory parallel implementation.
Construction of Quasi-Monte Carlo Rules for Multivariate Integration in Spaces of Permutation-Invariant Functions
We study multivariate integration of functions that are invariant under the permutation (of a subset) of their arguments. Recently, in Nuyens et al. (Adv Comput Math 42(1):55–84, 2016), the authors
Monte Carlo with determinantal point processes
We show that repulsive random variables can yield Monte Carlo methods with faster convergence rates than the typical $N^{-1/2}$, where $N$ is the number of integrand evaluations. More precisely, we
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 354 REFERENCES
QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND
Abstract This paper is a contemporary review of quasi-Monte Carlo (QMC) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1]s. It
Quasi-Monte Carlo methods in finance
  • P. L'Ecuyer
  • Computer Science, Mathematics
    Proceedings of the 2004 Winter Simulation Conference, 2004.
  • 2004
We review the basic principles of quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variance-reduction techniques, and the main classes of constructions underlying their
Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
  • J. Dick
  • Mathematics, Computer Science
    SIAM J. Numer. Anal.
  • 2007
In this paper, we give explicit constructions of point sets in the $s$-dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
TLDR
It is proved that the minimalworst case error of quasi-Monte Carlo algorithms does not depend on the dimensiondiff the sum of the weights is finite, and the minimal number of function values in the worst case setting needed to reduce the initial error by ? is bounded byC??p, where the exponentp? 1, 2], andCdepends exponentially on thesum of weights.
The effective dimension and quasi-Monte Carlo integration
TLDR
This paper analyses certain function classes commonly used in QMC methods for empirical and theoretical investigations and shows that the problem of determining their effective dimension is analytically tractable.
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
TLDR
It is shown constructively using the Halton sequence that the e-exponent of tractability is 1, which implies that infinite dimensional integration is no harder than one-dimensional integration.
Randomly shifted lattice rules for unbounded integrands
TLDR
It is proved that good randomly shifted lattice rules can be constructed component by component to achieve a worst case error of order O(n-1/2), where the implied constant can be independent of d.
Quasi-Monte Carlo Numerical Integration on Rs: Digital Nets and Worst-Case Error
  • J. Dick
  • Mathematics, Computer Science
    SIAM J. Numer. Anal.
  • 2011
TLDR
It is proved that quasi-Monte Carlo-type rules for numerical integration of functions defined on $\mathbb{R}^s$ are optimal for numerical Integration in spaces of bounded fractional variation.
Finite-order weights imply tractability of multivariate integration
TLDR
This paper considers multivariate integration for the anchored and unanchored Sobolev spaces equipped with finite-order weights, and proves that classical low discrepancy sequences lead to error bounds with almost linear dependence on n-1 and polynomial dependence on d.
On Figures of Merit for Randomly-Shifted Lattice Rules
Randomized quasi-Monte Carlo (RQMC) can be seen as a variance reduction method that provides an unbiased estimator of the integral of a function f over the s-dimensional unit hypercube, with smaller
...
1
2
3
4
5
...