pub struct SeedConfig {
pub bounds: (f64, f64),
pub max_seeds: usize,
pub seed_budget: usize,
pub screen_max_inner_iterations: usize,
pub risk_profile: SeedRiskProfile,
pub num_auxiliary_trailing: usize,
}Fields§
§bounds: (f64, f64)§max_seeds: usize§seed_budget: usizeMaximum number of seed starts to run in heuristic order.
screen_max_inner_iterations: usizeInitial inner-iteration cap used while ranking candidate seeds. The
outer screening loop runs each seed’s P-IRLS at this cap to obtain
an approximate cost; partial fits whose objective, β, gradient
natural scale, and gradient norm are all finite are accepted and
scored as C_approx + ½·r_g² (where r_g is the dimensionless
relative gradient residual). Only seeds whose partial state is
genuinely non-finite are rejected. The cascade in
rank_seeds_with_screening escalates the cap geometrically (×4,
×16, then uncapped) only if every seed at the initial cap is
non-finite — a rare pathological case after the
partial-fit-acceptance change.
risk_profile: SeedRiskProfile§num_auxiliary_trailing: usizeNumber of trailing dimensions that are auxiliary parameters (e.g. SAS epsilon + log_delta) rather than log-smoothing parameters. Auxiliary dimensions are pinned to their heuristic initial values in every seed instead of being swept through the smoothing-parameter seeding grid.
Trait Implementations§
Source§impl Clone for SeedConfig
impl Clone for SeedConfig
Source§fn clone(&self) -> SeedConfig
fn clone(&self) -> SeedConfig
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 SeedConfig
impl Debug for SeedConfig
Source§impl Default for SeedConfig
impl Default for SeedConfig
impl Copy for SeedConfig
Auto Trait Implementations§
impl Freeze for SeedConfig
impl RefUnwindSafe for SeedConfig
impl Send for SeedConfig
impl Sync for SeedConfig
impl Unpin for SeedConfig
impl UnsafeUnpin for SeedConfig
impl UnwindSafe for SeedConfig
Blanket Implementations§
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
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,
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
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.