Random Search en Grid Search vergelijken

In de video heb je zojuist enkele voor- en nadelen van random search ten opzichte van grid search gezien.

Welke van de volgende opties is een voordeel van random search?

Deze oefening maakt deel uit van de cursus

Hyperparameter Tuning in Python

Cursus bekijken

Praktische interactieve oefening

Zet theorie om in actie met een van onze interactieve oefeningen.

Begin met trainen

Deze oefening maakt deel uit van de cursus

Hyperparameter Tuning in Python

SkillTag.level.intermediateSkillTag.label

4.9+

682 reviews

Begin de cursus gratis

In this introductory chapter you will learn the difference between hyperparameters and parameters. You will practice extracting and analyzing parameters, setting hyperparameter values for several popular machine learning algorithms. Along the way you will learn some best practice tips & tricks for choosing which hyperparameters to tune and what values to set & build learning curves to analyze your hyperparameter choices.

Exercise 1: Introduction & 'Parameters'Exercise 2: Parameters in Logistic Regression Exercise 3: Extracting a Logistic Regression parameter Exercise 4: Extracting a Random Forest parameter Exercise 5: Introducing Hyperparameters Exercise 6: Hyperparameters in Random Forests Exercise 7: Exploring Random Forest Hyperparameters Exercise 8: Hyperparameters of KNN Exercise 9: Setting & Analyzing Hyperparameter Values Exercise 10: Automating Hyperparameter Choice Exercise 11: Building Learning Curves

This chapter introduces you to a popular automated hyperparameter tuning methodology called Grid Search. You will learn what it is, how it works and practice undertaking a Grid Search using Scikit Learn. You will then learn how to analyze the output of a Grid Search & gain practical experience doing this.

Exercise 1: Introducing Grid Search Exercise 2: Build Grid Search functions Exercise 3: Iteratively tune multiple hyperparameters Exercise 4: How Many Models?Exercise 5: Grid Search with Scikit Learn Exercise 6: GridSearchCV inputs Exercise 7: GridSearchCV with Scikit Learn Exercise 8: Understanding a grid search output Exercise 9: Using the best outputs Exercise 10: Exploring the grid search results Exercise 11: Analyzing the best results Exercise 12: Using the best results

In this chapter you will be introduced to another popular automated hyperparameter tuning methodology called Random Search. You will learn what it is, how it works and importantly how it differs from grid search. You will learn some advantages and disadvantages of this method and when to choose this method compared to Grid Search. You will practice undertaking a Random Search with Scikit Learn as well as visualizing & interpreting the output.

Exercise 1: Introductie van Random Search Exercise 2: Hyperparameters willekeurig bemonsteren Exercise 3: Willekeurig zoeken met Random Forest Exercise 4: Een Random Search visualiseren Exercise 5: Random Search in Scikit Learn Exercise 6: RandomSearchCV-invoer Exercise 7: Het RandomizedSearchCV-object Exercise 8: RandomSearchCV in Scikit Learn Exercise 9: Grid Search en Random Search vergelijken Exercise 10: Random Search en Grid Search vergelijken

Huidige oefening

Exercise 11: Grid en Random Search naast elkaar

In this final chapter you will be given a taste of more advanced hyperparameter tuning methodologies known as ''informed search''. This includes a methodology known as Coarse To Fine as well as Bayesian & Genetic hyperparameter tuning algorithms. You will learn how informed search differs from uninformed search and gain practical skills with each of the mentioned methodologies, comparing and contrasting them as you go.

Exercise 1: Informed Search: Coarse to Fine Exercise 2: Visualizing Coarse to Fine Exercise 3: Coarse to Fine Iterations Exercise 4: Informed Search: Bayesian Statistics Exercise 5: Bayes Rule in Python Exercise 6: Bayesian Hyperparameter tuning with Hyperopt Exercise 7: Informed Search: Genetic Algorithms Exercise 8: Genetic Hyperparameter Tuning with TPOT Exercise 9: Analysing TPOT's stability Exercise 10: Congratulations!