Bias and variance describe how a learning procedure behaves across possible training samples. The familiar three-term equation has a specific scope: expected squared prediction error in regression. It is not a universal identity for every loss or classification metric.

Assume Y = f(X) + ε, with E[ε | X=x] = 0 and conditional noise variance σ²(x). If D is a random training set and f̂_D(x) its fitted predictor, then:

E_D,Y[(Y - f̂_D(x))² | X=x]
= (E_D[f̂_D(x)] - f(x))²
+ E_D[(f̂_D(x) - E_D[f̂_D(x)])²]
+ σ²(x)

The terms are squared bias, variance, and observation noise. The expectations matter: these are properties of a learning procedure under a sampling process, not labels read directly from one fitted model.

Complexity is a hypothesis, not a diagnosis

The classical U-shaped curve is a useful teaching picture, not a law. Better features, representative data, improved inductive bias, or averaging can change one component without an equal reciprocal movement. Some overparameterized systems exhibit double descent, with risk rising near interpolation and falling at greater capacity.

PatternPossible causesCheck
Training and validation loss are highMisspecification, optimization failure, noisy labels, or bad preprocessingCompare baselines; inspect labels, residuals, and convergence
Low training loss and worse validation lossSampling variance, leakage, split mismatch, or validation-set tuningAudit group/time boundaries; repeat splits and seeds
Post-release declineShift, train-serving skew, or feedbackUse time-aware tests and outcome monitoring

A defensible diagnostic workflow

  1. Define the deployment population, horizon, loss, costs, and independent unit.
  2. Keep related people, accounts, devices, sites, documents, or time periods together; fit preprocessing inside training folds.
  3. Compare a trivial predictor and a simple regularized baseline.
  4. Plot learning curves across repeated splits or seeds with uncertainty.
  5. Change data, representation, capacity, or regularization one at a time and evaluate on untouched data.

High common error can be consistent with high bias, and a validation gap with high variance, but neither proves the diagnosis. Leakage, shift, corruption, metric choice, and optimization problems can look similar.

Regularization and ensembles

Ridge adds an L2 penalty and can stabilize linear estimation with correlated predictors. Lasso adds an L1 penalty and can produce sparse coefficients, but zero does not prove irrelevance. Elastic Net combines both and can be more stable with correlated predictors. Select penalty strength inside model selection and report observed uncertainty, not universal percentage gains.

Bagging aggregates estimators fitted to varied data and can reduce variance when their errors are not perfectly correlated. Boosting builds an additive predictor sequentially; its generalization depends on capacity, learning rate, iterations, subsampling, regularization, and stopping. See ensemble methods and feature selection.

Separate estimation from decision policy

False positives and false negatives arise when scores become decisions. Changing a fraud threshold may trade recall for precision without changing the fitted model’s bias or variance. Choose operating points using validated scores, calibration, costs, constraints, subgroup results, and escalation policy.

Avoid optimistic model selection

Hyperparameter tuning consumes validation information. Use an untouched final test set when available. When data are limited, nested cross-validation tunes in the inner loop and estimates the complete selection procedure in the outer loop. Match group, stratification, or time-aware splitters to deployment. Compare the evaluation patterns in supervised machine-learning examples and LLM evaluation metrics.

The decomposition is a precise lens, not a slogan about simple versus complex models. State its loss, expectations, sampling assumptions, and limits.

Reviewed and substantially updated September 4, 2026. Original publication date preserved.