pub struct FitOptions {Show 18 fields
pub resource_policy: ResourcePolicy,
pub latent_cloglog: Option<LatentCLogLogState>,
pub mixture_link: Option<MixtureLinkSpec>,
pub optimize_mixture: bool,
pub sas_link: Option<SasLinkSpec>,
pub optimize_sas: bool,
pub compute_inference: bool,
pub skip_rho_posterior_inference: bool,
pub max_iter: usize,
pub tol: f64,
pub nullspace_dims: Vec<usize>,
pub linear_constraints: Option<LinearInequalityConstraints>,
pub firth_bias_reduction: bool,
pub adaptive_regularization: Option<AdaptiveRegularizationOptions>,
pub rho_prior: RhoPrior,
pub kronecker_penalty_system: Option<KroneckerPenaltySystem>,
pub kronecker_factored: Option<KroneckerFactoredBasis>,
pub persistent_warm_start_store: Option<ConfiguredWarmStartStore>,
}Fields§
§resource_policy: ResourcePolicyResource contract used by every basis realization and spatial hyperparameter rebuild belonging to this fit. Keeping it on the fit lifecycle prevents a policy used during formula lowering from being silently replaced by the library default when the design is built.
latent_cloglog: Option<LatentCLogLogState>§mixture_link: Option<MixtureLinkSpec>§optimize_mixture: bool§sas_link: Option<SasLinkSpec>§optimize_sas: bool§compute_inference: bool§skip_rho_posterior_inference: boolInternal lifecycle knob for fits whose result will be immediately superseded. Keeps ordinary inference work but skips the live-objective rho posterior certificate/escalation until the returned model is known.
max_iter: usize§tol: f64§nullspace_dims: Vec<usize>§linear_constraints: Option<LinearInequalityConstraints>§firth_bias_reduction: boolUse Jeffreys/Firth bias reduction for supported likelihoods.
Model-fitting paths must pass this explicitly through every objective evaluator so baseline fits, spatial hyperparameter evaluations, outer line searches, final refits, and inference all optimize the same target.
adaptive_regularization: Option<AdaptiveRegularizationOptions>§rho_prior: RhoPriorFixed prior on smoothing parameters for explicit joint HMC sampling flows.
This prior is part of the sampled target itself, unlike rho_mode,
which is only used to initialize chains near the REML solution.
kronecker_penalty_system: Option<KroneckerPenaltySystem>Kronecker-factored penalty system for tensor-product smooth terms. When set, the REML evaluator uses O(∏q_j) logdet and KroneckerMarginal penalty coordinates instead of O(p³) eigendecomposition.
kronecker_factored: Option<KroneckerFactoredBasis>Full Kronecker factored basis for P-IRLS factored reparameterization.
persistent_warm_start_store: Option<ConfiguredWarmStartStore>Explicit cross-process warm-start capability. None is disk-silent;
Some carries one lazy/opened caller-configured store through every
standard REML owner.
Trait Implementations§
Source§impl Clone for FitOptions
impl Clone for FitOptions
Source§fn clone(&self) -> FitOptions
fn clone(&self) -> FitOptions
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for FitOptions
impl Debug for FitOptions
Source§impl Default for FitOptions
impl Default for FitOptions
Source§fn default() -> FitOptions
fn default() -> FitOptions
Auto Trait Implementations§
impl !Freeze for FitOptions
impl RefUnwindSafe for FitOptions
impl Send for FitOptions
impl Sync for FitOptions
impl Unpin for FitOptions
impl UnsafeUnpin for FitOptions
impl UnwindSafe for FitOptions
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
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> ⓘ
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> ⓘ
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.