Databricks Certified Machine Learning - Associate

Get started today

Ultimate access to all questions.

In the context of hyperparameter tuning, explain the concept of random search and its advantages over grid search. Provide a scenario where random search would be more effective than grid search.

Simulated

Random search is a method where hyperparameters are selected randomly from a predefined search space, and the model is trained multiple times with different combinations of hyperparameters. It is more effective than grid search when the search space is large and the relationship between hyperparameters is not well understood.

100.0%

Comments

Loading comments...

Random search is a method where hyperparameters are selected based on a probability distribution, and the model is trained multiple times with different combinations of hyperparameters. It is more effective than grid search when the search space is small and the relationship between hyperparameters is well understood.

Random search is a method where hyperparameters are selected based on a predefined grid, and the model is trained multiple times with different combinations of hyperparameters. It is less effective than grid search when the search space is large and the relationship between hyperparameters is not well understood.

Random search is a method where hyperparameters are selected based on a predefined grid, and the model is trained multiple times with different combinations of hyperparameters. It is more effective than grid search when the search space is small and the relationship between hyperparameters is well understood.