pub struct KellyCriterion { /* private fields */ }Expand description
Rolling Kelly Criterion fraction.
Input is treated as a per-period (or per-trade) return. Over the trailing window the indicator estimates the optimal capital fraction to allocate using the even-money Kelly formula generalised by the payoff ratio:
win_rate = P(r > 0) over window
avg_win = mean(r for r > 0)
avg_loss = mean(−r for r < 0)
payoff_ratio = avg_win / avg_loss
Kelly = win_rate − (1 − win_rate) / payoff_ratioThe output is the recommended fraction of capital to bet (typically
(0, 1); can go negative if the estimated edge is negative, in which
case the position should be reversed or sized to zero). Most
practitioners use a “half-Kelly” or “quarter-Kelly” multiplier in
practice to reduce variance — Wickra reports raw Kelly and leaves the
scaling to the caller.
Edge cases:
- No winners and no losers ⇒
0.0(no information). - No losers (
payoff_ratio = ∞) ⇒ Kelly collapses to the win rate. - No winners but losers present ⇒ Kelly =
−(1 − 0) / payoff = …, which is negative — bet nothing (or short).
Each update is O(period).
Implementations§
Trait Implementations§
Source§impl Clone for KellyCriterion
impl Clone for KellyCriterion
Source§impl Debug for KellyCriterion
impl Debug for KellyCriterion
Source§impl Indicator for KellyCriterion
impl Indicator for KellyCriterion
Source§fn update(&mut self, input: f64) -> Option<f64>
fn update(&mut self, input: f64) -> Option<f64>
Feed one new data point into the indicator and return the freshly
computed output, or
None if there is no value for this input. Read moreSource§fn reset(&mut self)
fn reset(&mut self)
Reset all internal state, leaving the indicator equivalent to a freshly
constructed instance with the same parameters.
Source§fn warmup_period(&self) -> usize
fn warmup_period(&self) -> usize
Number of inputs required before the first non-
None output can be produced.Source§fn is_ready(&self) -> bool
fn is_ready(&self) -> bool
Whether the indicator has emitted at least one value since the last reset.
Source§fn name(&self) -> &'static str
fn name(&self) -> &'static str
Stable, human-readable indicator name. Used by chaining and diagnostics.
Source§fn batch_nan_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
fn batch_nan_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
Source§fn batch_fast_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
fn batch_fast_into(&mut self, inputs: &[Self::Input], out: &mut [f64])
Opt-in fast batch: like
batch_nan_into, but
an indicator with a vectorised kernel may reassociate its arithmetic to
run it in SIMD lanes. Each value then agrees with the exact batch to within
the tolerance the indicator documents (a few units in the last place), not
bit for bit; warmup positions, NaN placement and the output length are
identical. The kernels are deterministic: the same input produces the same
bits on every platform, with or without SIMD hardware. Read moreAuto Trait Implementations§
impl Freeze for KellyCriterion
impl RefUnwindSafe for KellyCriterion
impl Send for KellyCriterion
impl Sync for KellyCriterion
impl Unpin for KellyCriterion
impl UnsafeUnpin for KellyCriterion
impl UnwindSafe for KellyCriterion
Blanket Implementations§
Source§impl<T> BatchExt for Twhere
T: Indicator,
impl<T> BatchExt for Twhere
T: Indicator,
Source§fn batch(&mut self, inputs: &[Self::Input]) -> Vec<Option<Self::Output>>
fn batch(&mut self, inputs: &[Self::Input]) -> Vec<Option<Self::Output>>
Run the indicator over a slice of inputs in order, returning one output (or
None during warmup) per input.Source§impl<T> BatchNanExt for T
impl<T> BatchNanExt for T
Source§fn batch_nan(&mut self, inputs: &[f64]) -> Vec<f64>
fn batch_nan(&mut self, inputs: &[f64]) -> Vec<f64>
One
f64 per input, warmup positions filled with NaN, bit-for-bit equal
to replaying update.Source§fn batch_fast(&mut self, inputs: &[f64]) -> Vec<f64>
fn batch_fast(&mut self, inputs: &[f64]) -> Vec<f64>
The opt-in fast batch (
Indicator::batch_fast_into) into a fresh
vector: within the indicator’s documented tolerance of
batch_nan, deterministic across platforms.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 more