pub struct ReptileOptimizer<A: Float + ScalarOperand + Debug> { /* private fields */ }Expand description
Reptile meta-learning optimizer
Implements the Reptile algorithm for meta-learning. Reptile performs multiple inner SGD steps on a task, then interpolates between the original parameters and the adapted parameters using an interpolation factor epsilon.
§Algorithm
For each step:
- Save initial parameters theta_0
- Perform
inner_stepsSGD updates: theta_k = theta_{k-1} - inner_lr * grad - Compute meta-update: theta_new = theta_0 + epsilon * (theta_K - theta_0)
This effectively moves the initialization point toward a region that is beneficial for fast adaptation across tasks.
§Examples
use scirs2_core::ndarray::Array1;
use optirs_core::optimizers::{ReptileOptimizer, Optimizer};
let params = Array1::from_vec(vec![1.0, 2.0, 3.0]);
let gradients = Array1::from_vec(vec![0.1, -0.2, 0.3]);
let mut optimizer = ReptileOptimizer::new(0.01);
let new_params = optimizer.step(¶ms, &gradients).expect("step failed");Implementations§
Source§impl<A: Float + ScalarOperand + Debug> ReptileOptimizer<A>
impl<A: Float + ScalarOperand + Debug> ReptileOptimizer<A>
Sourcepub fn new(lr: A) -> Self
pub fn new(lr: A) -> Self
Creates a new Reptile optimizer with the given outer learning rate
Defaults:
- inner_steps: 5
- epsilon: same as learning_rate
- inner_lr: same as learning_rate
§Arguments
lr- The outer learning rate (also used as default epsilon and inner_lr)
Sourcepub fn with_inner_steps(self, n: usize) -> Self
pub fn with_inner_steps(self, n: usize) -> Self
Sets the number of inner SGD steps
More inner steps allow better task adaptation but increase computation.
§Arguments
n- Number of inner SGD steps (must be >= 1)
Sourcepub fn with_epsilon(self, e: A) -> Self
pub fn with_epsilon(self, e: A) -> Self
Sets the interpolation factor epsilon
Controls how much the meta-update moves toward the adapted parameters. Smaller values mean more conservative updates.
§Arguments
e- Interpolation factor (typically in [0, 1])
Sourcepub fn with_inner_lr(self, lr: A) -> Self
pub fn with_inner_lr(self, lr: A) -> Self
Sets the inner SGD learning rate
This learning rate is used for the inner adaptation steps on each task.
§Arguments
lr- Inner learning rate
Sourcepub fn get_inner_steps(&self) -> usize
pub fn get_inner_steps(&self) -> usize
Returns the number of inner steps configured
Sourcepub fn get_epsilon(&self) -> A
pub fn get_epsilon(&self) -> A
Returns the current epsilon (interpolation factor)
Sourcepub fn get_inner_lr(&self) -> A
pub fn get_inner_lr(&self) -> A
Returns the inner learning rate
Sourcepub fn get_step_count(&self) -> usize
pub fn get_step_count(&self) -> usize
Returns the number of outer steps taken so far
Trait Implementations§
Source§impl<A: Clone + Float + ScalarOperand + Debug> Clone for ReptileOptimizer<A>
impl<A: Clone + Float + ScalarOperand + Debug> Clone for ReptileOptimizer<A>
Source§fn clone(&self) -> ReptileOptimizer<A>
fn clone(&self) -> ReptileOptimizer<A>
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl<A: Debug + Float + ScalarOperand + Debug> Debug for ReptileOptimizer<A>
impl<A: Debug + Float + ScalarOperand + Debug> Debug for ReptileOptimizer<A>
Source§impl<A, D> Optimizer<A, D> for ReptileOptimizer<A>
impl<A, D> Optimizer<A, D> for ReptileOptimizer<A>
Source§fn step(
&mut self,
params: &Array<A, D>,
gradients: &Array<A, D>,
) -> Result<Array<A, D>>
fn step( &mut self, params: &Array<A, D>, gradients: &Array<A, D>, ) -> Result<Array<A, D>>
Source§fn get_learning_rate(&self) -> A
fn get_learning_rate(&self) -> A
Source§fn set_learning_rate(&mut self, learning_rate: A)
fn set_learning_rate(&mut self, learning_rate: A)
Auto Trait Implementations§
impl<A> Freeze for ReptileOptimizer<A>where
A: Freeze,
impl<A> RefUnwindSafe for ReptileOptimizer<A>where
A: RefUnwindSafe,
impl<A> Send for ReptileOptimizer<A>where
A: Send,
impl<A> Sync for ReptileOptimizer<A>where
A: Sync,
impl<A> Unpin for ReptileOptimizer<A>where
A: Unpin,
impl<A> UnsafeUnpin for ReptileOptimizer<A>where
A: UnsafeUnpin,
impl<A> UnwindSafe for ReptileOptimizer<A>where
A: 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
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>
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>
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>
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.