Skip to main content

MultiBlockAloInput

Struct MultiBlockAloInput 

Source
pub struct MultiBlockAloInput<'a> {
    pub n_obs: usize,
    pub n_blocks: usize,
    pub block_designs: &'a [Array2<f64>],
    pub penalized_hessian_inv: &'a Array2<f64>,
    pub block_weights: Vec<Array2<f64>>,
    pub scores: Vec<Array1<f64>>,
    pub eta_hat: Vec<Array1<f64>>,
}
Expand description

Model-agnostic input for multi-predictor ALO diagnostics.

Generalises AloInput to models with B > 1 linear predictors per observation (e.g. location-scale GAMLSS with B=2, or survival models with time-dependent predictors).

§Mathematical setup

For observation i the per-observation Jacobian is a B × p_tot block matrix X_i whose b-th row is the i-th row of block_designs[b]. The joint hat-matrix block is

H_ii = X_i H⁻¹ X_iᵀ W_i (B × B)

where H = Σ_i X_iᵀ W_i X_i + S is the total penalized Hessian and W_i is the B × B per-observation weight matrix (negative Hessian of the log-likelihood w.r.t. the B predictors at observation i).

The ALO leave-one-out correction is

Δη_i^ALO = A_i (I_B − W_i A_i)⁻¹ s_i

where A_i = X_i H⁻¹ X_iᵀ (the B×B per-observation influence matrix), W_i is the B×B per-observation NLL Hessian, and s_i = ∇_{η_i} NLL_i(η̂_i) is the B-dimensional score vector. This is algebraically equivalent to (I_B − H_ii)⁻¹ H_ii W_i⁻¹ s_i but does NOT require W_i⁻¹, which is critical when W_i is singular (e.g. at boundary observations in survival models). For B = 1 this reduces to the classical scalar ALO formula.

Fields§

§n_obs: usize

Number of observations.

§n_blocks: usize

Number of predictors per observation (B).

§block_designs: &'a [Array2<f64>]

B design matrices, each n_obs × p_b. The total parameter count is p_tot = Σ_b p_b.

§penalized_hessian_inv: &'a Array2<f64>

Inverse of the penalized Hessian, H⁻¹ (p_tot × p_tot).

§block_weights: Vec<Array2<f64>>

Per-observation weight matrices W_i (B × B). Length = n_obs.

§scores: Vec<Array1<f64>>

Per-observation score vectors s_i = ∇_{η_i} NLL_i. Length = n_obs, each entry is B-dimensional.

§eta_hat: Vec<Array1<f64>>

Fitted linear predictor vectors η̂_i. Length = n_obs, each entry is B-dimensional.

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> 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, 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