pub struct FactorPromotion {
pub direction: Array1<f64>,
pub energy: f64,
pub persistence_alignment: f64,
pub prev_column: usize,
}Expand description
A persistent, evidence-earning residual factor direction — a promotion
candidate for the #2021 Λ nursery→promotion birth channel. Emitted by
StructuredResidualModel::promotion_candidates when a column of this
pass’s Λ both (a) aligns with a column of the previous pass’s Λ (it
persisted across the outer alternation) and (b) explains residual energy
above the idiosyncratic-noise floor (it earns its complexity). The driver
accumulates persistence across passes (the nursery) and, once a direction
survives long enough, promotes it to a new curved/linear atom seeded by
Self::direction.
Fields§
§direction: Array1<f64>Unit-norm factor direction in output space (p-vector): the L2-normalized
column of Λ. This is the decoder direction a promoted atom is born with.
energy: f64Explained residual energy ‖Λ_:,j‖² (pre-normalization squared column
norm) — the factor’s contribution to Σ = c·ΛΛᵀ + D. Candidates are
returned in descending energy so the driver promotes the strongest first.
persistence_alignment: f64|cos| alignment (∈ [0, 1]) between this direction and the best-matching
column of the previous pass’s Λ — the persistence score gating promotion.
prev_column: usizeIndex of the best-matching previous-pass Λ column (the nursery lineage
this candidate continues), so the driver can track a stable identity for a
direction across passes.
Trait Implementations§
Source§impl Clone for FactorPromotion
impl Clone for FactorPromotion
Source§fn clone(&self) -> FactorPromotion
fn clone(&self) -> FactorPromotion
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreAuto Trait Implementations§
impl Freeze for FactorPromotion
impl RefUnwindSafe for FactorPromotion
impl Send for FactorPromotion
impl Sync for FactorPromotion
impl Unpin for FactorPromotion
impl UnsafeUnpin for FactorPromotion
impl UnwindSafe for FactorPromotion
Blanket Implementations§
impl<T> Allocation for T
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
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> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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>
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>
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,
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.