pub struct VariableAccumulator<A: Float, D: Dimension> { /* private fields */ }Expand description
Variable accumulation scheduler
Implementations§
Source§impl<A: Float + ScalarOperand + Debug, D: Dimension + Send + Sync> VariableAccumulator<A, D>
impl<A: Float + ScalarOperand + Debug, D: Dimension + Send + Sync> VariableAccumulator<A, D>
Sourcepub fn new(_initialtarget: usize, mode: AccumulationMode) -> Self
pub fn new(_initialtarget: usize, mode: AccumulationMode) -> Self
Create a new variable accumulator
Sourcepub fn add_adaptive_rule<F>(&mut self, condition: F, accumulationsteps: usize)
pub fn add_adaptive_rule<F>(&mut self, condition: F, accumulationsteps: usize)
Add a condition-based accumulation rule
Sourcepub fn accumulate(&mut self, gradients: &[Array<A, D>]) -> Result<()>
pub fn accumulate(&mut self, gradients: &[Array<A, D>]) -> Result<()>
Accumulate gradients with adaptive targeting
Sourcepub fn get_and_step(&mut self) -> Result<Vec<Array<A, D>>>
pub fn get_and_step(&mut self) -> Result<Vec<Array<A, D>>>
Get accumulated gradients and advance step
Sourcepub fn step_count(&self) -> usize
pub fn step_count(&self) -> usize
Get current step count
Sourcepub fn accumulator(&self) -> &GradientAccumulator<A, D>
pub fn accumulator(&self) -> &GradientAccumulator<A, D>
Get underlying accumulator
Sourcepub fn accumulator_mut(&mut self) -> &mut GradientAccumulator<A, D>
pub fn accumulator_mut(&mut self) -> &mut GradientAccumulator<A, D>
Get mutable reference to underlying accumulator
Auto Trait Implementations§
impl<A, D> Freeze for VariableAccumulator<A, D>
impl<A, D> !RefUnwindSafe for VariableAccumulator<A, D>
impl<A, D> !Send for VariableAccumulator<A, D>
impl<A, D> !Sync for VariableAccumulator<A, D>
impl<A, D> Unpin for VariableAccumulator<A, D>where
D: Unpin,
impl<A, D> !UnwindSafe for VariableAccumulator<A, D>
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> 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.