Skip to main content

RemlCandidate

Struct RemlCandidate 

Source
pub struct RemlCandidate {
    pub index: usize,
    pub name: String,
    pub score: f64,
    pub edf: Option<f64>,
    pub log_lik: Option<f64>,
    pub family: Option<String>,
}
Expand description

One fitted model in a REML/LAML evidence comparison.

Fields§

§index: usize§name: String§score: f64

Minimised REML/LAML cost. Lower is better. This is the model’s reported evidence headline (Model.evidence), kept verbatim in the score table.

§edf: Option<f64>§log_lik: Option<f64>

Log-likelihood at the converged mode, on the engine’s constants-omitted scale (same as gam_inference::model_comparison). Present when the fit carries it; None for legacy payloads.

§family: Option<String>

Response-family tag (e.g. “gaussian”, “gamma”, “binomial”). Carried so compare_reml_fits can REFUSE to rank fits whose REML/LAML scores are on incomparable base measures (a cross-family comparison is meaningless; #1384). None for legacy payloads that did not record it — those are not guarded (back-compatible), but every current FFI candidate carries it.

Implementations§

Source§

impl RemlCandidate

Source

pub fn ranking_score(&self) -> f64

Cost used to RANK candidates and pick the winner.

The REML/LAML marginal-likelihood evidence headline (score) does NOT reliably Occam-penalise an added pure-noise smooth: on y ~ s(x) vs y ~ s(x) + s(z) with z ⟂ y, the augmented model’s evidence is lower (apparently better) by a few nats on essentially every dataset, because the Gaussian REML Occam pair ½(log|H| − log|S|₊) collapses toward zero for a finite-λ̂ null term while that term still spends a few effective degrees of freedom fitting noise (issue #1362).

The conditional AIC −2ℓ + 2·edf prices exactly those spent degrees of freedom and discriminates correctly: it penalises the noise smooth (Δ ≈ +15 nats) yet rewards a genuinely relevant smooth (Δ ≈ −650), preserving power. We therefore rank on the conditional AIC whenever both the log-likelihood and the effective degrees of freedom are available, and fall back to the raw evidence headline otherwise. The reported score_table still carries the unaltered evidence (reml_score), so Model.evidence / bayes_factor_vs stay consistent with the table.

Trait Implementations§

Source§

impl Clone for RemlCandidate

Source§

fn clone(&self) -> RemlCandidate

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 RemlCandidate

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> Allocation for T
where T: RefUnwindSafe + Send + Sync,

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<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

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> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

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> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
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<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