Glossary

Hyperparameter tuning

The process of finding the settings that control how a model learns, such as learning rate or tree depth, rather than what it learns.

Also called: hyperparameter optimization

Hyperparameters are the settings that control how a model learns, chosen before training begins, as opposed to the parameters, such as a tree's splits or a network's weights, that the model learns from data. Examples include a gradient boosting model's learning rate and number of trees, or a random forest's tree depth. Hyperparameter tuning is the process of searching for the combination of these settings that gives the best performance.

Common search strategies include grid search, exhaustively trying every combination from a defined set of values; random search, sampling combinations at random, which often finds good settings faster than grid search in high-dimensional spaces; and Bayesian optimization, which uses the results of earlier trials to choose more promising settings to try next. Each candidate combination is evaluated using cross-validation rather than the training set alone, so tuning does not simply reward settings that let the model overfit.

Tuning matters because the same algorithm can perform very differently depending on its settings, and poor defaults can leave real accuracy on the table. Its main costs are compute and time, since each trial usually requires retraining the model, which is why AutoML tools increasingly automate the search rather than leaving it to manual trial and error.

Last reviewed September 22, 2026

In the index now

Related terms

Related tools

Related guides