pub struct EvolutionarySMC<G, F>{ /* private fields */ }Expand description
Sequential Monte Carlo for evolutionary inference
SMC treats evolution as a sequence of distributions that progressively concentrate on high-fitness solutions.
Implementations§
Source§impl<G, F> EvolutionarySMC<G, F>
impl<G, F> EvolutionarySMC<G, F>
Sourcepub fn new(fitness: F, bounds: MultiBounds, num_particles: usize) -> Self
pub fn new(fitness: F, bounds: MultiBounds, num_particles: usize) -> Self
Create a new SMC sampler
Sourcepub fn with_schedule(self, schedule: Vec<f64>) -> Self
pub fn with_schedule(self, schedule: Vec<f64>) -> Self
Set a custom temperature schedule
Sourcepub fn initialize<R: Rng>(&self, rng: &mut R) -> Vec<Particle<G>>
pub fn initialize<R: Rng>(&self, rng: &mut R) -> Vec<Particle<G>>
Initialize particles from prior
Sourcepub fn resample<R: Rng>(
particles: &[Particle<G>],
rng: &mut R,
) -> Vec<Particle<G>>
pub fn resample<R: Rng>( particles: &[Particle<G>], rng: &mut R, ) -> Vec<Particle<G>>
Resample particles using systematic resampling
Sourcepub fn best_particle(particles: &[Particle<G>]) -> Option<&Particle<G>>
pub fn best_particle(particles: &[Particle<G>]) -> Option<&Particle<G>>
Get the best particle
Sourcepub fn posterior_mean(particles: &[Particle<G>]) -> Option<Trace>
pub fn posterior_mean(particles: &[Particle<G>]) -> Option<Trace>
Compute posterior mean (weighted average of traces)
Auto Trait Implementations§
impl<G, F> Freeze for EvolutionarySMC<G, F>where
F: Freeze,
impl<G, F> RefUnwindSafe for EvolutionarySMC<G, F>where
F: RefUnwindSafe,
G: RefUnwindSafe,
impl<G, F> Send for EvolutionarySMC<G, F>
impl<G, F> Sync for EvolutionarySMC<G, F>
impl<G, F> Unpin for EvolutionarySMC<G, F>
impl<G, F> UnsafeUnpin for EvolutionarySMC<G, F>where
F: UnsafeUnpin,
impl<G, F> UnwindSafe for EvolutionarySMC<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.