Skip to main content

BernoulliMarginalSlopeFitResult

Struct BernoulliMarginalSlopeFitResult 

Source
pub struct BernoulliMarginalSlopeFitResult {
Show 15 fields pub fit: UnifiedFitResult, pub marginalspec_resolved: TermCollectionSpec, pub logslopespec_resolved: TermCollectionSpec, pub marginal_design: TermCollectionDesign, pub logslope_design: TermCollectionDesign, pub baseline_marginal: f64, pub baseline_logslope: f64, pub z_normalization: LatentZNormalization, pub latent_measure: LatentMeasureKind, pub score_warp_runtime: Option<DeviationRuntime>, pub link_dev_runtime: Option<DeviationRuntime>, pub gaussian_frailty_sd: Option<f64>, pub cross_block_warnings: Vec<CrossBlockIdentifiabilityWarning>, pub latent_z_rank_int_calibration: Option<LatentZRankIntCalibration>, pub latent_z_conditional_calibration: Option<LatentZConditionalCalibration>,
}

Fields§

§fit: UnifiedFitResult§marginalspec_resolved: TermCollectionSpec§logslopespec_resolved: TermCollectionSpec§marginal_design: TermCollectionDesign§logslope_design: TermCollectionDesign§baseline_marginal: f64§baseline_logslope: f64§z_normalization: LatentZNormalization§latent_measure: LatentMeasureKind§score_warp_runtime: Option<DeviationRuntime>§link_dev_runtime: Option<DeviationRuntime>§gaussian_frailty_sd: Option<f64>

Learned or fixed Gaussian-shift frailty SD. None = no frailty.

§cross_block_warnings: Vec<CrossBlockIdentifiabilityWarning>

Structured warnings emitted during fit-time setup when a flex block was fully aliased by its anchor union and got dropped. The fit proceeds without the dropped block (its contribution to the joint design was numerically reproducible by the anchor span, so keeping it would leave the joint Hessian rank-deficient). Empty for fits where every flex block carried independent directions.

§latent_z_rank_int_calibration: Option<LatentZRankIntCalibration>

Optional weighted rank inverse-normal (Blom rankit) calibration installed at fit time when the auto latent-z normality check failed. Some(_) ⇒ the training z was transformed in place via LatentZRankIntCalibration::apply_to_training before any downstream consumer (pooled probit baseline, term-collection designs, family PIRLS loops) saw it, and the rigid kernel routes through the standard-normal closed-form path on the calibrated scale. None ⇒ no calibration was applied (training z already passed the standard-normal diagnostics, or the caller explicitly selected a non-Auto LatentMeasureSpec).

Persisted to disk so prediction applies the same monotone map via LatentZRankIntCalibration::apply_at_predict to incoming z before the standard-normal kernel runs. The public field name is latent_z_rank_int_calibration — Agent D’s persistence pipeline reads it under that exact identifier.

§latent_z_conditional_calibration: Option<LatentZConditionalCalibration>

Optional conditional location-scale calibration of the latent score (#905). Some(_) ⇒ the Auto path’s conditional E[z|C]/Var(z|C) Rao gate detected PC/grouping-dependence that the pooled-marginal gate cannot see, so the training z was replaced in place by ζ = (z − m(C))/√v(C) (via LatentZConditionalCalibration::apply) before any downstream consumer saw it. Mutually exclusive with latent_z_rank_int_calibration: rank-INT fixes a pooled-marginal defect, the conditional correction fixes a conditional-shift defect that rank-INT provably cannot. Persisted so prediction rebuilds a(C) from the (reproducible) marginal design and applies the identical map.

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<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> 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, 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