Math 2.0

Numerical analysis Monte Carlo and quasi-Monte Carlo methods Theorem

Importance sampling

Builds on Variance reductionMonte Carlo methodProbability density functionVarianceCauchy–Schwarz inequality

Statement

Let pp and gg be probability density functions on ℝd\R^d, and let h ⁣:ℝd→ℝh \colon \R^d \to \R be measurable with ∫∣h∣ p<∞\int \abs{h}\, p < \infty and q=∫h(x)p(x) dxq = \int h(x) p(x)\, dx. Assume that g(x)>0g(x) > 0 whenever h(x)p(x)≠0h(x) p(x) \ne 0. Let Y1,…,YnY_1, \ldots, Y_n be independent with density gg, and let q^n=1n∑i=1nh(Yi) p(Yi)g(Yi),\hat q_n = \frac{1}{n} \sum_{i=1}^{n} h(Y_i)\, \frac{p(Y_i)}{g(Y_i)}, with the convention that a term with g(Yi)=0g(Y_i) = 0 is 00. Then:

  1. 𝔼q^n=q\mathbb E \hat q_n = q;
  2. Var⁡q^n=1n(∫h(x)2p(x)2g(x) dx−q2)\operatorname{Var} \hat q_n = \frac{1}{n} \left( \int \frac{h(x)^2 p(x)^2}{g(x)}\, dx - q^2 \right), where the integral runs over {g>0}\set{g > 0} and may be +∞+\infty;
  3. among all such gg, the variance is smallest for g∗=∣h∣p/∫∣h∣pg^* = \abs{h} p / \int \abs{h} p (when ∫∣h∣p>0\int \abs{h} p > 0), and its minimum is 1n((∫∣h∣p)2−q2)\frac1n \bigl( (\int \abs{h} p)^2 - q^2 \bigr); in particular it is 00 if h≥0h \ge 0.

Remarks

Clause 1: 𝔼[h(Y)p(Y)/g(Y)]=∫g>0hp=q\mathbb E[h(Y) p(Y)/g(Y)] = \int_{g > 0} h p = q, since hp=0h p = 0 where g=0g = 0. Clause 2 is the same computation for the second moment, divided by nn for independent samples. Clause 3 follows from the Cauchy–Schwarz inequality: (∫∣h∣p)2=(∫∣h∣pgg)2≤∫h2p2g\left( \int \abs{h} p \right)^2 = \left( \int \frac{\abs{h} p}{\sqrt g} \sqrt g \right)^2 \le \int \frac{h^2 p^2}{g}, with equality when gg is proportional to ∣h∣p\abs{h} p. The optimal g∗g^* needs ∫∣h∣p\int \abs{h} p, which is essentially the unknown; in practice one picks gg close in shape to ∣h∣p\abs{h} p. Example: let XX be standard normal and q=P(X>4)≈3.17×10−5q = P(X > 4) \approx 3.17 \times 10^{-5}. Plain sampling sees almost no hits. Sampling from the normal density with mean 44 puts half the samples in the event and reduces the relative error by orders of magnitude. A badly chosen gg with lighter tails than ∣h∣p\abs{h} p can make the integral in clause 2 infinite, so the estimate converges very slowly and erratically.

Going deeper

For a student

This is a variance reduction technique for the Monte Carlo method, and also a change of measure: gg defines a new probability measure and p/gp/g is the Radon–Nikodym derivative. When pp is known only up to a constant, one uses the self-normalised estimator ∑wih(Yi)/∑wi\sum w_i h(Y_i) / \sum w_i with wi=p(Yi)/g(Yi)w_i = p(Y_i)/g(Y_i), which is biased but consistent. The effective sample size (∑wi)2/∑wi2(\sum w_i)^2 / \sum w_i^2 is a common diagnostic of weight degeneracy. In rare-event simulation, exponential tilting of pp is a standard way to build gg, and in sequential Monte Carlo the idea is applied step by step.

Reading path

To understand this page from the ground up, read these 11 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. Monte Carlo method concept
  2. Probability density function concept
  3. Variance concept
  4. Variance reduction concept
  5. Vector space definition
  6. Inner product definition
  7. Norm definition
  8. Inner product space definition
  9. Norm induced by an inner product definition
  10. Cauchy–Schwarz inequality statement
  11. Importance sampling statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Importance_sampling
About this page
Tag4PPT08K2M1
URIm2://4PPT08K2M1
Kindstatement, theorem
WritingW0 stub
MSC65C05, 62D05
StatusThis copy of the site has no build data. Run m2 status 4PPT08K2M1.
AboutVariance reduction
UsesVariance reduction, Monte Carlo method, Probability density function, Variance, Cauchy–Schwarz inequality
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.