Skip to main content

AtomInnerFit

Struct AtomInnerFit 

Source
pub struct AtomInnerFit {
    pub design: Array2<f64>,
    pub derivative_design: Array2<f64>,
    pub beta: Array1<f64>,
    pub penalty: Array2<f64>,
    pub penalized_hessian: Array2<f64>,
    pub row_scores: Array2<f64>,
    pub weights: Array1<f64>,
    pub dispersion: f64,
    pub peak_design_row: Array1<f64>,
    pub mode_design_row: Array1<f64>,
}
Expand description

The fitted per-atom inner-decoder smooth, captured once at fit time so the post-PIRLS atom-inference reports reuse the same design, penalized Hessian, and per-row scores the identifiability certificate’s curvature sees.

The SAE decoder reconstructs Z_i ≈ Σ_k a_ik Φ_k(t_ik) B_k. Holding all other atoms and the assignment fixed at the fitted optimum, atom k’s own contribution along a single output channel j is the Gaussian-identity penalized smooth a_ik · Φ_k(t_ik)ᵀ β_{k,j} with roughness penalty S_k, Gauss–Newton observation weight w_i = a_ik² (the assignment mass enters the channel linearly, so the normal-equation weight is its square), and dispersion the fitted reconstruction dispersion. That is an ordinary penalized WLS smooth — exactly what crate::inference::riesz, gam_terms::inference::lawley, and the κ-profile machinery consume. The channel j is the atom’s dominant decoder output direction (largest column norm of B_k), i.e. the channel that carries the atom’s signal.

Fields§

§design: Array2<f64>

Φ_k evaluated on the atom’s active rows, (n_active, M_k). The inner GAM smooth design. Column 0 is the constant/intercept basis column.

§derivative_design: Array2<f64>

∂Φ_k/∂t along the atom’s leading latent axis on the active rows, (n_active, M_k): the derivative design the average-derivative functional integrates.

§beta: Array1<f64>

The fitted decoder coefficients for the captured output channel, β_{k,j} ∈ ℝ^{M_k}.

§penalty: Array2<f64>

The atom roughness Gram S_k, (M_k, M_k).

§penalized_hessian: Array2<f64>

The penalized Hessian H = ΦᵀWΦ + S_k at the fitted state, (M_k, M_k).

§row_scores: Array2<f64>

Per-row Gaussian-identity scores s_i = ∂nll_i/∂β = −w_i r_i Φ_i / φ, (n_active, M_k), on the captured channel.

§weights: Array1<f64>

Per-row Gauss–Newton weights w_i = a_ik² on the captured channel.

§dispersion: f64

Fitted reconstruction dispersion φ (Gaussian σ²).

§peak_design_row: Array1<f64>

Design row at the latent peak t_peak (largest fitted |g_k|).

§mode_design_row: Array1<f64>

Design row at the latent mode t_mode (largest assignment mass).

Trait Implementations§

Source§

impl Clone for AtomInnerFit

Source§

fn clone(&self) -> AtomInnerFit

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 AtomInnerFit

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