pub struct DeepBiteOpt { /* private fields */ }Expand description
M BiteOpt instances with solution “pushing” between them. M == 1 is a
plain single-population BiteOpt.
Implementations§
Source§impl DeepBiteOpt
impl DeepBiteOpt
pub fn new( lower: &[f64], upper: &[f64], init: Option<&[f64]>, p: &BiteParams, m: i32, ) -> Self
Sourcepub fn optimize(&mut self, obj: &impl Objective) -> BiteResult
pub fn optimize(&mut self, obj: &impl Objective) -> BiteResult
One-shot optimization until the (total) evaluation budget or a stop.
Sourcepub fn ask(&mut self, batch: usize) -> Vec<Vec<f64>>
pub fn ask(&mut self, batch: usize) -> Vec<Vec<f64>>
Ask for up to batch candidate rows from the current optimizer.
Sourcepub fn tell(&mut self, costs: &[f64]) -> i32
pub fn tell(&mut self, costs: &[f64]) -> i32
Tell the costs for the last ask. Candidates are
applied best-first, with solution pushing and optimizer switching.
pub fn dim(&self) -> usize
pub fn population_size(&self) -> usize
pub fn current_batch_size(&self) -> usize
pub fn stop_code(&self) -> i32
pub fn result(&self) -> BiteResult
pub fn result_public(&self) -> BiteResult
Auto Trait Implementations§
impl Freeze for DeepBiteOpt
impl RefUnwindSafe for DeepBiteOpt
impl Send for DeepBiteOpt
impl Sync for DeepBiteOpt
impl Unpin for DeepBiteOpt
impl UnsafeUnpin for DeepBiteOpt
impl UnwindSafe for DeepBiteOpt
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.