Skip to main content

StructuredResidualModel

Struct StructuredResidualModel 

Source
pub struct StructuredResidualModel { /* private fields */ }
Expand description

The fitted structured residual-covariance model: low-rank factor Λ, idiosyncratic diagonal D, and the smooth activity-scale c(z) evaluated at every row. Produces per-row precision factors and the MetricProvenance::WhitenedStructured RowMetric.

Implementations§

Source§

impl StructuredResidualModel

Source

pub fn fit(input: ResidualFactorInput<'_>) -> Result<Self, String>

Fit the structured residual-covariance model by the deterministic fixed-iteration alternation, selecting the factor rank by the evidence ladder. Returns an error only on shape / non-finite-input violations; the numerical path is total (every floor and solve is guarded).

Source

pub fn factor_rank(&self) -> usize

Selected factor rank r.

Source

pub fn factor(&self) -> ArrayView2<'_, f64>

The fitted interference factor Λ ∈ ℝ^{p×r} (the shared off-isotropic residual subspace). Consumed by the planted-subspace recovery test to compare range(Λ) against the planted interference subspace.

Source

pub fn diagonal(&self) -> ArrayView1<'_, f64>

The idiosyncratic diagonal d ∈ ℝ^p (D = diag(d)).

Source

pub fn row_scale(&self) -> ArrayView1<'_, f64>

The per-row activity scale c(z_n) > 0, length n. Recovers the smooth activity-scale law evaluated at every observed z_n.

Source

pub fn log_evidence(&self) -> f64

The penalized Gaussian log-evidence the rank-selection ladder maximized.

Source

pub fn row_metric(&self, n_rows: usize) -> Result<RowMetric, String>

Build the per-row precision factor stack U_n ∈ ℝ^{p×p} with U_n U_nᵀ = Σ_n^{-1} and package it as a MetricProvenance::WhitenedStructured RowMetric. This is the single production site of WhitenedStructured.

The precision is formed in Woodbury form:

  Σ_n^{-1} = D^{-1} − D^{-1} Λ ( c^{-1} I_r + Λᵀ D^{-1} Λ )^{-1} Λᵀ D^{-1},

an r × r capacitance solve (never a p × p inverse). The factor U_n is the lower-Cholesky of the assembled Σ_n^{-1} (rank = p), so whiten_residual_row returns coordinates whose squared norm is the exact Mahalanobis residual r_nᵀ Σ_n^{-1} r_n.

Trait Implementations§

Source§

impl Clone for StructuredResidualModel

Source§

fn clone(&self) -> StructuredResidualModel

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for StructuredResidualModel

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

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> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.
Source§

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

Source§

fn vzip(self) -> V