Skip to main content

ContinuationPath

Struct ContinuationPath 

Source
pub struct ContinuationPath { /* private fields */ }
Expand description

Object 1 — the coupled continuation path. Owns the three schedules and the scalar path parameter s, and drives the K≥2 SAE joint fit down the coupled homotopy. Entry is always s = 1 (heavy-smoothing contraction regime); the tail is a homotopy floor with no rejection exit.

The wiring agent drives the path one waypoint at a time: let step = path.step(obj, &mut ledger); and, per [ContinuationStep], installs the next waypoint’s ScalarLegTargets (τ on the SAE term, isometry weight on the gauge penalty) and applies the LogitTrustRegion / ActiveMassFloor hooks inside the inner solve.

Implementations§

Source§

impl ContinuationPath

Source

pub fn enter(schedules: CoupledSchedules) -> Self

Build the coupled path. s is initialized to 1.0 — the heavy-smoothing entry regime where the joint inner solve is a contraction. The path can only be entered here; there is no constructor that starts cold at the real objective. This is what makes warm-invariance (#969) structural: any entry, warm or cold, funnels through the s = 1 contraction fixed point.

Source

pub fn heavy_entry() -> Self

No-argument heavy-smoothing entry for a continuation-entry objective (the seed cascade ctor). Builds the default coupled schedules — a single-component oversmoothed ρ leg, the standard diffuse→sharp τ leg and the loose→tight isometry gauge leg — and enters at s = 1, the heavy-smoothing contraction regime. The seed cascade only reads the coarse PathRegime and the logit step radius from the path; the concrete ρ vector is replaced by the spine’s own per-component target at each waypoint via ContinuationPath::current_rho_target, so the single-component default here is the entry placeholder, not a constraint on the real fit’s dimensionality.

Source

pub fn heavy_entry_for_rho( rho_target: Array1<f64>, bounds_upper: Array1<f64>, ) -> Self

Heavy-smoothing entry coupled to a CONCRETE ρ target and legal box. The seed cascade rebuilds the path per-seed with this once it knows the objective’s real ρ dimension (the no-argument ContinuationPath::heavy_entry is a dimension-1 placeholder used only before the seed is in hand). The ρ leg rides the spine from the spine’s own oversmoothed ρ₀ down to rho_target (the real objective ρ*); bounds_upper is the legal ρ box. The τ / isometry legs use the standard diffuse→sharp / loose→tight default endpoints. Enters at s = 1, the heavy-smoothing contraction regime. rho_target and bounds_upper must share length.

Source

pub fn enter_regime(&self) -> PathRegime

The coarse heavy-smoothing regime the path is currently entering at. The seed cascade reports this in its demotion ledger and final diagnosis. A fresh ContinuationPath::heavy_entry is in PathRegime::Heavy.

Source

pub fn demote_with_reason(&mut self, reason: PathDemotionReason) -> PathRegime

Demote the seed cascade to a heavier path regime with a recorded reason and return the regime re-entered at. This is the regime-escalation view of re-entry: it routes onto the same ContinuationPath::reenter_heavier mechanism a spine struggle or a mass-floor breach uses (raise s toward the entry regime, refine the step), so a structural diagnosis becomes a heavier-regime RE-ENTRY of the same seed — never a rejection. The reason is a diagnostic tag the caller records alongside the returned regime; the demotion mechanism is identical for every reason.

Source

pub fn logit_step_radius(&self) -> f64

The base radius the per-iteration assignment-logit trust region is built from (rho_optimizer.rs / atom_selection.rs hardening hook). This is the ∞-norm logit step radius at the current waypoint; heavier regimes (after a demotion / re-entry) cool τ and so hand back a tighter radius, shrinking every atom’s logit cap with no separate knob.

Source

pub fn note_active_mass_breach(&mut self) -> PathRegime

Bare active-mass-floor breach hook for the inner-loop call site that does not thread its own ReseedLedger. Records the breach in the path-owned ledger at the current s and re-enters a heavier regime — the same non-fatal response as ContinuationPath::note_mass_breach, without requiring the caller to carry a ledger. Returns the heavier PathRegime re-entered at so the call site can report it. Never fatal — a breach is a re-entry, never a rejection.

Source

pub fn reseed_count(&self) -> usize

Number of scaffold re-seeds recorded through the bare ContinuationPath::note_active_mass_breach hook (diagnostics).

Source

pub fn s(&self) -> f64

Current path parameter s ∈ [0, 1].

Source

pub fn current_scalar_targets(&self) -> ScalarLegTargets

The scalar leg targets (τ, isometry weight) at the current s. The wiring agent installs these before the inner solve at this waypoint.

Source

pub fn current_rho_target(&self) -> Array1<f64>

The ρ target the spine should anneal toward at the current s.

Source

pub fn logit_trust_region(&self) -> LogitTrustRegion

The per-waypoint logit trust region (from the current τ). The wiring agent caps each assignment-logit Newton step with this.

Source

pub fn active_mass_floor(&self) -> ActiveMassFloor

The active-mass floor for this path. The wiring agent calls ActiveMassFloor::check with the observed mean active mass each inner iteration and, on breach, records a scaffold re-seed in the ledger and reports it back via ContinuationPath::note_mass_breach.

Source

pub fn arrived(&self) -> bool

Whether the path has arrived at (or below) the real objective s = 0. The outer driver stops driving ContinuationPath::step once this is true and hands the warm iterate to the normal optimizer at ρ*.

Trait Implementations§

Source§

impl Clone for ContinuationPath

Source§

fn clone(&self) -> ContinuationPath

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for ContinuationPath

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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