pub struct CmaEsState<B: Backend> { /* private fields */ }Expand description
Generation state for CmaEs.
All adaptive quantities live here (not in CmaEsConfig) so instances stay
lock-free across parallel runs. Linear-algebra state — the mean, covariance,
and evolution paths — is held host-side as Vec<f32>; only the offspring
population crosses to the device.
Implementations§
Source§impl<B: Backend> CmaEsState<B>
impl<B: Backend> CmaEsState<B>
Sourcepub fn try_new(
mean: Vec<f32>,
cov: Vec<f32>,
p_sigma: Vec<f32>,
p_c: Vec<f32>,
sigma: f32,
generation: usize,
best_genome: Option<Tensor<B, 2>>,
best_fitness: f32,
) -> Result<Self, ConfigError>
pub fn try_new( mean: Vec<f32>, cov: Vec<f32>, p_sigma: Vec<f32>, p_c: Vec<f32>, sigma: f32, generation: usize, best_genome: Option<Tensor<B, 2>>, best_fitness: f32, ) -> Result<Self, ConfigError>
Assembles a CMA-ES state, checking the distribution parameters are dimensionally consistent.
§Errors
Returns a ConfigError if mean is empty, if cov is not D × D
row-major (D = mean.len()), if p_sigma or p_c differs from D,
or if sigma is not strictly positive and finite.
Sourcepub fn generation(&self) -> usize
pub fn generation(&self) -> usize
Completed-generation counter.
Sourcepub fn best_genome(&self) -> Option<&Tensor<B, 2>>
pub fn best_genome(&self) -> Option<&Tensor<B, 2>>
Best-so-far genome (shape (1, D)), or None before the first tell.
Sourcepub fn best_fitness(&self) -> f32
pub fn best_fitness(&self) -> f32
Best-so-far (canonical, maximise) fitness.
Trait Implementations§
Auto Trait Implementations§
impl<B> Freeze for CmaEsState<B>where
<B as BackendTypes>::FloatTensorPrimitive: Freeze,
<B as BackendTypes>::QuantizedTensorPrimitive: Freeze,
impl<B> RefUnwindSafe for CmaEsState<B>where
<B as BackendTypes>::FloatTensorPrimitive: RefUnwindSafe,
<B as BackendTypes>::QuantizedTensorPrimitive: RefUnwindSafe,
impl<B> Send for CmaEsState<B>
impl<B> Sync for CmaEsState<B>
impl<B> Unpin for CmaEsState<B>where
<B as BackendTypes>::FloatTensorPrimitive: Unpin,
<B as BackendTypes>::QuantizedTensorPrimitive: Unpin,
impl<B> UnsafeUnpin for CmaEsState<B>where
<B as BackendTypes>::FloatTensorPrimitive: UnsafeUnpin,
<B as BackendTypes>::QuantizedTensorPrimitive: UnsafeUnpin,
impl<B> UnwindSafe for CmaEsState<B>where
<B as BackendTypes>::FloatTensorPrimitive: UnwindSafe,
<B as BackendTypes>::QuantizedTensorPrimitive: 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<C> CloneExpand for Cwhere
C: Clone,
impl<C> CloneExpand for Cwhere
C: Clone,
fn __expand_clone_method(&self, _scope: &mut Scope) -> C
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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