Variance Reduction for Monte Carlo Methods

2018 ◽  
Vol 482 (6) ◽  
pp. 627-630
Author(s):  
D. Belomestny ◽  
◽  
L. Iosipoi ◽  
N. Zhivotovskiy ◽  
◽  
...  
Acta Numerica ◽  
1998 ◽  
Vol 7 ◽  
pp. 1-49 ◽  
Author(s):  
Russel E. Caflisch

Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N−1/2), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Carlo quadrature is attained using quasi-random (also called low-discrepancy) sequences, which are a deterministic alternative to random or pseudo-random sequences. The points in a quasi-random sequence are correlated to provide greater uniformity. The resulting quadrature method, called quasi-Monte Carlo, has a convergence rate of approximately O((logN)kN−1). For quasi-Monte Carlo, both theoretical error estimates and practical limitations are presented. Although the emphasis in this article is on integration, Monte Carlo simulation of rarefied gas dynamics is also discussed. In the limit of small mean free path (that is, the fluid dynamic limit), Monte Carlo loses its effectiveness because the collisional distance is much less than the fluid dynamic length scale. Computational examples are presented throughout the text to illustrate the theory. A number of open problems are described.


2009 ◽  
Vol 41 (01) ◽  
pp. 63-100 ◽  
Author(s):  
G. N. Milstein ◽  
M. V. Tretyakov

We consider Monte Carlo methods for the classical nonlinear filtering problem. The first method is based on a backward pathwise filtering equation and the second method is related to a backward linear stochastic partial differential equation. We study convergence of the proposed numerical algorithms. The considered methods have such advantages as a capability in principle to solve filtering problems of large dimensionality, reliable error control, and recurrency. Their efficiency is achieved due to the numerical procedures which use effective numerical schemes and variance reduction techniques. The results obtained are supported by numerical experiments.


2009 ◽  
Vol 41 (1) ◽  
pp. 63-100 ◽  
Author(s):  
G. N. Milstein ◽  
M. V. Tretyakov

We consider Monte Carlo methods for the classical nonlinear filtering problem. The first method is based on a backward pathwise filtering equation and the second method is related to a backward linear stochastic partial differential equation. We study convergence of the proposed numerical algorithms. The considered methods have such advantages as a capability in principle to solve filtering problems of large dimensionality, reliable error control, and recurrency. Their efficiency is achieved due to the numerical procedures which use effective numerical schemes and variance reduction techniques. The results obtained are supported by numerical experiments.


Sign in / Sign up

Export Citation Format

Share Document