pub enum BanditAlgorithm {
EpsilonGreedy,
UCB1,
ThompsonSampling,
LinUCB,
}Expand description
Multi-armed bandit algorithms.
All four are implemented by select_optimizer_bandit; public so
OptimizerSelectionStrategy::MultiArmedBandit can be built with any of
them.
Variants§
EpsilonGreedy
Explore uniformly at random with probability exploration_rate,
otherwise take the current best reward estimate.
UCB1
Deterministic upper-confidence-bound selection (Auer et al. 2002).
ThompsonSampling
Sample each arm from its estimated reward interval and take the best draw.
LinUCB
Contextual UCB variant.
Trait Implementations§
Source§impl Clone for BanditAlgorithm
impl Clone for BanditAlgorithm
Source§fn clone(&self) -> BanditAlgorithm
fn clone(&self) -> BanditAlgorithm
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 moreimpl Copy for BanditAlgorithm
Source§impl Debug for BanditAlgorithm
impl Debug for BanditAlgorithm
impl Eq for BanditAlgorithm
Source§impl PartialEq for BanditAlgorithm
impl PartialEq for BanditAlgorithm
impl StructuralPartialEq for BanditAlgorithm
Auto Trait Implementations§
impl Freeze for BanditAlgorithm
impl RefUnwindSafe for BanditAlgorithm
impl Send for BanditAlgorithm
impl Sync for BanditAlgorithm
impl Unpin for BanditAlgorithm
impl UnsafeUnpin for BanditAlgorithm
impl UnwindSafe for BanditAlgorithm
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
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,
impl<T> Scalar 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>
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.