liveBook · Manning

Unit cube

As explained in Bayesian Optimization in Action

A unit cube, or unit hypercube, is the multidimensional hypercube whose coordinate values range from zero to one in every dimension.

A unit cube is the multidimensional region whose coordinates range from 0 to 1 in every dimension. In optimization, it provides a normalized search space for candidate points. section 7.5 section 5.3.2

Use the unit cube to:

  • Represent each candidate as a vector with one coordinate per tunable parameter. section 7.5
  • Generate evenly distributed candidates before resizing them to the problem's actual bounds. section 5.3.2

Airplane design

An airplane-design objective uses four parameters scaled between 0 and 1, making the search domain a four-dimensional unit hypercube. Its bounds tensor is [[0, 0, 0, 0], [1, 1, 1, 1]]. section 7.5

Figure 5.14 Points from a Sobol sequence vs. uniformly sampled points in the two-dimensional unit square. The Sobol sequence covers the square more evenly and, therefore, should be used by TS.

Compare Sobol and uniform points in a two-dimensional unit square to see why evenly covering the unit cube matters in higher-dimensional search. section 5.3.2

How Bayesian Optimization in Action covers it

How deep it goes
Defines coordinate bounds and shows sampling, but does not develop geometric properties or higher-dimensional visualization.
Examples
Uses a four-dimensional airplane-design domain and two-dimensional Sobol-versus-uniform sampling comparisons.
What you can do after
Apply it via PyTorch by sampling the unit cube and resizing candidates to the desired bounds.
How it connects
Connects normalized parameters with Sobol sequences, search spaces, Gaussian processes, and Bayesian optimization.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Bayesian Optimization in Action. The section links point to the parts of the book it draws on.