pub struct OptimizationState<T: Float + Debug + Send + Sync + 'static> {
pub learning_rate: T,
pub momentum: Option<Array1<T>>,
pub adaptive_state: Option<AdaptiveState<T>>,
pub gradient_accumulator: GradientAccumulator<T>,
pub step_count: usize,
pub last_update_magnitude: T,
pub convergence_tracker: ConvergenceTracker<T>,
}Expand description
Optimization state tracking
Fields§
§learning_rate: TCurrent learning rate
momentum: Option<Array1<T>>Momentum state
adaptive_state: Option<AdaptiveState<T>>Adaptive learning rate state (e.g., Adam)
gradient_accumulator: GradientAccumulator<T>Gradient accumulation
step_count: usizeStep count
last_update_magnitude: TLast update magnitude
convergence_tracker: ConvergenceTracker<T>Convergence tracking
Implementations§
Source§impl<T: Float + Debug + Send + Sync + 'static> OptimizationState<T>
impl<T: Float + Debug + Send + Sync + 'static> OptimizationState<T>
pub fn new(config: &TransformerBasedOptimizerConfig<T>) -> Result<Self>
pub fn update_with_step( &mut self, update: &Array1<T>, loss: Option<T>, ) -> Result<()>
pub fn get_progress(&self) -> OptimizationProgress<T>
pub fn reset(&mut self) -> Result<()>
pub fn validate(&self) -> Result<ValidationResult>
pub fn to_serializable(&self) -> Result<SerializableOptimizationState<T>>
pub fn from_serializable( &mut self, state: SerializableOptimizationState<T>, ) -> Result<()>
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for OptimizationState<T>where
T: Freeze,
impl<T> RefUnwindSafe for OptimizationState<T>where
T: RefUnwindSafe,
impl<T> Send for OptimizationState<T>
impl<T> Sync for OptimizationState<T>
impl<T> Unpin for OptimizationState<T>where
T: Unpin,
impl<T> UnsafeUnpin for OptimizationState<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for OptimizationState<T>where
T: UnwindSafe + RefUnwindSafe,
Blanket Implementations§
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
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.