pub struct EvidenceIftGradientTerms<'a> {
pub dbeta_drho: ArrayView2<'a, f64>,
pub du_drho: ArrayView2<'a, f64>,
pub value_beta: ArrayView1<'a, f64>,
pub value_u: ArrayView1<'a, f64>,
pub logdet_h_beta: ArrayView1<'a, f64>,
pub logdet_h_u: ArrayView1<'a, f64>,
}Expand description
IFT terms needed to differentiate the optimized Laplace evidence through
the fitted mode (β*(ρ), u*(ρ)).
For each hyperparameter ρ_a, the correction added to the direct trace is
F_β · β_a + F_u · u_a
+ 0.5 (∂_β log|H| · β_a + ∂_u log|H| · u_a).At an exact KKT point the value-gradient pieces are zero, but they are explicit here so the exported gradient matches the optimized objective whenever callers carry a certified nonzero residual correction.
Fields§
§dbeta_drho: ArrayView2<'a, f64>§du_drho: ArrayView2<'a, f64>§value_beta: ArrayView1<'a, f64>§value_u: ArrayView1<'a, f64>§logdet_h_beta: ArrayView1<'a, f64>§logdet_h_u: ArrayView1<'a, f64>Trait Implementations§
Source§impl<'a> Clone for EvidenceIftGradientTerms<'a>
impl<'a> Clone for EvidenceIftGradientTerms<'a>
Source§fn clone(&self) -> EvidenceIftGradientTerms<'a>
fn clone(&self) -> EvidenceIftGradientTerms<'a>
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 moreAuto Trait Implementations§
impl<'a> Freeze for EvidenceIftGradientTerms<'a>
impl<'a> RefUnwindSafe for EvidenceIftGradientTerms<'a>
impl<'a> Send for EvidenceIftGradientTerms<'a>
impl<'a> Sync for EvidenceIftGradientTerms<'a>
impl<'a> Unpin for EvidenceIftGradientTerms<'a>
impl<'a> UnsafeUnpin for EvidenceIftGradientTerms<'a>
impl<'a> UnwindSafe for EvidenceIftGradientTerms<'a>
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.