A simple k-nearest-neighbor surrogate model for the objective function.
Predicts the objective at a new point as the distance-weighted average of
the k nearest observed points. This is a lightweight alternative to a full
Random Forest (SMAC3) or Gaussian Process, suitable for small budgets.
A Sobol quasi-random sequence generator for uniform coverage of the [0,1]^d
unit hypercube. Uses the Joe & Kuo direction numbers (compact implementation).
A multi-armed bandit using the Track-and-Stop algorithm for best-arm identification.
Given a small set of pre-selected configurations, it adaptively allocates samples
to identify the best one with statistical rigor.