pub struct MAMLLearner<T: Float + Debug + Send + Sync + 'static, D: Dimension> { /* private fields */ }Expand description
MAML implementation over the shared linear task model
(super::linear_model).
The inner loop descends the support-set loss of that model with analytic
gradients; the outer loop applies FOMAML by default and the exact
second-order MAML meta-gradient when config.second_order is set (exact
because the model is linear in its parameters, so its MSE Hessian is
constant and the Hessian-vector product is closed-form).
Implementations§
Source§impl<T: Float + Default + Clone + Send + Sync + ScalarOperand + Debug, D: Dimension> MAMLLearner<T, D>
impl<T: Float + Default + Clone + Send + Sync + ScalarOperand + Debug, D: Dimension> MAMLLearner<T, D>
pub fn new(config: MAMLConfig<T>) -> Result<Self>
Sourcepub fn adaptations_recorded(&self) -> usize
pub fn adaptations_recorded(&self) -> usize
Number of task adaptations recorded so far.
Trait Implementations§
Source§impl<T: Float + Debug + 'static + Default + Clone + Send + Sync + Sum + ScalarOperand, D: Dimension> MetaLearner<T> for MAMLLearner<T, D>
impl<T: Float + Debug + 'static + Default + Clone + Send + Sync + Sum + ScalarOperand, D: Dimension> MetaLearner<T> for MAMLLearner<T, D>
Source§fn meta_train_step(
&mut self,
task_batch: &[MetaTask<T>],
meta_parameters: &mut HashMap<String, Array1<T>>,
) -> Result<MetaTrainingResult<T>>
fn meta_train_step( &mut self, task_batch: &[MetaTask<T>], meta_parameters: &mut HashMap<String, Array1<T>>, ) -> Result<MetaTrainingResult<T>>
One meta-training step over a batch of tasks.
The meta-update is applied here (see the module docs): meta_parameters
comes back already advanced by -outer_lr * meta_gradient.
Source§fn adapt_to_task(
&mut self,
task: &MetaTask<T>,
meta_parameters: &HashMap<String, Array1<T>>,
adaptation_steps: usize,
) -> Result<TaskAdaptationResult<T>>
fn adapt_to_task( &mut self, task: &MetaTask<T>, meta_parameters: &HashMap<String, Array1<T>>, adaptation_steps: usize, ) -> Result<TaskAdaptationResult<T>>
Inner loop: descend the support-set loss from the meta-parameters.
Source§fn evaluate_query_set(
&self,
task: &MetaTask<T>,
adapted_parameters: &HashMap<String, Array1<T>>,
) -> Result<QueryEvaluationResult<T>>
fn evaluate_query_set( &self, task: &MetaTask<T>, adapted_parameters: &HashMap<String, Array1<T>>, ) -> Result<QueryEvaluationResult<T>>
Evaluate the query set at the adapted parameters.
Source§fn get_algorithm(&self) -> MetaLearningAlgorithm
fn get_algorithm(&self) -> MetaLearningAlgorithm
Get meta-learner type
Auto Trait Implementations§
impl<T, D> Freeze for MAMLLearner<T, D>
impl<T, D> RefUnwindSafe for MAMLLearner<T, D>where
MAMLConfig<T>: RefUnwindSafe,
VecDeque<TaskAdaptationResult<T>>: RefUnwindSafe,
PhantomData<D>: RefUnwindSafe,
impl<T, D> Send for MAMLLearner<T, D>
impl<T, D> Sync for MAMLLearner<T, D>
impl<T, D> Unpin for MAMLLearner<T, D>
impl<T, D> UnsafeUnpin for MAMLLearner<T, D>where
MAMLConfig<T>: UnsafeUnpin,
VecDeque<TaskAdaptationResult<T>>: UnsafeUnpin,
PhantomData<D>: UnsafeUnpin,
impl<T, D> UnwindSafe for MAMLLearner<T, D>where
MAMLConfig<T>: UnwindSafe,
VecDeque<TaskAdaptationResult<T>>: UnwindSafe,
PhantomData<D>: UnwindSafe,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
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
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
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.