Shiller (1984) Smoothness Priors and Nonlinear Regression

bayesiannonparametricshrinkageregression

Summary

Develops Bayesian smoothness priors for nonlinear regression — priors that express the belief that an unknown function f(x)f(x) changes slope gradually (i.e., is smooth). The method allows estimation of an arbitrary unknown function with standard linear regression software: the smoothness prior is equivalent to adding dummy observations that penalize curvature, so no new algorithms are needed. Connects Bayesian smoothness priors to cubic spline interpolation (the posterior mean under continuous smoothness priors is the cubic natural spline) and to earlier distributed-lag shrinkage priors (Shiller 1973). Illustrated on Nerlove (1963) electricity generation cost data.

Key Claims

Concepts Introduced or Extended

Entities Mentioned

Quotes

"In most applications of the linear regression model, there is apparently no theory that the relation should be linear. Linearity is assumed for simplicity."

"Those who use the multiple-regression model in applied work often find themselves seeking simple expedients to allow for nonlinearity in an independent variable. This article offers another such simple expedient based on recent Bayesian literature on spline smoothing."

My Take

An elegant bridging paper connecting three literatures: Bayesian shrinkage priors (Shiller 1973), spline smoothing (Wahba 1978), and standard regression practice. The main practical contribution is the dummy-observation implementation — it means any econometrician with an OLS package can do Bayesian nonparametric curve fitting without special software. The connection to cubic splines (Proposition 3) gives a firm frequentist/nonparametric interpretation of the Bayesian estimator and helps calibrate kk. Historically important as a precursor to the ridge regression and Tikhonov regularization literature applied to function estimation. In time-series settings, the discrete smoothness prior (Shiller 1973) is used for smooth distributed lag estimation — the same framework as polynomial distributed lags but without requiring the polynomial form. The paper does not address the data-driven selection of kk (cross-validation or empirical Bayes), which would become a major focus of subsequent literature.