liveBook · Manning

Regularization parameter

A regularization parameter is a model-fitting setting that controls the influence of a penalty or constraint relative to fit to the data.

How 2 Manning books explain it

Grokking Machine Learning

A training hyperparameter that controls the strength of the complexity penalty relative to predictive error.

How it is used
Balances predictive performance against model simplicity during training.
How deep it goes
Defines λ in the regularized error formula and explains zero and large values, but gives no detailed selection procedure.
Examples
Uses a λ = 0.1 polynomial-regression exercise to compare lasso and ridge errors under MAE.
What you can do after
Apply validation to help choose λ while balancing model simplicity and predictive performance.

Read how Grokking Machine Learning explains regularization parameter →

Ensemble Methods for Machine Learning

A regularization parameter controls the strength of the complexity penalty relative to the data-fitting loss.

How it is used
Balances training fit against model simplicity during machine-learning optimization.
How deep it goes
Explains the fit-complexity tradeoff, parameter-direction effects, and validation-based tuning, but does not derive optimization procedures.
Examples
Uses SVR models, RBF kernels, Friedman-1 regression data, validation curves, and regularized logistic-loss formulas.
What you can do after
Apply it via scikit-learn validation curves to compare complexity, training fit, and generalization across parameter values.

Read how Ensemble Methods for Machine Learning explains regularization parameter →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.