pub enum OptimizerSelectionStrategy {
MultiArmedBandit {
algorithm: BanditAlgorithm,
},
PerformanceBased {
min_difference: f64,
},
RoundRobin {
current_index: usize,
},
MetaLearning {
problem_features: Vec<f64>,
optimizer_mappings: HashMap<String, f64>,
},
}Expand description
Optimizer selection strategies.
Every variant below has a working implementation in
SelfTuningOptimizer; this enum is public so a caller can actually
choose between them via
SelfTuningOptimizer::set_selection_strategy. It used to be private
with the constructor hard-coding MultiArmedBandit { UCB1 }, which left
three fully-implemented strategies unreachable.
Variants§
MultiArmedBandit
Multi-armed bandit approach
Fields
§
algorithm: BanditAlgorithmBandit algorithm type
PerformanceBased
Performance-based selection
RoundRobin
Round-robin testing
MetaLearning
Meta-learning based selection
Trait Implementations§
Source§impl Clone for OptimizerSelectionStrategy
impl Clone for OptimizerSelectionStrategy
Source§fn clone(&self) -> OptimizerSelectionStrategy
fn clone(&self) -> OptimizerSelectionStrategy
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for OptimizerSelectionStrategy
impl RefUnwindSafe for OptimizerSelectionStrategy
impl Send for OptimizerSelectionStrategy
impl Sync for OptimizerSelectionStrategy
impl Unpin for OptimizerSelectionStrategy
impl UnsafeUnpin for OptimizerSelectionStrategy
impl UnwindSafe for OptimizerSelectionStrategy
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> 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
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.