Hyperparameter Tuning

35 min
Block 1 — Optimization as search
Objective
formalize hyperparameter tuning as an outer optimization loop over a validation objective with a noisy, expensive, non-differentiable, mixed-type search space. Master GridSearchCV and RandomizedSearchCV in their full semantics. Measure the empirical superiority of random search on sparse problems. Understand successive halving as a budget-aware strategy. Quantify the winner's curse, implement nested cross-validation for honest assessment, and select a search strategy by budget and problem structure.
Estimated duration
90 minutes
Prerequisites
chapters 009, 030, 034
Associated quizzes
035.1-quiz-gridsearch.md to 035.8-quiz-strategy-selection.md

Preview — the rest of the lesson is for enrolled readers.

Already enrolled with a code?

Your access is tied to your account, not to this link. Sign in with the same email you used in class: your course is waiting, no need to enter the code again.

Sign inNo account yet? Create one
This lesson is part of the “Cross-Validation and Hyperparameter Tuning” module

The first modules of the course are open to everyone. For the rest you have three options: buy this course once and for all, subscribe, or enter the code handed out in class.

Are you a student on this course?

The code is tied to your account: sign in or create an account and it will be applied automatically when you come back.

No account yet? Create one