pub enum Optimizer {
SGD {
learning_rate: f64,
},
SGDMomentum {
learning_rate: f64,
momentum: f64,
},
Adam {
learning_rate: f64,
beta1: f64,
beta2: f64,
epsilon: f64,
},
AdamW {
learning_rate: f64,
beta1: f64,
beta2: f64,
epsilon: f64,
weight_decay: f64,
},
RMSprop {
learning_rate: f64,
alpha: f64,
epsilon: f64,
},
AdaGrad {
learning_rate: f64,
epsilon: f64,
},
AdaDelta {
rho: f64,
epsilon: f64,
},
NAdam {
learning_rate: f64,
beta1: f64,
beta2: f64,
epsilon: f64,
},
Lion {
learning_rate: f64,
beta1: f64,
beta2: f64,
},
AdaBelief {
learning_rate: f64,
beta1: f64,
beta2: f64,
epsilon: f64,
},
}Variants§
Implementations§
Source§impl Optimizer
impl Optimizer
pub fn sgd(learning_rate: f64) -> Self
pub fn sgd_momentum(learning_rate: f64, momentum: f64) -> Self
pub fn adam(learning_rate: f64) -> Self
pub fn adamw(learning_rate: f64, weight_decay: f64) -> Self
pub fn rmsprop(learning_rate: f64) -> Self
pub fn adagrad(learning_rate: f64) -> Self
pub fn adadelta() -> Self
pub fn nadam(learning_rate: f64) -> Self
pub fn lion(learning_rate: f64) -> Self
pub fn adabelief(learning_rate: f64) -> Self
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Optimizer
impl<'de> Deserialize<'de> for Optimizer
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for Optimizer
impl RefUnwindSafe for Optimizer
impl Send for Optimizer
impl Sync for Optimizer
impl Unpin for Optimizer
impl UnwindSafe for Optimizer
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<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
Source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
Read this value from the supplied reader. Same as
ReadEndian::read_from_little_endian().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.