In statistics and machine learning, the bias–variance tradeoff (or dilemma) is the problem of simultaneously minimizing two sources of error that prevent supervised learning algorithms from generalizing beyond their training set:
- the bias, error from erroneous assumptions in the learning algorithm, and
- the variance, error from sensitivity to small fluctuations in the training set.
The bias–variance decomposition is a way of analyzing a learning algorithm's expected generalization error wrt. a particular problem as a sum of three terms, the bias, variance, and a quantity called the irreducible error, resulting from noise in the problem itself.
This tradeoff applies to all forms of supervised learning: classification, regression (function fitting), and structured output learning. It has also been invoked to explain the effectiveness of heuristics in human learning.
The bias–variance tradeoff is a central problem in supervised learning. Ideally, one wants to choose a model that both accurately captures the regularities in its training data, but also generalizes well to unseen data. Unfortunately, it is typically impossible to do both simultaneously. High-variance learning methods may be able to represent their training set well, but are at risk of overfitting to noisy or unrepresentative training data. In contrast, algorithms with high bias typically produce simpler models that don't tend to overfit, but may underfit their training data, failing to capture important regularities.
Models with low bias are usually more complex (e.g. higher-order regression polynomials), enabling them to represent the training set more accurately. In the process, however, they may also represent a large noise component in the training set, making their predictions less accurate - despite their added complexity. In contrast, models with higher bias tend to be relatively simple (low-order or even linear regression polynomials), but may produce lower variance predictions when applied beyond the training set.
Bias–variance decomposition of squared error
Suppose that we have a training set consisting of a set of points and real values associated with each point . We assume that there is a functional, but noisy relation , where the noise, , has zero mean and variance .
We want to find a function , that approximates the true function as well as possible, by means of some learning algorithm. We make "as well as possible" precise by measuring the mean squared error between and : we want to be minimal, both for and for points outside of our sample. Obviously, we cannot hope to do perfectly, since contains noise ; this means we must be prepared to accept an irreducible error in any function we come up with.
Finding an that generalizes to points outside of the training set can be done with any of the countless algorithms used for supervised learning. It turns out that whichever function we select, we can decompose its expected error on an unseen sample as follows::34:223
The expectation ranges over different choices of the training set , all sampled from the same distribution. The three terms represent:
- the variance of the learning method, or, intuitively, its capability of producing flexible models that fit different training sets;
- the square of the bias of the learning method, which can be thought of the error caused by the simplifying assumptions built into the method. E.g., when approximating a non-linear function using a learning method for linear models, there will be error in the estimates due to this assumption;
- the irreducible error . Since all three terms are non-negative, this forms a lower bound on the expected error on unseen samples.:34
The first step "augments" the sum inside the square with two terms that cancel each other out. The rest is just binomial expansion and linearity of expectation. Observe that , so the first term is by the definition of variance (since has zero mean).
The final term vanishes entirely:
- and is deterministic, so simplifies to . as well, so these terms cancel out.
- By assumption, ; is independent of and the latter has zero mean, the latter term is zero and so is .
So, we have
and we proceed by applying the same augmentation we used earlier to the latter of these two terms:
The first term in this sum is the squared bias; the second is the variance, .
Again, the final term in this sum vanishes:
- as well, so these terms cancel;
- as well, so the entire sum is zero.
So finally, we arrive at
Application to classification
The bias–variance decomposition was originally formulated for least-squares regression. For the case of classification under the 0-1 loss (misclassification rate), it's possible to find a similar decomposition. Alternatively, if the classification problem can be phrased as probabilistic classification, then the expected squared error of the predicted probabilities wrt. the true probabilities can be decomposed as before.
Dimensionality reduction and feature selection can decrease variance by simplifying models. Similarly, a larger training set tends to decrease variance. Adding features (predictors) tends to decrease bias, at the expense of introducing additional variance. Learning algorithms typically have some tunable parameters that control bias and variance, e.g.:
- (Generalized) linear models can be regularized to increase their bias.
- In neural nets, the variance increases and the bias decreases with the number of hidden units. Like in GLMs, regularization is typically applied.
- In k-nearest neighbor models, a high value of k leads to high bias and low variance (see below).
- In Instance-based learning, regularization can be achieved varying the mixture of prototypes and exemplars.
- In decision trees, the depth of the tree determines the variance. Decision trees are commonly pruned to control variance.:307
One way of resolving the trade-off is to use mixture models and ensemble learning. For example, boosting combines many "weak" (high bias) models in an ensemble that has greater variance than the individual models, while bagging combines "strong" learners in a way that reduces their variance.
where are the k nearest neighbors of x in the training set. The bias (first term) is a monotone rising function of k, while the variance (second term) drops off as k is increased. In fact, under "reasonable assumptions" the bias of the first-nearest neighbor (1-NN) estimator vanishes entirely as the size of the training set approaches infinity.
Application to human learning
While widely discussed in the context of machine learning, the bias-variance dilemma has been examined in the context of human cognition, most notably by Gerd Gigerenzer and co-workers in the context of learned heuristics. They have argued (see references below) that the human brain resolves the dilemma in the case of the typically sparse, poorly-characterised training-sets provided by experience by adopting high-bias/low variance heuristics. This reflects the fact that a zero-bias approach has poor generalisability to new situations, and also unreasonably presumes precise knowledge of the true state of the world. The resulting heuristics are relatively simple, but produce better inferences in a wider variety of situations.
Geman et al. argue that that the bias-variance dilemma implies that abilities such as generic object recognition cannot be learned from scratch, but require a certain degree of “hard wiring” that is later tuned by experience. This is because model-free approaches to inference require impractically large training sets if they are to avoid high variance.
- S. Geman; E. Bienenstock; R. Doursat (1992). "Neural networks and the bias/variance dilemma". Neural Computation 4: 1–58. doi:10.1162/neco.19126.96.36.199.
- Bias–Value decomposition, In Encyclopedia of Machine Learning. Eds. Claude Sammut, Geoffrey I. Webb. Springer 2011. pp. 100-101
- Gareth James; Daniela Witten; Trevor Hastie; Robert Tibshirani (2013). An Introduction to Statistical Learning. Springer.
- Hastie, Trevor; Tibshirani, Robert; Friedman, Jerome (2009). The Elements of Statistical Learning.
- Vijayakumar, Sethu (2007). "The Bias–Variance Tradeoff". University Edinburgh. Retrieved 19 August 2014.
- "Notes on derivation of bias-variance decomposition in linear regression". 2011. Retrieved 20 August 2014.
- Domingos, Pedro (2000). "A unified bias-variance decomposition". ICML.
- Valentini, Giorgio; Dietterich, Thomas G. (2004). "Bias–variance analysis of support vector machines for the development of SVM-based ensemble methods". JMLR 5: 725–775.
- Manning, Christopher D.; Raghavan, Prabhakar; Schütze, Hinrich (2008). Introduction to Information Retrieval. Cambridge University Press. pp. 308–314.
- Gagliardi, F. (2011) “Instance-based classifiers applied to medical databases: diagnosis and knowledge extraction”. Artificial Intelligence in Medicine. Volume 52, Issue 3 , Pages 123-139. http://dx.doi.org/10.1016/j.artmed.2011.04.002
- Jo-Anne Ting, Sethu Vijaykumar, Stefan Schaal, Locally Weighted Regression for Control. In Encyclopedia of Machine Learning. Eds. Claude Sammut, Geoffrey I. Webb. Springer 2011. p. 615
- Scott Fortmann-Roe. Understanding the Bias–Variance Tradeoff. 2012. http://scott.fortmann-roe.com/docs/BiasVariance.html
- Gigerenzer, Gerd; Brighton, Henry (2009). "Homo Heuristicus: Why Biased Minds Make Better Inferences". Topics in Cognitive Science 1: 107–143. doi:10.1111/j.1756-8765.2008.01006.x.