Can you explain random search?

What is random search in optimization?

Random search is a simple optimization technique that randomly samples points in the search space to find the best solution.

How does it compare to grid search?

Unlike grid search, which evaluates all combinations systematically, random search samples randomly, often finding good solutions faster.

When should I use random search?

Use random search when the search space is large and you want a quick, efficient way to explore it without exhaustive evaluation.

Are there any downsides to using random search?

Yes, random search can miss optimal solutions and may require more iterations to converge compared to more systematic methods.