Numerical analysis Monte Carlo and quasi-Monte Carlo methods Theorem
Multilevel Monte Carlo method
Builds on Monte Carlo methodVariance reductionExpected valueVarianceMean squared error
Statement
Let be a random variable with finite expected value. Let be random variables on the same probability space, the approximations of at levels , and set . For each level let be an estimator of built from independent samples, with total cost . Let the be independent. Suppose there are positive constants with such that for all :
- ;
- ;
- ;
- .
Then there is a constant with the following property. For every there are a level and sample sizes such that the estimator satisfies the following. Its mean squared error is , and its expected total cost is
Remarks
The telescoping sum shows that estimates without bias, so its mean squared error is the squared bias plus . One chooses by clause 1 so that the bias is below . The then minimise the cost under the constraint . A Lagrange multiplier gives proportional to , where and are the variance and cost of one sample on level . The variance decay in clause 3 comes from coupling: and are computed from the same random input, so their difference is small. Example: consider , where solves a stochastic differential equation and is Lipschitz. Under standard conditions, the Euler–Maruyama scheme with time steps gives , and . So the cost is , against for plain Monte Carlo with the same scheme. In the case the cost has the same order as plain Monte Carlo with exact samples of at unit cost.
Going deeper
For a student
The method, introduced by Giles for stochastic differential equations, is related to earlier multilevel work of Heinrich on parametric integration. It is a recursive variance reduction: each level acts as a control variate for the next. The three regimes of the theorem say whether the cost is dominated by the coarsest levels (), spread evenly (), or dominated by the finest level (). The Milstein scheme improves the strong convergence and gives in many scalar problems, which moves the Euler–Maruyama case to the optimal regime . The same framework applies to partial differential equations with random coefficients, where the levels are finite element meshes.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Expected value concept
- Mean squared error concept
- Monte Carlo method concept
- Variance concept
- Variance reduction concept
- Multilevel Monte Carlo method statement
Further reading
About this page
| Tag | B4FA03XDVW |
|---|---|
| URI | m2://B4FA03XDVW |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65C05, 65C30 |
| Status | This copy of the site has no build data. Run m2 status B4FA03XDVW. |
| About | Monte Carlo method |
| Uses | Monte Carlo method, Variance reduction, Expected value, Variance, Mean squared error |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.