liveBook · Manning

Search space

As explained in Evolutionary Deep Learning: Genetic algorithms and neural networks

A search space is the set of candidate configurations or solutions that an optimization process can explore.

A search space is the set of candidate configurations an optimization process can explore. In hyperparameter optimization, each dimension represents a tunable input such as layer width, learning rate, batch size, or epochs. section 5.5.2 section 5.4.2

Adding dimensions expands the number of candidates multiplicatively: four parameters with ten possible steps each create 10,000 grid-search cells. Evolutionary strategies can explore these dimensions while fitness records reveal clustering around promising configurations. section 5.5.2

Implementations make the space explicit by:

  • Mapping normalized individual or particle values onto parameter ranges, while static generators hold selected parameters fixed. section 5.4.2
  • Discretizing continuous candidates and caching evaluations to reduce duplicate model training. section 9.5

Four-dimensional hyperparameter space

Varying middle-layer size, learning rate, batch size, and epochs creates a four-dimensional space. Setting ten candidate steps for each parameter yields 10,000 possible grid-search configurations. section 5.5.2

How Evolutionary Deep Learning: Genetic algorithms and neural networks covers it

How deep it goes
Implements range generators, candidate mapping, fitness evaluation, dimensional visualization, discretization, and caching rather than formal search-space theory.
Examples
Uses neural-network hyperparameters, PCA plots, particle histories, and a discretized DCGAN exploration space with 100,000 possible models.
What it assumes
Assumes familiarity with model training, losses, and optimization algorithms while demonstrating hyperparameter mapping and evaluation incrementally.
What you can do after
Apply it via Python optimization code to define candidate ranges, evaluate configurations, visualize exploration, and avoid repeated expensive training.
How it connects
Connects search spaces to hyperparameter optimization, grid search, random search, PCA, evolutionary strategies, particle swarm optimization, and genetic algorithms.

Also explained in

Compare how 11 books explain search space →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Evolutionary Deep Learning: Genetic algorithms and neural networks. The section links point to the parts of the book it draws on.