pub enum OptimalityKind {
A,
D,
}Expand description
Optimality kind for the DesignCriterion::Score criterion.
Variants§
A
A-optimality: trace of the posterior score covariance Cov(ξ | Y_S).
Empty design returns Σ_k λ_k.
D
D-optimality: log-determinant of the posterior score covariance,
Σ_k log(posterior eigenvalues), returned un-negated. Adding design points
shrinks the posterior covariance, so this value is monotone NON-INCREASING:
log det Cov(ξ | Y_S) ≤ log det Λ = Σ_k log λ_k. Its SIGN is not fixed — it
depends on the eigenvalue scale (e.g. λ = [2, 1] gives an empty-design value
of ln 2 ≈ +0.693, positive). Do NOT assume it is negative, and do NOT negate
it. Empty design returns Σ_k log λ_k.
Trait Implementations§
Source§impl Clone for OptimalityKind
impl Clone for OptimalityKind
Source§fn clone(&self) -> OptimalityKind
fn clone(&self) -> OptimalityKind
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for OptimalityKind
impl Debug for OptimalityKind
Source§impl PartialEq for OptimalityKind
impl PartialEq for OptimalityKind
impl StructuralPartialEq for OptimalityKind
Auto Trait Implementations§
impl Freeze for OptimalityKind
impl RefUnwindSafe for OptimalityKind
impl Send for OptimalityKind
impl Sync for OptimalityKind
impl Unpin for OptimalityKind
impl UnsafeUnpin for OptimalityKind
impl UnwindSafe for OptimalityKind
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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,
impl<T> Scalar for T
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.