pub struct LowLatencyOptimizer<O, A>{ /* private fields */ }Expand description
Low-latency streaming optimizer
Implementations§
Source§impl<O, A> LowLatencyOptimizer<O, A>
impl<O, A> LowLatencyOptimizer<O, A>
Sourcepub fn new(_baseoptimizer: O, config: LowLatencyConfig) -> Result<Self>
pub fn new(_baseoptimizer: O, config: LowLatencyConfig) -> Result<Self>
Create a new low-latency optimizer
Sourcepub fn set_parameters(&mut self, parameters: Array1<A>)
pub fn set_parameters(&mut self, parameters: Array1<A>)
Seed the parameter vector the optimizer will keep updating.
Sourcepub fn set_precomputation_min_confidence(&mut self, min_confidence: A)
pub fn set_precomputation_min_confidence(&mut self, min_confidence: A)
Current parameter vector, if any step has been taken or seeded. Require a minimum predictor confidence before a pre-computed update is served, falling back to a full update below it.
No-op when pre-computation is disabled. Defaults to zero, which accepts any prediction that matches the arriving gradient.
pub fn parameters(&self) -> Option<&Array1<A>>
Sourcepub fn low_latency_step(&mut self, gradient: &Array1<A>) -> Result<Array1<A>>
pub fn low_latency_step(&mut self, gradient: &Array1<A>) -> Result<Array1<A>>
Perform a low-latency update
Sourcepub fn try_pop_staged_update(&mut self) -> Option<Array1<A>>
pub fn try_pop_staged_update(&mut self) -> Option<Array1<A>>
Take the oldest staged update, if any.
Sourcepub fn staged_update_count(&self) -> usize
pub fn staged_update_count(&self) -> usize
Number of updates currently staged.
Sourcepub fn get_performance_metrics(&self) -> LowLatencyMetrics
pub fn get_performance_metrics(&self) -> LowLatencyMetrics
Get current performance metrics
Sourcepub fn is_meeting_latency_requirements(&self) -> bool
pub fn is_meeting_latency_requirements(&self) -> bool
Check if optimizer is meeting latency requirements
Auto Trait Implementations§
impl<O, A> !Freeze for LowLatencyOptimizer<O, A>
impl<O, A> RefUnwindSafe for LowLatencyOptimizer<O, A>where
A: RefUnwindSafe,
impl<O, A> Send for LowLatencyOptimizer<O, A>
impl<O, A> Sync for LowLatencyOptimizer<O, A>
impl<O, A> Unpin for LowLatencyOptimizer<O, A>where
A: Unpin,
impl<O, A> UnsafeUnpin for LowLatencyOptimizer<O, A>where
A: UnsafeUnpin,
impl<O, A> UnwindSafe for LowLatencyOptimizer<O, A>where
A: UnwindSafe + RefUnwindSafe,
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> 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.