The bagging variance formula
ProofIntermediate⏱ 30 minClassical MLbaggingvariancecorrelationrandom forest
Problem
Derive for the average of predictors with common variance and pairwise correlation . Compute the limit, and explain precisely what random forests do about it and at what cost.
Write a complete argument. Every inequality you use should be one you could state precisely.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| The Δ²/12 noise variance | Quantization | Proof | 15 min | ||
| Concave impurity gives non-negative information gain | Classical ML | Proof | 30 min | ||
| Gradient boosting fits the negative functional gradient | Classical ML | Proof | 30 min | ||
| Mini-batching and the compute budget | SGD | Numerical | 30 min | ||
| The 1/n variance rate requires uncorrelated samples | Probability | Numerical | 30 min |