pub struct PirlsStepStreamInput<'a> {
pub weights: ArrayView1<'a, f64>,
pub penalty_hessian: ArrayView2<'a, f64>,
pub gradient: ArrayView1<'a, f64>,
pub step_lm_lambda: f64,
pub objective_ridge: f64,
}Expand description
Per-step inputs for solve_pirls_step_on_stream.
Mirrors PirlsGpuInput but elides the design matrix x because that
lives device-resident in the shared batch state. Each PIRLS Newton step
only changes weights, penalty_hessian (with the current Sλ sum),
gradient, and the LM ridge — these are the small per-step uploads the
stream-pool path streams to the device.
Fields§
§weights: ArrayView1<'a, f64>§penalty_hessian: ArrayView2<'a, f64>§gradient: ArrayView1<'a, f64>§step_lm_lambda: f64Temporary LM damping for this Newton solve step only. Added to H
before potrf; stripped out of the snapshotted penalized_hessian.
objective_ridge: f64Real model-objective ridge. Appears in the exported
penalized_hessian that flows to EDF / REML curvature.
Trait Implementations§
Source§impl<'a> Clone for PirlsStepStreamInput<'a>
impl<'a> Clone for PirlsStepStreamInput<'a>
Source§fn clone(&self) -> PirlsStepStreamInput<'a>
fn clone(&self) -> PirlsStepStreamInput<'a>
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 moreAuto Trait Implementations§
impl<'a> Freeze for PirlsStepStreamInput<'a>
impl<'a> RefUnwindSafe for PirlsStepStreamInput<'a>
impl<'a> Send for PirlsStepStreamInput<'a>
impl<'a> Sync for PirlsStepStreamInput<'a>
impl<'a> Unpin for PirlsStepStreamInput<'a>
impl<'a> UnsafeUnpin for PirlsStepStreamInput<'a>
impl<'a> UnwindSafe for PirlsStepStreamInput<'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
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.