Skip to main content

Module problem

Module problem 

Expand description

The objectives the demo optimizes.

Each problem declares its box-bounded parameters, so model-based samplers (CMA-ES, GP-EI) see the whole search space up front (D88). The test functions evaluate in closed form, so a test can recompute every reported value independently; the custom function is a user formula (D94); and Cart-pole is a real training run of crate::cartpole (D113).

Structs§

Bound
One box-bounded continuous parameter.

Enums§

Problem
A minimization problem.