pub struct MetaOptimizer<F: Float + Debug + ScalarOperand> { /* private fields */ }Expand description
Meta-Optimizer using LSTM to generate parameter updates
Implementations§
Source§impl<F: Float + Debug + Clone + FromPrimitive + ScalarOperand> MetaOptimizer<F>
impl<F: Float + Debug + Clone + FromPrimitive + ScalarOperand> MetaOptimizer<F>
Sourcepub fn generate_update(
&mut self,
gradient: F,
loss_history: &[F],
step_count: usize,
) -> Result<F>
pub fn generate_update( &mut self, gradient: F, loss_history: &[F], step_count: usize, ) -> Result<F>
Generate parameter update using meta-optimizer
Sourcepub fn meta_train(
&mut self,
optimization_problems: &[OptimizationProblem<F>],
) -> Result<F>
pub fn meta_train( &mut self, optimization_problems: &[OptimizationProblem<F>], ) -> Result<F>
Train meta-optimizer on optimization tasks
Get current hidden state
Sourcepub fn cell_state(&self) -> &Array1<F>
pub fn cell_state(&self) -> &Array1<F>
Get current cell state
Set hidden state
Sourcepub fn set_cell_state(&mut self, state: Array1<F>) -> Result<()>
pub fn set_cell_state(&mut self, state: Array1<F>) -> Result<()>
Set cell state
Sourcepub fn dimensions(&self) -> (usize, usize)
pub fn dimensions(&self) -> (usize, usize)
Get optimizer dimensions
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for MetaOptimizer<F>
impl<F> RefUnwindSafe for MetaOptimizer<F>where
F: RefUnwindSafe,
impl<F> Send for MetaOptimizer<F>where
F: Send,
impl<F> Sync for MetaOptimizer<F>where
F: Sync,
impl<F> Unpin for MetaOptimizer<F>
impl<F> UnwindSafe for MetaOptimizer<F>where
F: 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> 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.