pub struct SkipTranscoderRemlInputs<'a> {
pub y_out: ArrayView2<'a, f64>,
pub y_hat: ArrayView2<'a, f64>,
pub z: ArrayView2<'a, f64>,
pub w_dec: ArrayView2<'a, f64>,
pub lambda_sparse: f64,
pub skip_proj: Option<ArrayView2<'a, f64>>,
pub skip_u: Option<ArrayView2<'a, f64>>,
}Expand description
Inputs to the closed-form Gaussian REML/Laplace score of a trained skip-transcoder.
Every feature of the effective design is a rank-1 outer product of a
per-observation activation column with an output-space loading vector,
flattened over the (observation, output) pair:
- sparse atom
a:D_a = vec(z[:, a] · W_dec[a, :]^T), - skip component
r:D_r = vec((XV)[:, r] · U[:, r]^T),
where XV = x_in · skip_V is the skip’s data-dependent projection onto its
rank_skip-dimensional input subspace and U = skip_U is its output
loading. Because the skip map enters the prediction only through the
products XV and U (the prediction is (x_in · V) · U^T), passing those
two products — rather than V and U separately — makes the score
invariant to the unidentifiable balancing gauge U -> cU, V -> V/c, which
leaves the represented function unchanged.
Fields§
§y_out: ArrayView2<'a, f64>§y_hat: ArrayView2<'a, f64>§z: ArrayView2<'a, f64>§w_dec: ArrayView2<'a, f64>§lambda_sparse: f64§skip_proj: Option<ArrayView2<'a, f64>>Skip input projection XV = x_in · skip_V, shape (n_obs, rank_skip).
skip_u: Option<ArrayView2<'a, f64>>Skip output loading U = skip_U, shape (out_dim, rank_skip).
Auto Trait Implementations§
impl<'a> Freeze for SkipTranscoderRemlInputs<'a>
impl<'a> RefUnwindSafe for SkipTranscoderRemlInputs<'a>
impl<'a> Send for SkipTranscoderRemlInputs<'a>
impl<'a> Sync for SkipTranscoderRemlInputs<'a>
impl<'a> Unpin for SkipTranscoderRemlInputs<'a>
impl<'a> UnsafeUnpin for SkipTranscoderRemlInputs<'a>
impl<'a> UnwindSafe for SkipTranscoderRemlInputs<'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.