AI engineering glossary · ML fundamentals
What is random search?
Random search: A tuning method that samples hyperparameter combinations at random from chosen ranges instead of trying every grid point. It often finds good settings faster than exhaustive search because usually only a few hyperparameters matter much, and random draws explore those more varied values.
Random search: an example
Draw 30 random pairs of learning rate between 0.001 and 1 and depth between 2 and 12, then keep the best-scoring pair.
Related terms
More ML fundamentals terms
- Random seed
- Regression
- Regularisation
- Representation learning
- Reproducibility
- Selection bias
- Self-supervised learning
- Semi-supervised learning
Where you learn it
Random search is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.