Skip to main content

LogisticFit

Struct LogisticFit 

Source
pub struct LogisticFit { /* private fields */ }
Expand description

A fitted binary logistic-regression model.

Fit by iteratively reweighted least squares (equivalently, Fisher scoring / Newton–Raphson on the log-likelihood). At convergence the score equations Xᵀ(y − p) = 0 hold, and the inverse Fisher information (XᵀWX)⁻¹ — with W = diag(pᵢ(1−pᵢ)) — gives the coefficient covariance the Wald statistics are built from.

See the module docs for the response convention and the separation caveat.

Implementations§

Source§

impl LogisticFit

Source

pub fn new(x: Array2<f64>, y: Array1<f64>) -> Result<Self>

Fit logistic regression of binary y on X (default: up to 100 IRLS iterations, tolerance 1e-10 on the coefficient step).

§Errors
Source

pub fn with_options( x: Array2<f64>, y: Array1<f64>, max_iter: usize, tol: f64, ) -> Result<Self>

Like LogisticFit::new with an explicit iteration cap and tolerance.

Source

pub fn n_observations(&self) -> usize

Number of observations.

Source

pub fn n_parameters(&self) -> usize

Number of coefficients (design columns, intercept included).

Source

pub fn has_intercept(&self) -> bool

Whether an intercept (constant) column is present.

Source

pub fn iterations(&self) -> usize

IRLS iterations taken to converge.

Source

pub fn design_matrix(&self) -> ArrayView2<'_, f64>

The design matrix as fitted.

Source

pub fn response(&self) -> ArrayView1<'_, f64>

The binary response.

Source

pub fn coefficients(&self) -> ArrayView1<'_, f64>

Estimated coefficients (log-odds scale), aligned to the design columns.

Source

pub fn fitted_probabilities(&self) -> ArrayView1<'_, f64>

Fitted probabilities pᵢ = P(yᵢ = 1).

Source

pub fn weights(&self) -> ArrayView1<'_, f64>

IRLS weights wᵢ = pᵢ(1 − pᵢ) at the MLE.

Source

pub fn covariance(&self) -> ArrayView2<'_, f64>

Coefficient covariance matrix (XᵀWX)⁻¹.

Source

pub fn log_likelihood(&self) -> f64

Maximized log-likelihood.

Source

pub fn coefficient_standard_errors(&self) -> Array1<f64>

Coefficient standard errors √diag((XᵀWX)⁻¹).

Source

pub fn z_values(&self) -> Array1<f64>

Wald z-statistics βⱼ / seⱼ.

Source

pub fn p_values(&self) -> Array1<f64>

Two-sided Wald p-values from the standard normal.

Source

pub fn predict_proba(&self, x: ArrayView2<'_, f64>) -> Array1<f64>

Predicted probabilities for a new design matrix x (same column layout as the training design).

Source§

impl LogisticFit

Source

pub fn goodness_of_fit(&self) -> GoodnessOfFit

Overall goodness-of-fit summary: null/residual deviance, McFadden’s pseudo-R², and AIC/BIC.

The residual deviance is −2ℓ (the saturated-model log-likelihood is zero for ungrouped binary data), and equals the sum of squared deviance residuals. McFadden’s pseudo-R² compares the fitted log-likelihood to the intercept-only model; it is bounded in [0, 1) but runs lower than an OLS R² for comparable fits, so judge it on that scale.

Source

pub fn hosmer_lemeshow(&self, groups: usize) -> HosmerLemeshow

Hosmer–Lemeshow goodness-of-fit test with groups risk deciles (groups = 10 is the customary choice).

Observations are ordered by fitted probability and split into groups near-equal bins; the statistic compares observed and expected event counts per bin,

Ĥ = Σ_g (O_g − E_g)² / (n_g · π̄_g · (1 − π̄_g)),

which is asymptotically χ²(groups − 2). Unlike most tests here, a small p-value means the model fits poorly. Bins whose mean probability is exactly 0 or 1 contribute nothing (their variance term is undefined).

The test is only meaningful when groups ≥ 3 and there are enough observations to populate the bins; with fewer than groups + 1 observations the statistic is returned as NaN.

Trait Implementations§

Source§

impl Clone for LogisticFit

Source§

fn clone(&self) -> LogisticFit

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for LogisticFit

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V