pub struct AtomFunctionalEstimate {
pub theta_plugin: f64,
pub theta_onestep: f64,
pub penalty_bias: f64,
}Expand description
One atom decoder-functional point summary: the plug-in value and the one-step
penalty-debiased value, with the removed penalty bias. Deliberately carries
NO standard error / confidence interval — the conditional-on-generated-
regressors variance channel is unmodelled, so any SE would under-cover
(#1115). Use AtomSmoothSignificance for an honest any-n-valid structure
test instead.
Fields§
§theta_plugin: f64The raw plug-in functional value θ̂ = g·β̂.
theta_onestep: f64The one-step penalty-debiased value θ̂ − bias, removing the
regularization bias relative to the conditional target.
penalty_bias: f64The removed penalty bias (H⁻¹ g)·(Sβ̂).
Trait Implementations§
Source§impl Clone for AtomFunctionalEstimate
impl Clone for AtomFunctionalEstimate
Source§fn clone(&self) -> AtomFunctionalEstimate
fn clone(&self) -> AtomFunctionalEstimate
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreimpl Copy for AtomFunctionalEstimate
Auto Trait Implementations§
impl Freeze for AtomFunctionalEstimate
impl RefUnwindSafe for AtomFunctionalEstimate
impl Send for AtomFunctionalEstimate
impl Sync for AtomFunctionalEstimate
impl Unpin for AtomFunctionalEstimate
impl UnsafeUnpin for AtomFunctionalEstimate
impl UnwindSafe for AtomFunctionalEstimate
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
Mutably borrows from an owned value. Read more
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>
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 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>
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 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>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.