# 3.2. Tuning the hyper-parameters of an estimator¶

Hyper-parameters are parameters that are not directly learnt within estimators.
In scikit-learn they are passed as arguments to the constructor of the
estimator classes. Typical examples include `C`

, `kernel`

and `gamma`

for Support Vector Classifier, `alpha`

for Lasso, etc.

It is possible and recommended to search the hyper-parameter space for the best Cross-validation: evaluating estimator performance score.

Any parameter provided when constructing an estimator may be optimized in this manner. Specifically, to find the names and current values for all parameters for a given estimator, use:

```
estimator.get_params()
```

A search consists of:

- an estimator (regressor or classifier such as
`sklearn.svm.SVC()`

); - a parameter space;
- a method for searching or sampling candidates;
- a cross-validation scheme; and
- a score function.

Some models allow for specialized, efficient parameter search strategies,
outlined below.
Two generic approaches to sampling search candidates are provided in
scikit-learn: for given values, `GridSearchCV`

exhaustively considers
all parameter combinations, while `RandomizedSearchCV`

can sample a
given number of candidates from a parameter space with a specified
distribution. After describing these tools we detail
best practice applicable to both approaches.

Note that it is common that a small subset of those parameters can have a large impact on the predictive or computation performance of the model while others can be left to their default values. It is recommended to read the docstring of the estimator class to get a finer understanding of their expected behavior, possibly by reading the enclosed reference to the literature.

## 3.2.1. Exhaustive Grid Search¶

The grid search provided by `GridSearchCV`

exhaustively generates
candidates from a grid of parameter values specified with the `param_grid`

parameter. For instance, the following `param_grid`

:

```
param_grid = [
{'C': [1, 10, 100, 1000], 'kernel': ['linear']},
{'C': [1, 10, 100, 1000], 'gamma': [0.001, 0.0001], 'kernel': ['rbf']},
]
```

specifies that two grids should be explored: one with a linear kernel and C values in [1, 10, 100, 1000], and the second one with an RBF kernel, and the cross-product of C values ranging in [1, 10, 100, 1000] and gamma values in [0.001, 0.0001].

The `GridSearchCV`

instance implements the usual estimator API: when
“fitting” it on a dataset all the possible combinations of parameter values are
evaluated and the best combination is retained.

Examples:

- See sphx_glr_auto_examples_model_selection_grid_search_digits.py for an example of Grid Search computation on the digits dataset.
- See Sample pipeline for text feature extraction and evaluation for an example
of Grid Search coupling parameters from a text documents feature
extractor (n-gram count vectorizer and TF-IDF transformer) with a
classifier (here a linear SVM trained with SGD with either elastic
net or L2 penalty) using a
`pipeline.Pipeline`

instance. - See Nested versus non-nested cross-validation for an example of Grid Search within a cross validation loop on the iris dataset. This is the best practice for evaluating the performance of a model with grid search.

## 3.2.2. Randomized Parameter Optimization¶

While using a grid of parameter settings is currently the most widely used
method for parameter optimization, other search methods have more
favourable properties.
`RandomizedSearchCV`

implements a randomized search over parameters,
where each setting is sampled from a distribution over possible parameter values.
This has two main benefits over an exhaustive search:

- A budget can be chosen independent of the number of parameters and possible values.
- Adding parameters that do not influence the performance does not decrease efficiency.

Specifying how parameters should be sampled is done using a dictionary, very
similar to specifying parameters for `GridSearchCV`

. Additionally,
a computation budget, being the number of sampled candidates or sampling
iterations, is specified using the `n_iter`

parameter.
For each parameter, either a distribution over possible values or a list of
discrete choices (which will be sampled uniformly) can be specified:

```
{'C': scipy.stats.expon(scale=100), 'gamma': scipy.stats.expon(scale=.1),
'kernel': ['rbf'], 'class_weight':['balanced', None]}
```

This example uses the `scipy.stats`

module, which contains many useful
distributions for sampling parameters, such as `expon`

, `gamma`

,
`uniform`

or `randint`

.
In principle, any function can be passed that provides a `rvs`

(random
variate sample) method to sample a value. A call to the `rvs`

function should
provide independent random samples from possible parameter values on
consecutive calls.

Warning

The distributions in

`scipy.stats`

prior to version scipy 0.16 do not allow specifying a random state. Instead, they use the global numpy random state, that can be seeded via`np.random.seed`

or set using`np.random.set_state`

. However, beginning scikit-learn 0.18, the`sklearn.model_selection`

module sets the random state provided by the user if scipy >= 0.16 is also available.

For continuous parameters, such as `C`

above, it is important to specify
a continuous distribution to take full advantage of the randomization. This way,
increasing `n_iter`

will always lead to a finer search.

Examples:

- sphx_glr_auto_examples_model_selection_randomized_search.py compares the usage and efficiency of randomized search and grid search.

References:

- Bergstra, J. and Bengio, Y., Random search for hyper-parameter optimization, The Journal of Machine Learning Research (2012)

## 3.2.3. Tips for parameter search¶

### 3.2.3.1. Specifying an objective metric¶

By default, parameter search uses the `score`

function of the estimator
to evaluate a parameter setting. These are the
`sklearn.metrics.accuracy_score`

for classification and
`sklearn.metrics.r2_score`

for regression. For some applications,
other scoring functions are better suited (for example in unbalanced
classification, the accuracy score is often uninformative). An alternative
scoring function can be specified via the `scoring`

parameter to
`GridSearchCV`

, `RandomizedSearchCV`

and many of the
specialized cross-validation tools described below.
See The scoring parameter: defining model evaluation rules for more details.

### 3.2.3.2. Composite estimators and parameter spaces¶

Pipeline: chaining estimators describes building composite estimators whose parameter space can be searched with these tools.

### 3.2.3.3. Model selection: development and evaluation¶

Model selection by evaluating various parameter settings can be seen as a way to use the labeled data to “train” the parameters of the grid.

When evaluating the resulting model it is important to do it on
held-out samples that were not seen during the grid search process:
it is recommended to split the data into a **development set** (to
be fed to the `GridSearchCV`

instance) and an **evaluation set**
to compute performance metrics.

This can be done by using the `train_test_split`

utility function.

### 3.2.3.4. Parallelism¶

`GridSearchCV`

and `RandomizedSearchCV`

evaluate each parameter
setting independently. Computations can be run in parallel if your OS
supports it, by using the keyword `n_jobs=-1`

. See function signature for
more details.

### 3.2.3.5. Robustness to failure¶

Some parameter settings may result in a failure to `fit`

one or more folds
of the data. By default, this will cause the entire search to fail, even if
some parameter settings could be fully evaluated. Setting `error_score=0`

(or =np.NaN) will make the procedure robust to such failure, issuing a
warning and setting the score for that fold to 0 (or NaN), but completing
the search.

## 3.2.4. Alternatives to brute force parameter search¶

### 3.2.4.1. Model specific cross-validation¶

Some models can fit data for a range of values of some parameter almost as efficiently as fitting the estimator for a single value of the parameter. This feature can be leveraged to perform a more efficient cross-validation used for model selection of this parameter.

The most common parameter amenable to this strategy is the parameter
encoding the strength of the regularizer. In this case we say that we
compute the **regularization path** of the estimator.

Here is the list of such models:

`linear_model.ElasticNetCV` ([l1_ratio, eps, ...]) |
Elastic Net model with iterative fitting along a regularization path |

`linear_model.LarsCV` ([fit_intercept, ...]) |
Cross-validated Least Angle Regression model |

`linear_model.LassoCV` ([eps, n_alphas, ...]) |
Lasso linear model with iterative fitting along a regularization path |

`linear_model.LassoLarsCV` ([fit_intercept, ...]) |
Cross-validated Lasso, using the LARS algorithm |

`linear_model.LogisticRegressionCV` ([Cs, ...]) |
Logistic Regression CV (aka logit, MaxEnt) classifier. |

`linear_model.MultiTaskElasticNetCV` ([...]) |
Multi-task L1/L2 ElasticNet with built-in cross-validation. |

`linear_model.MultiTaskLassoCV` ([eps, ...]) |
Multi-task L1/L2 Lasso with built-in cross-validation. |

`linear_model.OrthogonalMatchingPursuitCV` ([...]) |
Cross-validated Orthogonal Matching Pursuit model (OMP) |

`linear_model.RidgeCV` ([alphas, ...]) |
Ridge regression with built-in cross-validation. |

`linear_model.RidgeClassifierCV` ([alphas, ...]) |
Ridge classifier with built-in cross-validation. |

### 3.2.4.2. Information Criterion¶

Some models can offer an information-theoretic closed-form formula of the optimal estimate of the regularization parameter by computing a single regularization path (instead of several when using cross-validation).

Here is the list of models benefitting from the Akaike Information Criterion (AIC) or the Bayesian Information Criterion (BIC) for automated model selection:

`linear_model.LassoLarsIC` ([criterion, ...]) |
Lasso model fit with Lars using BIC or AIC for model selection |

### 3.2.4.3. Out of Bag Estimates¶

When using ensemble methods base upon bagging, i.e. generating new training sets using sampling with replacement, part of the training set remains unused. For each classifier in the ensemble, a different part of the training set is left out.

This left out portion can be used to estimate the generalization error without having to rely on a separate validation set. This estimate comes “for free” as no additional data is needed and can be used for model selection.

This is currently implemented in the following classes:

`ensemble.RandomForestClassifier` ([...]) |
A random forest classifier. |

`ensemble.RandomForestRegressor` ([...]) |
A random forest regressor. |

`ensemble.ExtraTreesClassifier` ([...]) |
An extra-trees classifier. |

`ensemble.ExtraTreesRegressor` ([n_estimators, ...]) |
An extra-trees regressor. |

`ensemble.GradientBoostingClassifier` ([loss, ...]) |
Gradient Boosting for classification. |

`ensemble.GradientBoostingRegressor` ([loss, ...]) |
Gradient Boosting for regression. |