The Central Question

Suppose we have several candidate models:

\[ M_1,\, M_2,\, \ldots,\, M_K. \]

Each model has its own parameter vector

\[ \boldsymbol{\theta}_k \]

and may produce predictions

\[ F_k(\boldsymbol{\theta}_k). \]

Model selection asks which candidate provides the best balance of:

Why the Best Fit Is Not Always the Best Model

A more flexible model can usually fit training data at least as well as a simpler nested model.

If parameters are added freely, the residual error may decrease:

\[ \operatorname{RSS}_{\text{complex}} \le \operatorname{RSS}_{\text{simple}}. \]

But a lower training residual does not automatically mean the more complex model is better.

Extra flexibility may fit noise rather than reproducible structure.

Underfitting

A model underfits when it is too simple to represent important structure in the data.

Typical signs include:

Overfitting

A model overfits when it adapts too closely to accidental features or noise in the training data.

Typical signs include:

The Bias-Variance Perspective

Simple models may have high bias because they cannot represent enough structure.

Highly flexible models may have high variance because their fitted parameters change strongly from one data sample to another.

Model selection often seeks a useful compromise:

\[ \boxed{ \text{low enough bias} + \text{controlled variance} }. \]

Training Error

The training error measures model fit using the same data used to estimate the parameters.

For squared-error fitting,

\[ E_{\text{train}} = \frac{1}{n} \sum_{i=1}^{n} \left[ y_i - F_i(\hat{\boldsymbol{\theta}}) \right]^2. \]

Training error is useful, but it usually favors more flexible models.

Validation Error

A stronger test evaluates predictions on observations not used for fitting.

If the validation set is indexed by

\[ \mathcal{V}, \]

then

\[ E_{\text{val}} = \frac{1}{|\mathcal{V}|} \sum_{i\in\mathcal{V}} \left[ y_i - F_i(\hat{\boldsymbol{\theta}}) \right]^2. \]

Good validation performance suggests that the model captures reproducible structure rather than only training noise.

Train-Validation Splits

One simple strategy divides the observations into:

The same validation data should not be repeatedly used to tune many modeling decisions without caution, because that can indirectly overfit the validation set.

Test Data

In larger workflows, a third data set may be reserved for final evaluation:

This separation reduces optimistic performance estimates.

Cross-Validation

Cross-validation repeatedly changes which observations are used for fitting and which are used for validation.

The goal is to estimate how well a model predicts data outside the particular fitting sample.

K-Fold Cross-Validation

In \(K\)-fold cross-validation, the data are divided into

\[ K \]

subsets.

Each fold is held out once while the model is fitted to the other \(K-1\) folds.

The validation errors are then averaged.

Leave-One-Out Cross-Validation

Leave-one-out cross-validation is the case

\[ K=n. \]

Each observation is held out once.

This uses nearly all observations for each fit but can be computationally expensive in complex inverse problems.

Cross-Validation Must Respect Data Structure

Randomly splitting observations is not always appropriate.

If data are grouped, spatially correlated, or ordered in time, the validation design should preserve the structure of the prediction task.

Examples include:

Residual Diagnostics as a Selection Tool

A model should not be selected solely from one scalar score.

Residuals can reveal:

A Model with Lower Error Can Still Be Worse

Suppose model \(M_2\) has a slightly lower residual sum of squares than model \(M_1\), but \(M_2\) leaves a strong systematic residual pattern.

The lower numerical error does not erase the evidence that \(M_2\) is structurally misspecified.

Parsimony

Parsimony means preferring a simpler adequate explanation over unnecessary complexity.

This does not mean the simplest possible model should always be chosen.

Rather, complexity should be justified by meaningful improvement in fit, prediction, or scientific explanation.

Parameter Count

A common measure of model complexity is the number of estimated parameters:

\[ k. \]

Information criteria use \(k\) to penalize models that gain fit by adding flexibility.

Akaike Information Criterion

The Akaike information criterion is

\[ \boxed{ \operatorname{AIC} = 2k - 2\ell_{\max} }. \]

Here:

Smaller AIC values are preferred among models fitted to the same data.

What AIC Balances

The term

\[ -2\ell_{\max} \]

rewards goodness of fit.

The term

\[ 2k \]

penalizes complexity.

A model must therefore improve the likelihood enough to justify additional parameters.

AIC Differences

It is often useful to compare each model to the best AIC value:

\[ \Delta_i = \operatorname{AIC}_i - \operatorname{AIC}_{\min}. \]

The absolute AIC value is usually less informative than differences among models fitted to the same response data.

Small-Sample AIC

When sample size is not large relative to parameter count, a corrected criterion is often used:

\[ \boxed{ \operatorname{AIC}_c = \operatorname{AIC} + \frac{ 2k(k+1) }{ n-k-1 } }. \]

The correction becomes small as \(n\) grows.

Bayesian Information Criterion

The Bayesian information criterion is

\[ \boxed{ \operatorname{BIC} = k\log n - 2\ell_{\max} }. \]

Like AIC, smaller BIC values are preferred.

Because the complexity penalty grows with

\[ \log n, \]

BIC can penalize extra parameters more strongly than AIC for sufficiently large samples.

AIC and BIC Are Not Identical Goals

AIC is motivated primarily by predictive information loss.

BIC has an asymptotic connection to Bayesian model evidence under particular assumptions.

They may therefore select different models without either calculation being numerically incorrect.

Information Criteria Require Comparable Likelihoods

AIC and BIC comparisons are meaningful only when candidate models are fitted to the same observed response information with compatible likelihood definitions.

Changing the data, response transformation, or likelihood normalization can make direct comparisons invalid.

Likelihood-Ratio Tests

When one model is nested inside another, a likelihood-ratio statistic is

\[ \boxed{ \Lambda = 2 \left[ \ell_{\text{complex}} - \ell_{\text{simple}} \right] }. \]

Under suitable regularity conditions, this statistic can be compared with a reference chi-square distribution.

Nested Models

Model \(M_1\) is nested within \(M_2\) if \(M_1\) can be obtained from \(M_2\) by fixing or removing some parameters.

For example,

\[ y=a+bx \]

is nested within

\[ y=a+bx+cx^2 \]

by setting

\[ c=0. \]

Likelihood-Ratio Caveats

Standard likelihood-ratio approximations can fail when:

Adjusted \(R^2\)

In linear regression, adjusted \(R^2\) penalizes adding predictors that do not improve fit enough to offset increased complexity.

One form is

\[ \boxed{ R_{\text{adj}}^2 = 1 - (1-R^2) \frac{n-1}{n-k-1} }. \]

It is useful in some regression settings but is not a universal inverse-model selection criterion.

Prediction Error Matters More Than \(R^2\) Alone

A high \(R^2\) does not guarantee:

Bayesian Model Evidence

In Bayesian model comparison, model \(M\) has evidence

\[ \boxed{ p(\mathbf{y}\mid M) = \int p( \mathbf{y} \mid \boldsymbol{\theta}, M ) p( \boldsymbol{\theta} \mid M ) d\boldsymbol{\theta} }. \]

The evidence averages the likelihood over the prior parameter distribution.

Automatic Complexity Penalty in Bayesian Evidence

A flexible model may achieve a high maximum likelihood in a narrow parameter region.

But evidence averages across the entire prior parameter space.

Models that fit well only after extreme fine-tuning can therefore be penalized naturally.

Bayes Factors

For two models,

\[ M_1 \quad\text{and}\quad M_2, \]

the Bayes factor is

\[ \boxed{ B_{12} = \frac{ p(\mathbf{y}\mid M_1) }{ p(\mathbf{y}\mid M_2) } }. \]

It compares how strongly the observed data support one model relative to the other under the specified priors.

Prior Dependence of Bayesian Model Selection

Because evidence integrates over the prior,

\[ p(\boldsymbol{\theta}\mid M), \]

Bayes factors can be sensitive to prior width and shape.

Priors used for model comparison therefore require particular care.

Posterior Model Probabilities

Bayes' rule can be applied at the model level:

\[ p( M_k \mid \mathbf{y} ) \propto p( \mathbf{y} \mid M_k ) p(M_k). \]

Model priors

\[ p(M_k) \]

can represent prior beliefs about competing model structures.

Model Averaging

Sometimes no single model is overwhelmingly supported.

Instead of selecting one model and discarding the others, predictions can be averaged:

\[ p( y_{\text{new}} \mid \mathbf{y} ) = \sum_k p( y_{\text{new}} \mid M_k,\mathbf{y} ) p( M_k \mid \mathbf{y} ). \]

This propagates model uncertainty into prediction.

Model Uncertainty

Parameter uncertainty exists within a model.

Model uncertainty concerns which model structure should be trusted.

Ignoring model uncertainty can make predictions appear more certain than they really are.

Identifiability and Model Selection

A model with many weakly identifiable parameters may fit well but provide unstable scientific conclusions.

Parameter identifiability should therefore be considered part of model selection.

A simpler identifiable model can be more useful than a more flexible model whose parameters cannot be distinguished.

Parameter Stability

Refit candidate models under:

A model whose key parameters change dramatically under minor perturbations may be unreliable even if its nominal fit is good.

Scientific Interpretability

Model selection should not be separated from domain meaning.

Ask whether:

Nested Physical Mechanisms

Suppose a simple model contains one mechanism:

\[ y=f_1(x;\theta_1). \]

A larger model adds a second mechanism:

\[ y = f_1(x;\theta_1) + f_2(x;\theta_2). \]

The model-selection question is whether the data contain enough evidence to justify the second mechanism.

Noise Models Are Part of Model Selection

Competing models may share the same forward equation but use different observation models.

For example:

\[ \varepsilon \sim N(0,\sigma^2) \]

versus

\[ \log y = \log F(\boldsymbol{\theta}) + \varepsilon. \]

Choosing the observation model can be as important as choosing the forward model.

Transformations Change the Fitting Problem

Fitting

\[ y \]

directly is not generally equivalent to fitting

\[ \log y. \]

The transformation changes the implied error model and weighting of residuals.

Model comparison should therefore account for the scale on which likelihood or residuals are defined.

Extrapolation

Two models can fit the observed region similarly but behave very differently outside it.

If future use requires extrapolation, inspect whether model behavior remains physically reasonable beyond the fitting range.

Interpolation Versus Extrapolation Risk

Validation within the observed range tests interpolation.

Extrapolation relies more heavily on model structure.

Therefore, mechanistic plausibility becomes especially important when the model will be used outside the measured domain.

Selection Under Regularization

Regularization introduces another modeling choice:

\[ \lambda. \]

Comparing regularized models should consider both:

Cross-validation is often useful for selecting \(\lambda\).

Effective Complexity

A regularized model with \(k\) nominal parameters may behave as though it has fewer effective degrees of freedom.

Therefore, raw parameter count can overstate the practical flexibility of a strongly regularized model.

Model Selection and Ill-Posedness

A model that creates an extremely ill-conditioned inverse problem may not be useful even if it fits training data slightly better.

Stability should therefore be considered alongside fit.

Parameter Redundancy

If two parameters have nearly identical effects on the observable output, one may be redundant.

Removing or combining redundant parameters can improve:

Sensitivity Analysis for Model Selection

Parameter sensitivities can reveal whether added model components actually influence the measured outputs.

A parameter with negligible sensitivity across all experiments may not be estimable from the available data.

Adding such a parameter can create unnecessary complexity.

Selection Based on Prediction

If the goal is forecasting or interpolation, predictive accuracy may be the primary selection criterion.

Cross-validation, held-out likelihood, or predictive scoring rules can then be more important than interpretability of every individual parameter.

Selection Based on Explanation

If the goal is understanding a physical mechanism, a model with slightly worse predictive error may be preferable if it:

Selection Depends on Purpose

There is no single universally best model independent of the task.

A model optimized for prediction may differ from one optimized for explanation, control, reconstruction, or decision-making.

The selection criterion should reflect the intended use.

Bootstrap Model Assessment

Bootstrap resampling can reveal how often a model or parameterization is preferred across repeated pseudo-data sets.

Large variation in selected models indicates substantial model-selection uncertainty.

Stability Selection

In high-dimensional problems, one can examine how consistently variables or parameters are selected across perturbed samples.

Features selected only under narrow data variations may be less trustworthy than features selected repeatedly.

Model Selection Is Not Proof

Selecting \(M_2\) over \(M_1\) does not prove that \(M_2\) is the true physical system.

It means only that \(M_2\) is preferred among the candidates under the chosen data, assumptions, and selection criterion.

The Candidate Set Matters

Model selection cannot choose a model that was never considered.

If all candidate models omit an important mechanism, the selected model may still be inadequate.

Good model selection therefore begins with a scientifically credible candidate set.

Model Misspecification

A model can score best among competitors while still being misspecified.

Residual analysis, calibration checks, and independent validation are needed to assess absolute adequacy, not merely relative preference.

Absolute Versus Relative Model Assessment

Information criteria and Bayes factors compare models relative to one another.

Residual diagnostics and predictive checks ask whether a model is adequate in an absolute sense.

Both perspectives are necessary.

Common Error: Choosing the Lowest Training Error

Training error nearly always rewards added flexibility.

Use validation, complexity penalties, or predictive criteria to determine whether the improvement generalizes.

Common Error: Comparing AIC Across Different Data

AIC values from models fitted to different response data or incompatible likelihood definitions should not be compared directly.

The likelihood basis must be comparable.

Common Error: Treating AIC or BIC as Proof

A smaller information criterion indicates preference under a particular theoretical goal.

It does not prove the selected model is physically correct.

Common Error: Ignoring Identifiability

A highly parameterized model can achieve excellent fit while containing parameters that the data cannot separately determine.

Model selection should include identifiability and uncertainty analysis.

Common Error: Data Leakage

Validation data should not influence fitting decisions that are later judged using those same validation data.

Repeatedly tuning a model against the validation set can indirectly overfit it.

Common Error: Randomly Splitting Dependent Data

Time series, spatial data, and grouped experiments often violate the independence assumption behind random train-validation splits.

Splits should mirror the actual prediction task.

Common Error: Ignoring the Observation Model

Two forward models cannot be compared fairly if one is paired with an unrealistic noise model.

Forward structure and measurement-error structure should be considered together.

Common Error: Selecting Complexity Without Purpose

A model appropriate for short-range prediction may be inappropriate for physical interpretation or extrapolation.

Selection criteria should reflect the intended use of the model.

A Reliable Model-Selection Workflow

  1. Define the scientific or predictive goal.
  2. Construct a credible set of candidate models.
  3. Fit each model using comparable data and likelihood assumptions.
  4. Check parameter identifiability and conditioning.
  5. Inspect residual patterns and measurement-model assumptions.
  6. Compare training fit only as an initial diagnostic.
  7. Use validation or cross-validation when prediction matters.
  8. Use AIC, AICc, BIC, likelihood-ratio methods, or Bayesian evidence when appropriate.
  9. Assess parameter stability under perturbations or resampling.
  10. Consider interpretability and physical plausibility.
  11. Examine extrapolation behavior if extrapolation is required.
  12. Quantify model-selection uncertainty when several models remain plausible.
  13. Prefer the simplest model that adequately serves the intended purpose.

Practice 1: Training Versus Validation

A model has lower training error but higher validation error than a simpler competitor.

What modeling concern does this raise?

Practice 2: AIC Calculation

A model has

\[ k=4 \]

estimated parameters and maximized log-likelihood

\[ \ell_{\max}=-120. \]

Compute its AIC.

Practice 3: BIC Calculation

Suppose

\[ k=3, \qquad n=100, \qquad \ell_{\max}=-50. \]

Compute

\[ \operatorname{BIC} = k\log n - 2\ell_{\max}. \]

Practice 4: Nested Models

Is

\[ y=a+bx \]

nested within

\[ y=a+bx+cx^2? \]

Practice 5: Cross-Validation

What is the main purpose of cross-validation in model selection?

Practice 6: Identifiability

A complex model has lower AIC but contains two parameters with nearly perfect confounding.

What additional issue should be considered before adopting the model?

Practice 7: Bayes Factor

If

\[ p(\mathbf{y}\mid M_1)=0.08 \]

and

\[ p(\mathbf{y}\mid M_2)=0.02, \]

compute

\[ B_{12}. \]

Practice 8: Data Leakage

Why is it problematic to repeatedly tune a model using the same data set that will later be called the validation set?

Practice 9: Residual Structure

Two models have similar validation error, but one has residuals with a strong time trend while the other does not.

Which model is generally more credible?

Practice 10: Model Averaging

Why might model averaging be preferable when several models have substantial support?

Practice Answers

Practice 1

This raises concern about overfitting. The more complex model fits the training sample better but generalizes worse.

Practice 2

\[ \operatorname{AIC} = 2(4) - 2(-120) = 8+240 = \boxed{248}. \]

Practice 3

\[ \operatorname{BIC} = 3\log(100) - 2(-50). \]

Since

\[ \log(100)\approx4.605, \]

we obtain

\[ \operatorname{BIC} \approx 3(4.605)+100 = 13.815+100 = \boxed{113.815}. \]

Practice 4

Yes. Setting

\[ c=0 \]

reduces the quadratic model to

\[ y=a+bx. \]

Therefore, the linear model is nested within the quadratic model.

Practice 5

Cross-validation estimates how well a model is expected to perform on data not used for fitting. It helps detect overfitting and compare predictive generalization.

Practice 6

The model may have poor parameter identifiability or conditioning despite its information-criterion score. Parameter stability and scientific interpretability should be examined before adoption.

Practice 7

\[ B_{12} = \frac{0.08}{0.02} = \boxed{4}. \]

Under the specified priors and models, the observed data provide four times as much marginal support for \(M_1\) as for \(M_2\).

Practice 8

Repeated tuning lets information from the validation set influence the model. The validation score then becomes optimistically biased and no longer represents a fully independent test.

Practice 9

The model without systematic residual structure is generally more credible because its remaining errors are more consistent with an adequate model and observation process.

Practice 10

Model averaging propagates uncertainty about model structure into predictions instead of acting as though one uncertain model choice were unquestionably correct.

What to Remember

Model selection chooses among competing mathematical descriptions rather than only estimating parameters within one fixed description.

The central principle is:

\[ \boxed{ \text{prefer complexity only when the data and the modeling goal justify it} }. \]

Where We Go Next

Model selection determines which mathematical structure should be carried forward, but many inverse problems involve systems that evolve as new observations arrive.

The next lesson, Data Assimilation, develops methods for combining dynamical models with sequential observations to update estimates of states, parameters, and uncertainty over time.