Skip to main content

ExactNewtonJointPsiSecondOrderContracted

Struct ExactNewtonJointPsiSecondOrderContracted 

Source
pub struct ExactNewtonJointPsiSecondOrderContracted {
    pub objective: Array1<f64>,
    pub score: Array2<f64>,
    pub hessian: Vec<DriftDerivResult>,
}
Expand description

Direction-contracted second-order ψ terms for the profiled θ-HVP (#740).

The per-pair ExactNewtonJointPsiSecondOrderTerms are the (ψ_i, ψ_j) entries of the joint hyper-Hessian; assembling the full outer Hessian from them costs one O(n) family row pass per pair, i.e. K²·n. A matrix-free profiled θ-HVP never needs the individual pairs — it needs, for one applied outer direction with ψ-weights α_ψ, the α-contraction of those pairs against the combined ψ-direction ψ(α) = Σ_j α_j ψ_j:

  objective[i] = Σ_j α_j V_{ψ_i ψ_j}
  score[i]     = Σ_j α_j g_{ψ_i ψ_j}          (a p-vector per output row i)
  hessian[i]   = Σ_j α_j D²_β H_L[ψ_i, ψ_j]
               = D²_β H_L[ψ_i, ψ(α)]            (bilinearity)

All psi_dim output rows share the SAME contracted second leg ψ(α), so a family that streams its rows once over ψ(α) (carrying every fixed first leg ψ_i as a batched factor column) produces every row in a SINGLE n-pass. That is the cost the profiled θ-HVP turns into K·n-to-densify / m·n-in-CG instead of the dense path’s K²·n.

Indexing is over the flattened ψ coordinates in the same order as ExactNewtonJointPsiWorkspace::second_order_terms; hessian[i] carries the D²_β H_L[ψ_i, ψ(α)] drift as a DriftDerivResult (dense or operator-backed) plus any block-local S_{ψ_i ψ_j} penalty motion folded by the family, exactly mirroring the per-pair hessian_psi_psi(_operator).

Fields§

§objective: Array1<f64>

objective[i] = Σ_j α_j V_{ψ_i ψ_j}, one scalar per ψ output row.

§score: Array2<f64>

score[i] = Σ_j α_j g_{ψ_i ψ_j}, the psi_dim × total matrix whose row i is the contracted fixed-β score derivative for output row i.

§hessian: Vec<DriftDerivResult>

hessian[i] = D²_β H_L[ψ_i, ψ(α)] for each ψ output row i.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V