pub struct AtomBirthGate {
pub test: PredictablePluginEProcess,
/* private fields */
}Expand description
The atom-birth gate (#976’s threshold comparison, replaced): a universal-inference e-process over corpus shards deciding “does the K+1-th atom exist?”, the boundary/Davies-regime question where the χ² gate every dictionary paper runs is broken.
Per shard t the integration contract is exactly the work plan’s:
log_lik_alternative_prefit: the K+1-atom dictionary fit on shards BEFORE t (the PREVIOUS shard’s fit — predictability is the one rule; handing in the current shard’s fit voids the guarantee), evaluated on shard t. Any fitter, warm starts, GPU — no conditions.log_lik_null_sup_on_shard: the K-atom dictionary REFIT on shard t (the honest constrained sup on the evaluation data).
The gate never rejects: GateVerdict::Contested is the only
alternative to certification, and a contested atom’s next move is a
probe plan (plan_probe_for_contested_claim), not deletion.
Fields§
§test: PredictablePluginEProcessImplementations§
Source§impl AtomBirthGate
impl AtomBirthGate
pub fn new(alpha: f64) -> Result<AtomBirthGate, String>
pub fn alpha(&self) -> f64
Sourcepub fn certified_at_step(&self) -> Option<usize>
pub fn certified_at_step(&self) -> Option<usize>
The realized time-to-certification: the shard count at which the
running supremum first crossed ln(1/α), or None if it never did.
This is the first-passage time the design budget
(expected_resolution_budget) predicts — distinct from
EProcess::steps (total shards absorbed), which keeps growing after
the crossing because absorption does not stop (continuing to accumulate
is what lets the dictionary-level e-BH certificate clear its higher
multiplicity bar ln(m/(α·k))).
Sourcepub fn try_absorb_shard(
&mut self,
log_lik_alternative_prefit: f64,
log_lik_null_sup_on_shard: f64,
) -> Result<(), String>
pub fn try_absorb_shard( &mut self, log_lik_alternative_prefit: f64, log_lik_null_sup_on_shard: f64, ) -> Result<(), String>
Absorb one shard’s split-likelihood ratio (see type-level contract).
pub fn absorb_shard( &mut self, log_lik_alternative_prefit: f64, log_lik_null_sup_on_shard: f64, )
pub fn verdict(&self) -> GateVerdict
Trait Implementations§
Source§impl Clone for AtomBirthGate
impl Clone for AtomBirthGate
Source§fn clone(&self) -> AtomBirthGate
fn clone(&self) -> AtomBirthGate
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 AtomBirthGate
impl Debug for AtomBirthGate
Source§impl<'de> Deserialize<'de> for AtomBirthGate
impl<'de> Deserialize<'de> for AtomBirthGate
Source§fn deserialize<__D>(
__deserializer: __D,
) -> Result<AtomBirthGate, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<AtomBirthGate, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Source§impl Serialize for AtomBirthGate
impl Serialize for AtomBirthGate
Source§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Auto Trait Implementations§
impl Freeze for AtomBirthGate
impl RefUnwindSafe for AtomBirthGate
impl Send for AtomBirthGate
impl Sync for AtomBirthGate
impl Unpin for AtomBirthGate
impl UnsafeUnpin for AtomBirthGate
impl UnwindSafe for AtomBirthGate
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,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
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.