.. DO NOT EDIT. .. THIS FILE WAS AUTOMATICALLY GENERATED BY SPHINX-GALLERY. .. TO MAKE CHANGES, EDIT THE SOURCE PYTHON FILE: .. "examples_regression/2-advanced-analysis/plot_nested-cv.py" .. LINE NUMBERS ARE GIVEN BELOW. .. only:: html .. note:: :class: sphx-glr-download-link-note Click :ref:`here ` to download the full example code .. rst-class:: sphx-glr-example-title .. _sphx_glr_examples_regression_2-advanced-analysis_plot_nested-cv.py: =========================================================== Nested cross-validation for estimating prediction intervals =========================================================== This example compares non-nested and nested cross-validation strategies for estimating prediction intervals with :class:`~mapie.regression.MapieRegressor`. In the regular sequential method, a cross-validation parameter search is carried out over the entire training set. The model with the set of parameters that gives the best score is then used in MAPIE to estimate the prediction intervals associated with the predictions. A limitation of this method is that residuals used by MAPIE are computed on the validation dataset, which can be subject to overfitting as far as hyperparameter tuning is concerned. This fools MAPIE into being slightly too optimistic with confidence intervals. To solve this problem, an alternative option is to perform a nested cross-validation parameter search directly within the MAPIE estimator on each *out-of-fold* dataset. For each testing fold used by MAPIE to store residuals, an internal cross-validation occurs on the training fold, optimizing hyperparameters. This ensures that residuals seen by MAPIE are never seen by the algorithm beforehand. However, this method is much heavier computationally since it results in ``N * P`` calculations, where *N* is the number of *out-of-fold* models and *P* the number of parameter search cross-validations, versus ``N + P`` for the non-nested approach. Here, we compare the two strategies on a toy dataset. We use the Random Forest Regressor as a base regressor for the CV+ strategy. For the sake of light computation, we adopt a RandomizedSearchCV parameter search strategy with a low number of iterations and with a reproducible random state. The two approaches give slightly different predictions with the nested CV approach estimating slightly larger prediction interval widths by a few percents at most (apart from a handful of exceptions). For this example, the two approaches result in identical scores and identical effective coverages. In the general case, the recommended approach is to use nested cross-validation, since it does not underestimate conformity scores and hence prediction intervals. However, in this particular example, effective coverages of both nested and non-nested methods are the same. .. GENERATED FROM PYTHON SOURCE LINES 46-163 .. image-sg:: /examples_regression/2-advanced-analysis/images/sphx_glr_plot_nested-cv_001.png :alt: plot nested cv :srcset: /examples_regression/2-advanced-analysis/images/sphx_glr_plot_nested-cv_001.png :class: sphx-glr-single-img .. rst-class:: sphx-glr-script-out Out: .. code-block:: none Scores and effective coverages for the CV+ strategy using the Random Forest model. Score on the test set for the non-nested and nested CV approaches: 1.326, 1.326 Effective coverage on the test set for the non-nested and nested CV approaches: 0.990, 0.990 | .. code-block:: default import matplotlib.pyplot as plt import numpy as np from scipy.stats import randint from sklearn.ensemble import RandomForestRegressor from sklearn.metrics import mean_squared_error from sklearn.model_selection import RandomizedSearchCV, train_test_split from sklearn.datasets import make_sparse_uncorrelated from mapie.metrics import regression_coverage_score from mapie.regression import MapieRegressor random_state = 42 # Load the toy data X, y = make_sparse_uncorrelated(500, random_state=random_state) # Split the data into training and test sets. X_train, X_test, y_train, y_test = train_test_split( X, y, test_size=0.2, random_state=random_state ) # Define the Random Forest model as base regressor with parameter ranges. rf_model = RandomForestRegressor(random_state=random_state, verbose=0) rf_params = {"max_depth": randint(2, 10), "n_estimators": randint(10, 100)} # Cross-validation and prediction-interval parameters. cv = 10 n_iter = 5 alpha = 0.05 # Non-nested approach with the CV+ strategy using the Random Forest model. cv_obj = RandomizedSearchCV( rf_model, param_distributions=rf_params, n_iter=n_iter, cv=cv, scoring="neg_root_mean_squared_error", return_train_score=True, verbose=0, random_state=random_state, n_jobs=-1, ) cv_obj.fit(X_train, y_train) best_est = cv_obj.best_estimator_ mapie_non_nested = MapieRegressor( best_est, method="plus", cv=cv, agg_function="median", n_jobs=-1, random_state=random_state ) mapie_non_nested.fit(X_train, y_train) y_pred_non_nested, y_pis_non_nested = mapie_non_nested.predict( X_test, alpha=alpha ) widths_non_nested = y_pis_non_nested[:, 1, 0] - y_pis_non_nested[:, 0, 0] coverage_non_nested = regression_coverage_score( y_test, y_pis_non_nested[:, 0, 0], y_pis_non_nested[:, 1, 0] ) score_non_nested = mean_squared_error(y_test, y_pred_non_nested, squared=False) # Nested approach with the CV+ strategy using the Random Forest model. cv_obj = RandomizedSearchCV( rf_model, param_distributions=rf_params, n_iter=n_iter, cv=cv, scoring="neg_root_mean_squared_error", return_train_score=True, verbose=0, random_state=random_state, n_jobs=-1, ) mapie_nested = MapieRegressor( cv_obj, method="plus", cv=cv, agg_function="median", random_state=random_state ) mapie_nested.fit(X_train, y_train) y_pred_nested, y_pis_nested = mapie_nested.predict(X_test, alpha=alpha) widths_nested = y_pis_nested[:, 1, 0] - y_pis_nested[:, 0, 0] coverage_nested = regression_coverage_score( y_test, y_pis_nested[:, 0, 0], y_pis_nested[:, 1, 0] ) score_nested = mean_squared_error(y_test, y_pred_nested, squared=False) # Print scores and effective coverages. print( "Scores and effective coverages for the CV+ strategy using the " "Random Forest model." ) print( "Score on the test set for the non-nested and nested CV approaches: ", f"{score_non_nested: .3f}, {score_nested: .3f}", ) print( "Effective coverage on the test set for the non-nested " "and nested CV approaches: ", f"{coverage_non_nested: .3f}, {coverage_nested: .3f}", ) # Compare prediction interval widths. fig, (ax1, ax2) = plt.subplots(1, 2, figsize=(13, 6)) min_x = np.min([np.min(widths_nested), np.min(widths_non_nested)]) max_x = np.max([np.max(widths_nested), np.max(widths_non_nested)]) ax1.set_xlabel("Prediction interval width using the nested CV approach") ax1.set_ylabel("Prediction interval width using the non-nested CV approach") ax1.scatter(widths_nested, widths_non_nested) ax1.plot([min_x, max_x], [min_x, max_x], ls="--", color="k") ax2.axvline(x=0, color="r", lw=2) ax2.set_xlabel( "[width(non-nested CV) - width(nested CV)] / width(non-nested CV)" ) ax2.set_ylabel("Counts") ax2.hist( (widths_non_nested - widths_nested) / widths_non_nested, bins=15, edgecolor="black", ) plt.show() .. rst-class:: sphx-glr-timing **Total running time of the script:** ( 0 minutes 45.758 seconds) .. _sphx_glr_download_examples_regression_2-advanced-analysis_plot_nested-cv.py: .. only :: html .. container:: sphx-glr-footer :class: sphx-glr-footer-example .. container:: sphx-glr-download sphx-glr-download-python :download:`Download Python source code: plot_nested-cv.py ` .. container:: sphx-glr-download sphx-glr-download-jupyter :download:`Download Jupyter notebook: plot_nested-cv.ipynb ` .. only:: html .. rst-class:: sphx-glr-signature `Gallery generated by Sphinx-Gallery `_