Random search
Random search is an optimization technique that explores a search space by randomly selecting and evaluating candidate solutions or configurations.
Designing Deep Learning Systems: A guide for software engineers
A hyperparameter search method that samples configurations randomly from a defined search space until a search budget is exhausted.
- How it is used
- Deploys independent configuration trials to explore a hyperparameter space under a fixed optimization budget.
- How deep it goes
- Explains sampling, search spaces, budgets, and trial execution while deferring mathematical reasoning.
- Examples
- Uses learning-rate and batch-size ranges, a 100-trial budget, and a conditional classifier search.
- What you can do after
- Apply random search by defining an objective, specifying a search space, and running a bounded set of HPO trials.
Read how Designing Deep Learning Systems: A guide for software engineers explains random search →
Bayesian Optimization in Action
An optimization strategy that evaluates randomly selected candidate locations without adaptively modeling the objective.
- How it is used
- Uses random evaluation as a baseline for expensive black-box optimization before introducing adaptive methods.
- How deep it goes
- Defines uniform and non-uniform sampling and illustrates resource waste, but stops short of implementation details.
- Examples
- Uses a one-dimensional function on [−5, 5], ten evaluations, and a best observed point near x = 4.
- What you can do after
- Apply random search by sampling candidate locations, evaluating them, and retaining the best observed value.
Read how Bayesian Optimization in Action explains random search →
Also covered in
- Machine Learning System Design
- Machine Learning for Tabular Data: XGBoost, Deep Learning, and AI
- Machine Learning Algorithms in Depth
- Building LLM Applications with DSPy
- Optimization Algorithms: AI techniques for design, planning, and control problems
- Experimentation for Engineers
- Grokking AI Algorithms, Second Edition
- Distributed Machine Learning Patterns
What to know first
- language modelA language model is a computational model that represents patterns in linguistic sequences to assign probabilities, predict, generate, or evaluate language.
- regularizationRegularization is a modeling technique that constrains learning or penalizes model complexity to discourage overfitting and improve generalization.
Related concepts
- grid searchalternative to · Grid search is a search method that evaluates configurations formed from specified candidate values, typically every combination, to identify a high-performing configuration.
- Bayesian optimizationcontrasts with · Bayesian optimization is a sequential method for optimizing an expensive or unknown objective by using a probabilistic model to guide evaluations.
- Hyperbandalternative to · Hyperband is a hyperparameter-optimization algorithm that adaptively allocates computational resources among configurations while successively eliminating poorly performing candidates.
- Hyperoptimplemented by · Hyperopt is an open-source Python library for defining search spaces and performing automated hyperparameter optimization.
- lower confidence bounduses · A lower confidence bound is an acquisition function that combines a predicted response with a multiple of predictive uncertainty to favor promising or informative evaluations.
- training datasetuses · A training dataset is a collection of examples supplied to a learning procedure to fit or adapt a model’s parameters or behavior.
Questions about random search
What is random search?
Random search is an optimization technique that explores a search space by randomly selecting and evaluating candidate solutions or configurations.
Which Manning books explain random search?
Designing Deep Learning Systems: A guide for software engineers and Bayesian Optimization in Action.
What should I know before learning random search?
Manning books that teach random search usually introduce language model and regularization first.
What is the difference between random search and grid search?
Random search is an optimization technique that explores a search space by randomly selecting and evaluating candidate solutions or configurations. Grid search is a search method that evaluates configurations formed from specified candidate values, typically every combination, to identify a high-performing configuration.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

