mlx_rs::optimizers

Struct Adafactor

Source
pub struct Adafactor {
    pub lr: Option<f32>,
    pub eps: (Array, Array),
    pub clip_threshold: Array,
    pub decay_rate: Array,
    pub beta1: AdafactorBeta1,
    pub weight_decay: f32,
    pub scale_parameter: bool,
    pub relative_step: bool,
    pub warmup_init: bool,
    pub state: State<AdafactorState>,
}
Expand description

The Adafactor optimizer.

Our Adafactor implementation follows the original paper: `Adafactor: Adaptive Learning Rates with Sublinear Memory Cost https://arxiv.org/abs/1804.04235

Fields§

§lr: Option<f32>

The learning rate.

§eps: (Array, Array)

The first term is added to the square of the gradients to improve numerical stability. Default to Adafactor::DEFAULT_EPS.

§clip_threshold: Array

Clips the unscaled update. Default to Adafactor::DEFAULT_CLIP_THRESHOLD.

§decay_rate: Array

Coefficient for the running average of the squared gradient. Default to Adafactor::DEFAULT_DECAY_RATE.

§beta1: AdafactorBeta1

If set then the first moment will be used.

§weight_decay: f32

The weight decay. Default to Adafactor::DEFAULT_WEIGHT_DECAY.

§scale_parameter: bool

If true the learningRate will be scaled by max(eps.0, RMS(parameter)). Default to Adafactor::DEFAULT_SCALE_PARAMETER.

§relative_step: bool

If true the learningRate will be ignored and the relative step size will be computed. Default to Adafactor::DEFAULT_RELATIVE_STEP.

§warmup_init: bool

If true the relative step size will be calculated by the current step. Default to Adafactor::DEFAULT_WARMUP_INIT.

§state: State<AdafactorState>

Inner state.

Implementations§

Source§

impl Adafactor

Source

pub fn new() -> Result<Self, <<Self as Buildable>::Builder as Builder<Self>>::Error>

Creates a new instance of Adafactor.

Source§

impl Adafactor

Source

pub const DEFAULT_LR: Option<f32> = None

Default value for lr

Source

pub const DEFAULT_EPS: (f32, f32) = _

Default values for eps

Source

pub const DEFAULT_CLIP_THRESHOLD: f32 = 1f32

Default value for clip_threshold

Source

pub const DEFAULT_DECAY_RATE: f32 = -0.800000011f32

Default value for decay_rate

Source

pub const DEFAULT_WEIGHT_DECAY: f32 = 0f32

Default value for weight_decay

Source

pub const DEFAULT_SCALE_PARAMETER: bool = true

Default value for scale_parameter

Source

pub const DEFAULT_RELATIVE_STEP: bool = true

Default value for relative_step

Source

pub const DEFAULT_WARMUP_INIT: bool = false

Default value for warmup_init

Source

pub const DEFAULT_BETA1: Option<f32> = None

Default value for beta1

Trait Implementations§

Source§

impl Buildable for Adafactor

Source§

type Builder = AdafactorBuilder

The builder type for this buildable type
Source§

impl Builder<Adafactor> for AdafactorBuilder

Source§

type Error = AdafactorBuildError

Error with building
Source§

fn build(self) -> Result<Adafactor, Self::Error>

Build the type
Source§

impl Clone for Adafactor

Source§

fn clone(&self) -> Adafactor

Returns a copy of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Adafactor

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Optimizer for Adafactor

Source§

type State = HashMap<Rc<str>, AdafactorState>

State of the optimizer.
Source§

fn state(&self) -> &Self::State

Get the state of the optimizer.
Source§

fn state_mut(&mut self) -> &mut Self::State

Get the mutable state of the optimizer.
Source§

fn update_single( &mut self, key: &Rc<str>, gradient: &Array, parameter: &mut Array, ) -> Result<()>

Update a single parameter with the given gradient. Read more
Source§

fn update<M>( &mut self, model: &mut M, gradients: impl Borrow<FlattenedModuleParam>, ) -> Result<()>

Apply the gradients to the parameters of the model and update the model with the new parameters.
Source§

impl Updatable for &mut Adafactor

Source§

fn updatable_states(&self) -> impl IntoIterator<Item = &Array>

Returns a list of references to the updatable states. Read more
Source§

fn updatable_states_mut(&mut self) -> impl IntoIterator<Item = &mut Array>

Returns a list of mutable references to the updatable states. Read more
Source§

impl Updatable for Adafactor

Source§

fn updatable_states(&self) -> impl IntoIterator<Item = &Array>

Returns a list of references to the updatable states. Read more
Source§

fn updatable_states_mut(&mut self) -> impl IntoIterator<Item = &mut Array>

Returns a list of mutable references to the updatable states. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T> DynClone for T
where T: Clone,

Source§

fn __clone_box(&self, _: Private) -> *mut ()

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> IntoOption<T> for T

Source§

fn into_option(self) -> Option<T>

Convert into an Option.
Source§

impl<T> IntoStrideBy for T

Source§

fn stride_by(self, stride: i32) -> StrideBy<T>

Create a stride indexing operation.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.