Chapter 05
Medium

Forecasting, Information Criteria, and Diagnostics

00 · Symbol Glossary

$\hat X_{t+h\mid t}$h-step forecast

The minimum-MSE linear predictor of Xt+hX_{t+h} given {Xs:st}\{X_s:s\leq t\}, which for Gaussian ARMA equals E[Xt+hXt,Xt1,]\mathbb{E}[X_{t+h}\mid X_t,X_{t-1},\ldots].

$e_t(h)$h-step forecast error

et(h)=Xt+hX^t+hte_t(h)=X_{t+h}-\hat X_{t+h\mid t}. For causal ARMA, et(1)=εt+1e_t(1)=\varepsilon_{t+1} (the innovation) if the model is correctly specified and parameters are known.

$\mathrm{AIC},\;\mathrm{BIC}$information criteria

Penalized log-likelihood for lag order: AIC =2/T+2k/T= -2\ell/T+2k/T (common time-series scaling), BIC =2/T+klog(T)/T= -2\ell/T+k\log(T)/T. Smaller is better. BIC charges more per parameter as TT grows.

$Q$Ljung–Box statistic

Portmanteau test using residual ACF ρ^ε(1),,ρ^ε(H)\hat\rho_\varepsilon(1),\ldots,\hat\rho_\varepsilon(H) jointly. Under WN residuals (and extra conditions), QQ is approximately χ2\chi^2 with degrees of freedom HkH-k after fitting kk ARMA parameters.


01 · Minimum MSE Forecasts

Definition — Linear MMSE Forecast

Among predictors of the form c+j=0ajXtjc+\sum_{j=0}^{\infty} a_j X_{t-j}, the MMSE forecast X^t+ht\hat X_{t+h\mid t} minimizes E[(Xt+hX^t+ht)2]\mathbb{E}[(X_{t+h}-\hat X_{t+h\mid t})^2]. For a causal ARMA with known coefficients it is obtained by writing Xt+h=j=0ψjεt+hjX_{t+h}=\sum_{j=0}^{\infty}\psi_j\varepsilon_{t+h-j} and replacing future ε\varepsilon by 00 and past ε\varepsilon by the invertible filter of observed XX.

Plain language: split the future value into the part you can reconstruct from data through tt and the part that still depends on unknown future shocks. The optimal forecast keeps the first part and sets the innovation mean — zero — for the second.

For AR(1), X^t+ht=μ+ϕh(Xtμ)\hat X_{t+h\mid t}=\mu+\phi^h(X_t-\mu). As hh\to\infty, the forecast converges to the mean μ\mu and the error variance converges to γ(0)\gamma(0): mean reversion. For a random walk, P^t+ht=Pt\hat P_{t+h\mid t}=P_t (plus drift hμh\mu if present) and error variance grows like hσ2h\sigma^2 (Chapter 04).

Example — AR(1) one- and two-step

Xt=0.6Xt1+εtX_t=0.6 X_{t-1}+\varepsilon_t, Xt=2X_t=2. Then X^t+1t=1.2\hat X_{t+1\mid t}=1.2, X^t+2t=0.72\hat X_{t+2\mid t}=0.72. Known-parameter MSEs: σ2\sigma^2 and σ2(1+ϕ2)=σ2(1.36)\sigma^2(1+\phi^2)=\sigma^2(1.36).

Estimated parameters

Replacing ϕ\phi by ϕ^\hat\phi adds parameter uncertainty. For large TT this is second order relative to innovation variance; for small TT and long hh, interval forecasts that ignore it are too tight. Analytic corrections exist; a practical substitute is to resample residuals (bootstrap the path).


02 · Choosing (p,q)(p,q): AIC and BIC

ACF/PACF propose candidates. Criteria pick among fitted models on the same sample.

Definition — AIC and BIC (Gaussian ARMA)

Let \ell be the maximized Gaussian log-likelihood and kk the number of estimated parameters (AR+MA+variance, and mean if fitted). Then

AIC=2T+2kT,BIC=2T+klogTT\mathrm{AIC} = -2\frac{\ell}{T}+\frac{2k}{T}, \qquad \mathrm{BIC} = -2\frac{\ell}{T}+\frac{k\log T}{T}

(Some packages report TAICT\cdot\mathrm{AIC} without dividing by TT; only differences within one package are comparable.)

AIC is asymptotically efficient for forecasting when the true process is not a finite ARMA (it lets kk grow). BIC is consistent for (p,q)(p,q) when a true finite ARMA exists. In finance samples, AIC often selects more lags; BIC is the more conservative default unless the goal is explicitly short-horizon RMSE.

❌ Mixing AIC across software and across $T$

A model with AIC =1200=-1200 is not “better” than one with AIC =3=3 from another package or a different sample length.

Why it breaks: additive constants, TT-scaling, and whether σ2\sigma^2 is counted in kk differ.

Consequence: compare AIC only among models estimated the same way on the same TT. Prefer ranking, not the raw number.


03 · Residual Diagnostics

A fitted ARMA is credible only if ε^t\hat\varepsilon_t looks like the WN it claims.

Definition — Ljung–Box $Q$
Q=T(T+2)h=1Hρ^ε^(h)2ThQ = T(T+2)\sum_{h=1}^{H}\frac{\hat\rho_{\hat\varepsilon}(h)^2}{T-h}

Under a correctly specified invertible ARMA and HH large but H/T0H/T\to 0, QχHpq2Q\approx\chi^2_{H-p-q} (mean subtracted separately). A small pp-value means residual autocorrelation remains — the ARMA is too small or misspecified (e.g. GARCH in squares, Chapter 06, which QQ on levels can miss).

Step-by-step — Residual checklist
1
Residual ACF/PACF: no systematic spikes; WN bands are now more appropriate than on the raw series.
2
Ljung–Box at H=10,20H=10,20 (or HTH\approx\sqrt{T}): joint test, not one lag.
3
Squares: ACF of ε^t2\hat\varepsilon_t^2. Persistence here is volatility clustering, not a reason to inflate (p,q)(p,q) of the mean.
4
Outliers / level shifts: one spike can fake MA structure. Inspect the residual time plot, not only ρ^\hat\rho.
5
Overfitting: extra MA/AR terms that cancel (common factors) improve in-sample \ell slightly and fail out of sample.

04 · Evaluation: In-Sample vs Out-of-Sample

Information criteria are in-sample. For forecasting products, hold out the last RR points, re-estimate or roll, and compare RMSE / MAE of hh-step errors. A model that wins AIC can lose a holdout if it overfit a break — for example extra AR lags that chase a pre-break sample, or a level shift the in-sample fit never saw. In production, rolling or expanding re-estimation on a trailing window is the safer default than one static fit scored only in sample.

Practice — Two losses

Explain why RMSE and MAE can rank two forecast methods differently when errors are heavy-tailed (as financial returns are). Which loss matches a quadratic utility story, and which is more robust to one crash day?


05 · Exercises

EXERCISE 5.1

Iterate the AR(1) hh times; take E[Ft]\mathbb{E}[\,\cdot\mid \mathcal{F}_t].

Xt+h=ϕhXt+j=0h1ϕjεt+hjX_{t+h}=\phi^h X_t + \sum_{j=0}^{h-1}\phi^j\varepsilon_{t+h-j}. Thus X^t+ht=ϕhXt\hat X_{t+h\mid t}=\phi^h X_t (zero mean). MSE =σ2(1ϕ2h)/(1ϕ2)=\sigma^2(1-\phi^{2h})/(1-\phi^2) for ϕ<1\lvert\phi\rvert<1, which increases with hh toward γ(0)\gamma(0).

For causal AR(1) Xt=ϕXt1+εtX_t=\phi X_{t-1}+\varepsilon_t, derive X^t+ht\hat X_{t+h\mid t} and MSE(h)\mathrm{MSE}(h) when parameters are known.

EXERCISE 5.2

BIC penalty klogTk\log T vs AIC’s 2k2k.

For T>e27.4T>e^2\approx 7.4, logT>2\log T>2, so BIC penalizes each extra parameter more than AIC. BIC therefore tends to select smaller (p,q)(p,q). That is intentional: BIC is built to find a true finite model; AIC is built to forecast well when the model is an approximation.

Why does BIC typically choose a smaller ARMA than AIC in the same sample when TT is large?

EXERCISE 5.3

Ljung–Box on levels vs on squares.

Yes. GARCH (Chapter 06) can leave ε^t\hat\varepsilon_t uncorrelated (so QQ on levels is fine) while ε^t2\hat\varepsilon_t^2 is strongly autocorrelated. Mean-equation diagnostics do not certify a constant-variance WN. Always inspect residual squares for financial returns.

Can Ljung–Box on ARMA residuals fail to reject, while the model is still a bad description of daily equity returns? What extra plot or test is required?


06 · Chapter Summary

ToolUse
X^t+ht\hat X_{t+h\mid t}MMSE forecast; AR(1) \to mean as hh grows
Random-walk forecastlast observation (+ drift)
AICforecast-oriented order selection
BICconsistent order if a true finite ARMA exists
Ljung–Boxjoint residual ACF test; df HpqH-p-q
Residual squaresGARCH, not extra ARMA lags

Next: Chapter 06 — Volatility Clustering and GARCH, when the mean is roughly WN but the variance is not.