Math 2.0

Numerical analysis Monte Carlo and quasi-Monte Carlo methods Theorem

Antithetic variates

Builds on Variance reductionContinuous uniform distributionVarianceCovarianceChebyshev's sum inequality

Statement

Let f ⁣:(0,1)→ℝf \colon (0, 1) \to \R be monotone (non-decreasing or non-increasing) with ∫01f(u)2 du<∞\int_0^1 f(u)^2\, du < \infty, and let UU have the uniform distribution on (0,1)(0, 1). Let Z=12(f(U)+f(1−U))Z = \frac12 \bigl( f(U) + f(1 - U) \bigr). Then:

  1. 𝔼Z=𝔼f(U)=∫01f(u) du\mathbb E Z = \mathbb E f(U) = \int_0^1 f(u)\, du;
  2. Cov⁡(f(U),f(1−U))≤0\operatorname{Cov}\bigl(f(U), f(1 - U)\bigr) \le 0;
  3. Var⁡Z≤12Var⁡f(U)\operatorname{Var} Z \le \frac12 \operatorname{Var} f(U).

Both nn copies of ZZ and 2n2n copies of f(U)f(U) need 2n2n evaluations of ff. The average of nn independent copies of ZZ is at least as accurate as that of 2n2n independent copies of f(U)f(U).

Remarks

Clause 1 holds because 1−U1 - U is uniform on (0,1)(0, 1) too. For clause 2, if ff is non-decreasing then u↦f(1−u)u \mapsto f(1 - u) is non-increasing, and for a non-decreasing aa and a non-increasing bb one has 𝔼[a(U)b(U)]≤𝔼a(U) 𝔼b(U)\mathbb E[a(U) b(U)] \le \mathbb E a(U)\, \mathbb E b(U), the integral form of Chebyshev's sum inequality. This in turn follows from 𝔼[(a(U)−a(V))(b(U)−b(V))]≤0\mathbb E\bigl[(a(U) - a(V))(b(U) - b(V))\bigr] \le 0 for an independent copy VV of UU, since the two factors have opposite signs. Clause 3: Var⁡Z=14(2Var⁡f(U)+2Cov⁡(f(U),f(1−U)))≤12Var⁡f(U)\operatorname{Var} Z = \frac14 \bigl( 2 \operatorname{Var} f(U) + 2 \operatorname{Cov}(f(U), f(1-U)) \bigr) \le \frac12 \operatorname{Var} f(U), using Var⁡f(1−U)=Var⁡f(U)\operatorname{Var} f(1 - U) = \operatorname{Var} f(U). Example: for f(u)=euf(u) = e^u, Var⁡f(U)≈0.2420\operatorname{Var} f(U) \approx 0.2420 while Var⁡Z≈0.0039\operatorname{Var} Z \approx 0.0039, a gain of a factor of about 3030 over 22 independent samples. Monotonicity is needed: for f(u)=(u−12)2f(u) = (u - \frac12)^2 one has f(1−u)=f(u)f(1 - u) = f(u), so Z=f(U)Z = f(U) and Var⁡Z=Var⁡f(U)\operatorname{Var} Z = \operatorname{Var} f(U), twice the variance of the average of two independent samples.

Going deeper

For a student

Antithetic variates is one of the simplest variance reduction techniques, with no extra modelling and almost no extra cost. The same idea applies to normal inputs with the pair ZZ and −Z-Z, and to simulations driven by many uniforms, replacing each UjU_j by 1−Uj1 - U_j. In the multivariate case the guarantee holds when the output is a monotone function of each input separately, but for general outputs the method can increase the variance. Combined with inverse transform sampling, which is monotone, it yields negatively correlated pairs from any distribution.

Reading path

To understand this page from the ground up, read these 9 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. Continuous uniform distribution concept
  2. Covariance concept
  3. Sequence definition
  4. Variance concept
  5. Variance reduction concept
  6. Real sequence definition
  7. Monotone sequence definition
  8. Chebyshev's sum inequality statement
  9. Antithetic variates statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Antithetic_variates
About this page
TagWNFEPEBART
URIm2://WNFEPEBART
Kindstatement, theorem
WritingW0 stub
MSC65C05
StatusThis copy of the site has no build data. Run m2 status WNFEPEBART.
AboutVariance reduction
UsesVariance reduction, Continuous uniform distribution, Variance, Covariance, Chebyshev's sum 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.