pub struct BayesOpts {
pub n_initial: usize,
pub max_iter: usize,
pub n_candidates: usize,
pub acquisition: AcquisitionFn,
pub kappa: f64,
pub xi: f64,
}Expand description
Configuration for BayesianOptimizer.
Fields§
§n_initial: usizeNumber of initial random points (LHS sample) before GP is used.
max_iter: usizeMaximum number of optimization iterations.
n_candidates: usizeNumber of random candidates evaluated to maximise the acquisition fn.
acquisition: AcquisitionFnAcquisition function to use.
kappa: f64UCB exploration weight κ.
xi: f64EI/PI exploration offset ξ.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BayesOpts
impl RefUnwindSafe for BayesOpts
impl Send for BayesOpts
impl Sync for BayesOpts
impl Unpin for BayesOpts
impl UnsafeUnpin for BayesOpts
impl UnwindSafe for BayesOpts
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.