pub struct HBGA<G, F>{ /* private fields */ }Expand description
Hierarchical Bayesian Genetic Algorithm
This combines population-based evolution with Bayesian inference over hyperparameters.
Implementations§
Source§impl<G, F> HBGA<G, F>
impl<G, F> HBGA<G, F>
Sourcepub fn new(
fitness: F,
bounds: MultiBounds,
population_size: usize,
generations: usize,
) -> Self
pub fn new( fitness: F, bounds: MultiBounds, population_size: usize, generations: usize, ) -> Self
Create a new HBGA
Sourcepub fn with_mutation_rate_prior(self, alpha: f64, beta: f64) -> Self
pub fn with_mutation_rate_prior(self, alpha: f64, beta: f64) -> Self
Set the mutation rate prior
Sourcepub fn with_mutation_sigma_prior(self, shape: f64, rate: f64) -> Self
pub fn with_mutation_sigma_prior(self, shape: f64, rate: f64) -> Self
Set the mutation sigma prior
Sourcepub fn run<R: Rng>(&self, rng: &mut R) -> HBGAResult<G>
pub fn run<R: Rng>(&self, rng: &mut R) -> HBGAResult<G>
Run the HBGA
Auto Trait Implementations§
impl<G, F> Freeze for HBGA<G, F>where
F: Freeze,
impl<G, F> RefUnwindSafe for HBGA<G, F>where
F: RefUnwindSafe,
G: RefUnwindSafe,
impl<G, F> Send for HBGA<G, F>
impl<G, F> Sync for HBGA<G, F>
impl<G, F> Unpin for HBGA<G, F>
impl<G, F> UnsafeUnpin for HBGA<G, F>where
F: UnsafeUnpin,
impl<G, F> UnwindSafe for HBGA<G, F>where
F: UnwindSafe,
G: UnwindSafe,
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> 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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.