pub struct MetaLearningOptimizer { /* private fields */ }
Expand description
Meta-Learning Optimizer with cross-problem adaptation
Implementations§
Source§impl MetaLearningOptimizer
impl MetaLearningOptimizer
Sourcepub fn new(config: LearnedOptimizationConfig) -> Self
pub fn new(config: LearnedOptimizationConfig) -> Self
Create new meta-learning optimizer
Sourcepub fn learn_meta_strategy(
&mut self,
training_tasks: &[TrainingTask],
) -> OptimizeResult<()>
pub fn learn_meta_strategy( &mut self, training_tasks: &[TrainingTask], ) -> OptimizeResult<()>
Learn meta-optimization strategy
Sourcepub fn adapt_to_new_problem(
&mut self,
problem: &OptimizationProblem,
) -> OptimizeResult<TaskSpecificOptimizer>
pub fn adapt_to_new_problem( &mut self, problem: &OptimizationProblem, ) -> OptimizeResult<TaskSpecificOptimizer>
Adapt to new problem using meta-knowledge
Sourcepub fn get_meta_stats(&self) -> &MetaLearningStats
pub fn get_meta_stats(&self) -> &MetaLearningStats
Get meta-learning statistics
Trait Implementations§
Source§impl Clone for MetaLearningOptimizer
impl Clone for MetaLearningOptimizer
Source§fn clone(&self) -> MetaLearningOptimizer
fn clone(&self) -> MetaLearningOptimizer
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl Debug for MetaLearningOptimizer
impl Debug for MetaLearningOptimizer
Source§impl LearnedOptimizer for MetaLearningOptimizer
impl LearnedOptimizer for MetaLearningOptimizer
Source§fn meta_train(&mut self, training_tasks: &[TrainingTask]) -> OptimizeResult<()>
fn meta_train(&mut self, training_tasks: &[TrainingTask]) -> OptimizeResult<()>
Meta-train the optimizer on a distribution of problems
Source§fn adapt_to_problem(
&mut self,
problem: &OptimizationProblem,
initial_params: &ArrayView1<'_, f64>,
) -> OptimizeResult<()>
fn adapt_to_problem( &mut self, problem: &OptimizationProblem, initial_params: &ArrayView1<'_, f64>, ) -> OptimizeResult<()>
Adapt to a new problem with few-shot learning
Source§fn optimize<F>(
&mut self,
objective: F,
initial_params: &ArrayView1<'_, f64>,
) -> OptimizeResult<OptimizeResults<f64>>
fn optimize<F>( &mut self, objective: F, initial_params: &ArrayView1<'_, f64>, ) -> OptimizeResult<OptimizeResults<f64>>
Optimize a function using learned knowledge
Source§fn get_state(&self) -> &MetaOptimizerState
fn get_state(&self) -> &MetaOptimizerState
Get current meta-optimizer state
Auto Trait Implementations§
impl Freeze for MetaLearningOptimizer
impl RefUnwindSafe for MetaLearningOptimizer
impl Send for MetaLearningOptimizer
impl Sync for MetaLearningOptimizer
impl Unpin for MetaLearningOptimizer
impl UnwindSafe for MetaLearningOptimizer
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.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.