pub struct ResidualFactorInput<'a> {
pub residuals: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 2]>>,
pub activity: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>,
pub max_factor_rank: usize,
}Expand description
Estimator inputs: the residual matrix and the smooth activity coordinate.
residuals is R ∈ ℝ^{n×p}. activity is z ∈ ℝ^n — the coordinate the
scale law c(z) is smooth in (e.g. an assignment-mass or activation-strength
summary per row). When no genuine activity coordinate is available, passing a
constant z recovers a homoscedastic factor model (c(z) ≡ const).
Fields§
§residuals: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 2]>>Residual matrix R ∈ ℝ^{n×p}.
activity: ArrayBase<ViewRepr<&'a f64>, Dim<[usize; 1]>>Activity coordinate z ∈ ℝ^n the scale law is smooth in.
max_factor_rank: usizeMaximum factor rank the evidence ladder is allowed to consider. The
ladder scores r = 0, 1, …, min(max_factor_rank, p−1) and keeps the
penalized-evidence maximizer. 0 forces the pure-diagonal model.
Auto Trait Implementations§
impl<'a> Freeze for ResidualFactorInput<'a>
impl<'a> RefUnwindSafe for ResidualFactorInput<'a>
impl<'a> Send for ResidualFactorInput<'a>
impl<'a> Sync for ResidualFactorInput<'a>
impl<'a> Unpin for ResidualFactorInput<'a>
impl<'a> UnsafeUnpin for ResidualFactorInput<'a>
impl<'a> UnwindSafe for ResidualFactorInput<'a>
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
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> 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>
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,
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.