Skip to main content

EvolutionSMC

Struct EvolutionSMC 

Source
pub struct EvolutionSMC;
Expand description

The tempered-SMC evolution driver.

Implementations§

Source§

impl EvolutionSMC

Source

pub fn run<P, L, R>( rng: &mut R, model: &EvolutionModel<P, L>, cfg: EvoSmcConfig, ) -> EvolutionPosterior<P::Genome>
where P: GenomePrior, L: GenomeLikelihood<P::Genome>, R: Rng,

Run tempered SMC targeting the Boltzmann posterior π ∝ p(x)·exp(f(x)) of model (β is supplied by fugue’s adaptive tempering; model’s own β setting is ignored here by construction).

Source§

impl EvolutionSMC

Source

pub fn run_with_kernel<P, L, R, K>( rng: &mut R, model: &EvolutionModel<P, L>, cfg: EvoSmcConfig, kernel: &mut K, ) -> EvolutionPosterior<P::Genome>
where P: GenomePrior, L: GenomeLikelihood<P::Genome>, R: Rng, K: PopulationKernel<P::Genome>,

Like EvolutionSMC::run, but with an explicit population kernel (e.g. a [CrossoverKernel] with a subtree_crossover_mask for grammar-driven tree genomes). cfg.crossover is ignored.

Source§

impl EvolutionSMC

Source

pub fn anneal<P, L, R>( rng: &mut R, model: &EvolutionModel<P, L>, cfg: EvoSmcConfig, beta_max: f64, anneal_steps: usize, ) -> EvolutionPosterior<P::Genome>
where P: GenomePrior, L: GenomeLikelihood<P::Genome>, R: Rng,

Optimizer mode: run tempered SMC to the posterior (β = 1), then keep annealing the ladder toward beta_max, concentrating the population on the maximizers of the likelihood/fitness.

The continuation is built from fugue’s exported primitives and keeps every invariant of the tempering loop: at each rung the particles are incrementally reweighted by Δβ·(log_likelihood + log_factors), normalized, systematically resampled to uniform weights, and rejuvenated with π_β-invariant MH (plus the crossover kernel when cfg.crossover is set). The rung schedule is geometric from 1 to beta_max over anneal_steps rungs.

The returned population approximates π_{β_max} ∝ p(x)·L(x)^{β_max}, which for large beta_max concentrates on the optima — a principled, uncertainty-aware replacement for a classic GA on single-objective problems. log_evidence reflects only the β ≤ 1 ladder (evidence is defined at the posterior).

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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

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
§

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

§

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

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

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

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.
§

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

§

fn vzip(self) -> V