Math 2.0

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 PP be a random variable with finite expected value. Let P0,P1,P2,…P_0, P_1, P_2, \ldots be random variables on the same probability space, the approximations of PP at levels ℓ=0,1,2,…\ell = 0, 1, 2, \ldots, and set P−1=0P_{-1} = 0. For each level ℓ\ell let YℓY_\ell be an estimator of 𝔼[Pℓ−Pℓ−1]\mathbb E[P_\ell - P_{\ell - 1}] built from NℓN_\ell independent samples, with total cost CℓC_\ell. Let the YℓY_\ell be independent. Suppose there are positive constants α,β,γ,c1,c2,c3\alpha, \beta, \gamma, c_1, c_2, c_3 with α≥12min⁡(β,γ)\alpha \ge \frac12 \min(\beta, \gamma) such that for all ℓ≥0\ell \ge 0:

  1. ∣𝔼[Pℓ−P]∣≤c12−αℓ\abs{\mathbb E[P_\ell - P]} \le c_1 2^{-\alpha \ell};
  2. 𝔼Yℓ=𝔼[Pℓ−Pℓ−1]\mathbb E Y_\ell = \mathbb E[P_\ell - P_{\ell - 1}];
  3. Var⁡Yℓ≤c2Nℓ−12−βℓ\operatorname{Var} Y_\ell \le c_2 N_\ell^{-1} 2^{-\beta \ell};
  4. 𝔼Cℓ≤c3Nℓ2γℓ\mathbb E C_\ell \le c_3 N_\ell 2^{\gamma \ell}.

Then there is a constant c4c_4 with the following property. For every 0<ε<e−10 < \varepsilon < e^{-1} there are a level LL and sample sizes N0,…,NLN_0, \ldots, N_L such that the estimator Y=∑ℓ=0LYℓY = \sum_{\ell = 0}^{L} Y_\ell satisfies the following. Its mean squared error is 𝔼[(Y−𝔼P)2]<ε2\mathbb E[(Y - \mathbb E P)^2] < \varepsilon^2, and its expected total cost is 𝔼∑ℓ=0LCℓ≤{c4 ε−2if β>γ,c4 ε−2(ln⁡ε)2if β=γ,c4 ε−2−(γ−β)/αif β<γ.\mathbb E \sum_{\ell=0}^{L} C_\ell \le \begin{cases} c_4\, \varepsilon^{-2} & \text{if } \beta > \gamma, \\ c_4\, \varepsilon^{-2} (\ln \varepsilon)^2 & \text{if } \beta = \gamma, \\ c_4\, \varepsilon^{-2 - (\gamma - \beta)/\alpha} & \text{if } \beta < \gamma. \end{cases}

Remarks

The telescoping sum 𝔼PL=∑ℓ=0L𝔼[Pℓ−Pℓ−1]\mathbb E P_L = \sum_{\ell=0}^{L} \mathbb E[P_\ell - P_{\ell-1}] shows that YY estimates 𝔼PL\mathbb E P_L without bias, so its mean squared error is the squared bias (𝔼[PL−P])2(\mathbb E[P_L - P])^2 plus ∑ℓVar⁡Yℓ\sum_\ell \operatorname{Var} Y_\ell. One chooses LL by clause 1 so that the bias is below ε/2\varepsilon/\sqrt2. The NℓN_\ell then minimise the cost under the constraint ∑ℓVar⁡Yℓ≤ε2/2\sum_\ell \operatorname{Var} Y_\ell \le \varepsilon^2/2. A Lagrange multiplier gives NℓN_\ell proportional to Vℓ/cℓ\sqrt{V_\ell / c_\ell}, where VℓV_\ell and cℓc_\ell are the variance and cost of one sample on level ℓ\ell. The variance decay in clause 3 comes from coupling: PℓP_\ell and Pℓ−1P_{\ell-1} are computed from the same random input, so their difference is small. Example: consider 𝔼 φ(ST)\mathbb E\, \varphi(S_T), where SS solves a stochastic differential equation and φ\varphi is Lipschitz. Under standard conditions, the Euler–Maruyama scheme with 2ℓ2^\ell time steps gives α=1\alpha = 1, β=1\beta = 1 and γ=1\gamma = 1. So the cost is O(ε−2(ln⁡ε)2)O(\varepsilon^{-2} (\ln \varepsilon)^2), against O(ε−3)O(\varepsilon^{-3}) for plain Monte Carlo with the same scheme. In the case β>γ\beta > \gamma the cost has the same order ε−2\varepsilon^{-2} as plain Monte Carlo with exact samples of PP 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 (β>γ\beta > \gamma), spread evenly (β=γ\beta = \gamma), or dominated by the finest level (β<γ\beta < \gamma). The Milstein scheme improves the strong convergence and gives β=2\beta = 2 in many scalar problems, which moves the Euler–Maruyama case β=γ\beta = \gamma to the optimal regime β>γ\beta > \gamma. 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Expected value concept
  2. Mean squared error concept
  3. Monte Carlo method concept
  4. Variance concept
  5. Variance reduction concept
  6. Multilevel Monte Carlo method statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Multilevel_Monte_Carlo_method
About this page
TagB4FA03XDVW
URIm2://B4FA03XDVW
Kindstatement, theorem
WritingW0 stub
MSC65C05, 65C30
StatusThis copy of the site has no build data. Run m2 status B4FA03XDVW.
AboutMonte Carlo method
UsesMonte 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.