Generalized Additive Models › Advantages

Michael BrenndoerferOctober 25, 20262 min read
Machine Learning from ScratchAll chapters
Part 5 of 15Linear and Generalized Linear Models
Chapter 39Generalized Additive Models › Advantages
Reading section 2 of 10 · Advantages · 2 minSection 2 of 10 · 2 min

Section 2 of 10 · 2 min read

Generalized Additive Models › AdvantagesSection view · Sections in this chapter2 / 10 ↓
Reading tools Definitions, links & notes

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

Notes & comments

The additive restriction limits the number of functions that need estimating. For example, a Cartesian grid with mm positions per predictor contains mpm^p grid points, while pp separate one-dimensional grids contain pmpm positions. A GAM imposes that lower-dimensional additive structure rather than estimating an unrestricted surface. The comparison describes the representation, not a universal sample-size bound. The additive restriction represents a sum of pp one-dimensional functions instead of an unrestricted surface. Their coefficients still have to be fitted jointly, and computation grows with the total basis dimension.

Second, a GAM remains interpretable. Because the components enter additively, we can plot each fjf_j as a curve and read off how the predicted value (or the transformed mean) changes as a function of xjx_j, holding the others fixed. These are direct plots of model terms on the additive-predictor scale. With a nonlinear link, they differ from response-scale partial-dependence curves, which average predictions over other inputs; see Part XI: Model Interpretation. That makes GAMs attractive in domains where the answer "the model predicts this" is not enough and stakeholders want to know why.

Third, a GAM extends the machinery of generalized linear models to non-Gaussian responses without abandoning interpretability. We can use the same spline bases we built for continuous responses inside a logistic, Poisson, or gamma regression by adding a link function. This gives us nonlinear logistic and count regression through penalized likelihood. As a consequence, when a linear GLM is clearly misspecified, such as a binary outcome whose logit is obviously curved in a predictor, a GAM is a natural upgrade.

Finally, the smoothing penalty plays the role of a continuous regularizer. Rather than choosing the number of knots arbitrarily, we let the data guide how wiggly each curve should be via cross-validation or marginal likelihood. This is the same idea ridge regularization will formalize in the next chapter Ridge Regularization (L2 Regularization); in fact, a GAM with a difference penalty is a generalized quadratic-penalty regression on an expanded feature space; the penalty matrix differs from ordinary ridge.

Comments

Add to the conversation

A question, a correction, or an example from your own work.

No comments yet. Be the first to share your thoughts!

Newsletter

Stay up to date

Get new articles, book updates, and notes on AI and technology.

Unsubscribe at any time. Privacy policy