What is the practical difference between using grid search and random search for hyperparameter tuning?
Correct! Well done.
Incorrect.
The correct answer is B) Grid search exhaustively evaluates every combination on a predefined grid, while random search samples a fixed number of random combinations, often finding good results faster when only a few hyperparameters truly matter
Correct Answer
Grid search exhaustively evaluates every combination on a predefined grid, while random search samples a fixed number of random combinations, often finding good results faster when only a few hyperparameters truly matter
Grid search becomes computationally expensive as the number of hyperparameters grows, since the number of combinations multiplies. Random search samples combinations randomly and often finds comparably good settings more efficiently, because typically only a few hyperparameters have a large effect on performance (Bergstra and Bengio, 2012).