pub struct BinomialMultiFitOutputs {
pub coefficients: Array2<f64>,
pub fitted_probabilities: Array2<f64>,
pub iterations: usize,
pub converged: bool,
pub penalized_neg_log_likelihood: f64,
pub deviance: f64,
}Expand description
Outputs of fit_penalized_binomial_multi.
Fields§
§coefficients: Array2<f64>Coefficient matrix, shape (P, K) (column a is β_a).
fitted_probabilities: Array2<f64>Fitted probabilities μ_{n,a} = σ((X β_a)_n), shape (N, K).
iterations: usizeNumber of joint Newton iterations executed (including the final step
that satisfied the tolerance). The K columns share the design and
are fitted by a single coupled damped-Newton loop over the
block-diagonal penalized Hessian, so there is one iteration count for
the whole solve.
converged: booltrue if the relative-step test was satisfied before max_iter.
penalized_neg_log_likelihood: f64Penalized negative log-likelihood at the returned β̂:
−log L(β̂) + ½ Σ_a λ_a · β̂_aᵀ S β̂_a.
deviance: f64Unpenalized deviance −2 log L(β̂) for diagnostic reporting.
Trait Implementations§
Source§impl Clone for BinomialMultiFitOutputs
impl Clone for BinomialMultiFitOutputs
Source§fn clone(&self) -> BinomialMultiFitOutputs
fn clone(&self) -> BinomialMultiFitOutputs
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 Freeze for BinomialMultiFitOutputs
impl RefUnwindSafe for BinomialMultiFitOutputs
impl Send for BinomialMultiFitOutputs
impl Sync for BinomialMultiFitOutputs
impl Unpin for BinomialMultiFitOutputs
impl UnsafeUnpin for BinomialMultiFitOutputs
impl UnwindSafe for BinomialMultiFitOutputs
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.