Skip to main content

BayesianOptimizer

Struct BayesianOptimizer 

Source
pub struct BayesianOptimizer { /* private fields */ }
Expand description

The Bayesian optimizer.

Supports sequential single-objective, batch, multi-objective (ParEGO), and constrained optimization.

Implementations§

Source§

impl BayesianOptimizer

Source

pub fn new( bounds: Vec<(f64, f64)>, config: BayesianOptimizerConfig, ) -> OptimizeResult<Self>

Create a new Bayesian optimizer.

§Arguments
  • bounds - Search bounds for each dimension: [(lo, hi), ...]
  • config - Optimizer configuration
Source

pub fn with_kernel( bounds: Vec<(f64, f64)>, kernel: Box<dyn SurrogateKernel>, config: BayesianOptimizerConfig, ) -> OptimizeResult<Self>

Create a new optimizer with a custom kernel.

Source

pub fn add_constraint<F>(&mut self, name: &str, func: F)
where F: Fn(&ArrayView1<'_, f64>) -> f64 + Send + Sync + 'static,

Add a constraint: satisfied when g(x) <= 0.

Source

pub fn warm_start( &mut self, x_data: &Array2<f64>, y_data: &Array1<f64>, ) -> OptimizeResult<()>

Warm-start from previous evaluations.

Source

pub fn optimize<F>( &mut self, objective: F, n_iter: usize, ) -> OptimizeResult<BayesianOptResult>
where F: Fn(&ArrayView1<'_, f64>) -> f64,

Run the sequential optimization loop.

§Arguments
  • objective - Function to minimize.
  • n_iter - Number of iterations (function evaluations after initial design).
Source

pub fn optimize_batch<F>( &mut self, objective: F, n_rounds: usize, batch_size: usize, ) -> OptimizeResult<BayesianOptResult>
where F: Fn(&ArrayView1<'_, f64>) -> f64,

Run batch optimization, evaluating batch_size points in parallel per round.

Uses the Kriging Believer strategy: after selecting a candidate, the GP is updated with a fantasised observation at the predicted mean.

Source

pub fn optimize_multi_objective<F>( &mut self, objectives: &[F], n_iter: usize, ) -> OptimizeResult<BayesianOptResult>
where F: Fn(&ArrayView1<'_, f64>) -> f64,

Multi-objective optimization via ParEGO scalarization.

Uses random weight vectors to scalarise the objectives into a single augmented Chebyshev function, then runs standard BO on the scalarization.

§Arguments
  • objectives - Vector of objective functions to minimize.
  • n_iter - Number of sequential iterations.
Source

pub fn ask(&mut self) -> OptimizeResult<Array1<f64>>

Get the ask interface: suggest the next point to evaluate.

Source

pub fn tell(&mut self, x: Array1<f64>, y: f64) -> OptimizeResult<()>

Tell interface: update with an observation.

Source

pub fn best(&self) -> Option<&Observation>

Get the current best observation.

Source

pub fn observations(&self) -> &[Observation]

Get all observations.

Source

pub fn n_observations(&self) -> usize

Number of observations.

Source

pub fn surrogate(&self) -> &GpSurrogate

Get reference to the GP surrogate.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,