pub struct LinearFitConditioning {
pub intercept_idx: usize,
pub columns: Vec<LinearColumnConditioning>,
}Fields§
§intercept_idx: usize§columns: Vec<LinearColumnConditioning>Implementations§
Source§impl LinearFitConditioning
impl LinearFitConditioning
pub fn from_columns( design: &TermCollectionDesign, selected_cols: &[usize], ) -> Self
pub fn apply_to_design(&self, design: &Array2<f64>) -> Array2<f64>
Sourcepub fn transform_blockwise_penalties_to_internal(
&self,
penalties: &[BlockwisePenalty],
p: usize,
) -> Vec<PenaltySpec>
pub fn transform_blockwise_penalties_to_internal( &self, penalties: &[BlockwisePenalty], p: usize, ) -> Vec<PenaltySpec>
Transform blockwise penalties through the conditioning.
For block-local penalties whose col_range does not overlap with any
conditioning column, the transform is identity (the conditioning only
affects unpenalized linear columns). In that common case the penalty
passes through unchanged, avoiding O(p²) materialization entirely.
pub fn backtransform_beta(&self, beta_internal: &Array1<f64>) -> Array1<f64>
Sourcepub fn transform_penalized_hessian_to_original(
&self,
h_internal: &Array2<f64>,
) -> Array2<f64>
pub fn transform_penalized_hessian_to_original( &self, h_internal: &Array2<f64>, ) -> Array2<f64>
H_orig = M⁻ᵀ · H_int · M⁻¹, derived from
L_int(β_int) = L_orig(M · β_int) via the chain rule.
pub fn internal_bounds_for( &self, col_idx: usize, min: f64, max: f64, ) -> (f64, f64)
Trait Implementations§
Source§impl Clone for LinearFitConditioning
impl Clone for LinearFitConditioning
Source§fn clone(&self) -> LinearFitConditioning
fn clone(&self) -> LinearFitConditioning
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for LinearFitConditioning
impl Debug for LinearFitConditioning
Source§impl Default for LinearFitConditioning
impl Default for LinearFitConditioning
Source§fn default() -> LinearFitConditioning
fn default() -> LinearFitConditioning
Returns the “default value” for a type. Read more
Auto Trait Implementations§
impl Freeze for LinearFitConditioning
impl RefUnwindSafe for LinearFitConditioning
impl Send for LinearFitConditioning
impl Sync for LinearFitConditioning
impl Unpin for LinearFitConditioning
impl UnsafeUnpin for LinearFitConditioning
impl UnwindSafe for LinearFitConditioning
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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>
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 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>
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 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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.