Skip to main content

AdaptiveLearningRateController

Struct AdaptiveLearningRateController 

Source
pub struct AdaptiveLearningRateController<A: Float> { /* private fields */ }
Expand description

Adaptive learning-rate controller.

O1: this used to be a stub whose every method ignored its arguments — the rate never moved, compute_adaptation echoed the base rate back and last_change was hard-coded to None, so the whole AdaptationType:: LearningRate pipeline was a no-op that “applied” the same value forever.

The real controller combines two established online signals, both computed from data the caller already supplies:

  • Gradient-norm normalisation (an AdaGrad-style trust region): the rate is scaled by 1 / (1 + sqrt(accumulated squared gradient norm)), so a burst of large gradients shrinks the step and a quiet stretch restores it.
  • Performance feedback: the sign of the recent loss trend, estimated by ordinary least squares over the supplied metric window, nudges the rate up while the loss is falling and down while it is rising.

Every update is clamped to [min_rate, max_rate] from the configuration and recorded, so last_change reports the real delta that was applied.

Implementations§

Source§

impl<A: Float> AdaptiveLearningRateController<A>

Source

pub fn new(config: &StreamingConfig) -> Result<Self, OptimError>

Builds a controller from the streaming learning-rate configuration.

Source

pub fn update_learning_rate(&mut self, gradient: &Array1<A>) -> A

Folds a real gradient into the controller and returns the resulting rate.

The gradient’s squared L2 norm feeds an AdaGrad accumulator, so the effective rate is initial / (1 + sqrt(sum of squared norms)) — large or repeated gradients genuinely shrink the step.

Source

pub fn is_cyclical(&self) -> bool

Whether a cyclical schedule is driving this controller.

Source

pub fn current_rate(&self) -> A

Current learning rate.

Source

pub fn accumulated_squared_gradient_norm(&self) -> A

Accumulated squared gradient norm (the AdaGrad state).

Source

pub fn update_count(&self) -> usize

Number of updates the controller has applied.

Source

pub fn compute_adaptation(&self, performance_metrics: &[A]) -> A

Proposes the next learning rate from a window of recent performance metrics, most-recent-last.

The trend is the ordinary-least-squares slope of the metric against its index. A falling metric (negative slope) means the current rate is working, so the rate is grown by 1 + performance_sensitivity; a rising metric shrinks it by 1 - performance_sensitivity. With fewer than two samples there is no trend to read and the current rate is returned unchanged.

Source

pub fn apply_adaptation(&mut self, adaptation: A)

Applies a proposed rate, recording the real delta.

Source

pub fn last_change(&self) -> Option<A>

Delta applied by the most recent rate change, or None if the rate has never moved.

Source

pub fn reset(&mut self)

Resets the controller to its configured initial rate.

Trait Implementations§

Source§

impl<A: Clone + Float> Clone for AdaptiveLearningRateController<A>

Source§

fn clone(&self) -> AdaptiveLearningRateController<A>

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<A: Debug + Float> Debug for AdaptiveLearningRateController<A>

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

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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