pub struct CarveInput<'a> {
pub phi_a: ArrayView2<'a, f64>,
pub phi_b: ArrayView2<'a, f64>,
pub coeffs: &'a [Array2<f64>],
pub coeff_covariance: Option<&'a [Array2<f64>]>,
pub joint_coeff_covariance: Option<&'a Array2<f64>>,
pub kernel_a: Option<Array1<f64>>,
pub kernel_b: Option<Array1<f64>>,
pub edf: Option<f64>,
pub residual_df: f64,
pub scale: SmoothTestScale,
pub notion: BindingNotion,
}Expand description
Inputs for one notion’s carve over one fitted product atom.
phi_a/phi_b: factor bases evaluated on the code sample (n × M_i).
coeffs: per-output-dim coefficient matrices (M₁ × M₂ each); for the
representational notion these are the decoder’s, for the computational
notion they come from fitting the same tensor basis to the pulled-back
readout. coeff_covariance: matching scale-included posterior
covariance of the ROW-MAJOR vec of each C (M₁M₂ × M₁M₂ per output
dim) — optional; without it the carve still reports the energy
fraction but runs no Wald test. kernel_a/kernel_b: the per-factor
coefficient direction along which the centered basis is degenerate
(Σ_j u_j φ̃_j ≡ 0); None selects the partition-of-unity convention
u = 1 (B-splines). edf: fitted EDF of the interaction block when
the fit tracked one; None uses the full quotient rank
(M₁−1)(M₂−1).
Fields§
§phi_a: ArrayView2<'a, f64>§phi_b: ArrayView2<'a, f64>§coeffs: &'a [Array2<f64>]§coeff_covariance: Option<&'a [Array2<f64>]>§joint_coeff_covariance: Option<&'a Array2<f64>>Covariance of the dimension-major STACKED coefficient vector
[vec(C₀); vec(C₁); …] (D·M₁M₂ square, scale-included), e.g.
TensorSurfaceFit::joint_covariance. When present, the
edge-level binding p-value comes from ONE joint Wald over the
stacked gauge-projected blocks at rank D·(M₁−1)(M₂−1) instead of
the conservative Bonferroni min-p across dimensions (the per-dim
tests share every code row, so Bonferroni over-corrects).
kernel_a: Option<Array1<f64>>§kernel_b: Option<Array1<f64>>§edf: Option<f64>§residual_df: f64§scale: SmoothTestScale§notion: BindingNotionAuto Trait Implementations§
impl<'a> Freeze for CarveInput<'a>
impl<'a> RefUnwindSafe for CarveInput<'a>
impl<'a> Send for CarveInput<'a>
impl<'a> Sync for CarveInput<'a>
impl<'a> Unpin for CarveInput<'a>
impl<'a> UnsafeUnpin for CarveInput<'a>
impl<'a> UnwindSafe for CarveInput<'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
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>
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.