Variance reduction
Builds on Monte Carlo methodExpected valueVariance
Definition
Let be a real number. Let be a random variable with finite variance and expected value , used in a plain Monte Carlo method for . A variance reduction for this method is a random variable such that:
- ;
- ;
- independent copies of can be generated.
The Monte Carlo method then uses the average of independent copies of instead of the average of copies of .
Remarks
Example: and with uniform on , so . Take . Clause 1 holds because is also uniform, clause 3 is clear, and a direct computation gives , so clause 2 holds. Non-example: , the Taylor polynomial of , has variance about , but , so clause 1 fails and the estimate is biased. A fair comparison also counts the cost. If one copy of costs times as much as one copy of , the reduction pays off when . In the example and . Some techniques, such as stratified sampling, change the whole estimator rather than one sample. For them one compares the variances of two estimators of the same cost.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Expected value concept
- Monte Carlo method concept
- Variance concept
- Variance reduction definition
Further reading
About this page
| Tag | M2JF5D7DP2 |
|---|---|
| URI | m2://M2JF5D7DP2 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65C05 |
| Defines | Variance reduction |
| Uses | Monte Carlo method, Expected value, Variance |
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.