Machine Learning / Learning Paradigms
Why the simplest and the most complex models both fail.
Reviewed by Yuvaraj
Every supervised learning model is pulled between two opposing failure modes, and the bias–variance tradeoff is the exact statement of that tension. Make a model too simple and it cannot capture the real pattern in your data. Make it too flexible and it starts memorizing the noise in your particular training set. Neither extreme generalizes to new data. Learning to name, measure, and balance these two forces is what separates engineers who can diagnose a struggling model from those who just try random fixes and hope.
High bias (underfitting). The model is too simple to represent the true relationship, so it makes systematic errors no matter how much data you feed it. The signature: training error and validation error are both high and close together.
High variance (overfitting). The model is flexible enough to fit the quirks of the exact sample it was trained on, so its predictions swing wildly when the training data changes. The signature: training error is very low while validation error is high, a large gap between the two.
The goal is never to eliminate just one of these. It is to find the balance point where their combined effect on unseen data is smallest.
For a curious beginner
Picture throwing darts at a board. Bias is aiming off-center: your darts cluster tightly, but consistently away from the bullseye. Variance is a shaky hand: your darts scatter all over, even if they average out near the center. A great model has low bias and low variance, a tight cluster on the bullseye. Reducing one often worsens the other, so you tune for the best combination.
How it is actually used
Think of a single complexity knob, polynomial degree, tree depth, number of features, or the inverse of a regularization strength. Turn it up and training error keeps dropping. But watch validation error: it falls, bottoms out, then rises again. You are not chasing the lowest training error; you are hunting the knob setting where the held-out validation error is minimized.
The underlying mechanism
Expected squared test error at a point decomposes into three parts: . Bias is how far the prediction sits from the truth; variance is how much the prediction wobbles across different training sets; is irreducible noise you can never remove. Complexity trades the first term against the second.
Ask about this lesson, or about anything in AI. Answers cite the lessons they draw on.
Finished this lesson?
Mark it complete to earn XP, keep your streak, and schedule a review.
As you turn the complexity knob up:
Written out fully, the expected error at a point decomposes as:
Because the irreducible noise never changes, minimizing total error means minimizing the sum of the first two terms. One shrinks exactly as the other grows, so the minimum sits at some intermediate complexity, not at either extreme. Plotted against complexity, validation error traces a U-shape.
Suppose we fit polynomials of increasing degree to the same noisy dataset, then measure root-mean-squared error on the training set and on a held-out validation set.
| Degree | Training error (RMSE) | Validation error (RMSE) | Regime |
|---|---|---|---|
| 1 | 3.10 | 3.25 | High bias (underfitting) |
| 2 | 1.85 | 2.00 | Improving |
| 3 | 0.92 | 1.10 | Best generalization |
| 5 | 0.61 | 1.45 | Variance creeping in |
| 8 | 0.28 | 2.60 | Overfitting |
| 12 | 0.05 | 4.90 | High variance (memorizing noise) |
Read the pattern carefully. Training error falls monotonically, more flexibility can always fit the training points more closely. Validation error is U-shaped: it improves as the model escapes underfitting, bottoms out at degree 3, then climbs as the model starts chasing noise. By degree 12 the model nearly interpolates the training data (error 0.05) yet is useless on new data (4.90). That widening gap between the two columns is the visible signature of rising variance.
Common mistakes