Random Search

Random Search is a practical method that can be more efficient than Grid Search in high-dimensional hyperparameter spaces. Instead of evaluating all combinations, it searches over randomly sampled candidates. This can be especially effective when only a small subset of parameters strongly drives performance. It is often preferred when time and compute resources are limited.