#[non_exhaustive]pub enum CovKernel {
Gaussian {
length_scale: f64,
variance: f64,
},
Exponential {
length_scale: f64,
variance: f64,
},
Matern {
length_scale: f64,
variance: f64,
nu: f64,
},
Brownian {
variance: f64,
},
Periodic {
length_scale: f64,
variance: f64,
period: f64,
},
Linear {
variance: f64,
offset: f64,
},
Polynomial {
variance: f64,
offset: f64,
degree: u32,
},
WhiteNoise {
variance: f64,
},
Sum(Box<CovKernel>, Box<CovKernel>),
Product(Box<CovKernel>, Box<CovKernel>),
}Expand description
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
Gaussian
Squared-exponential (RBF) kernel: variance * exp(-0.5 * ((s-t)/length_scale)^2).
Exponential
Exponential (Ornstein-Uhlenbeck) kernel: variance * exp(-|s-t| / length_scale).
Matern
Matern kernel with smoothness parameter nu.
Closed-form expressions are used for nu = 0.5 (exponential),
nu = 1.5, and nu = 2.5. For other values of nu the general
formula with a gamma-function approximation is used.
Brownian
Brownian motion (Wiener process) kernel: variance * min(s, t).
Periodic
Periodic kernel: variance * exp(-2 * sin^2(pi * |s-t| / period) / length_scale^2).
Linear
Linear kernel: variance * (s - offset) * (t - offset).
Polynomial
Polynomial kernel: (variance * s * t + offset)^degree.
WhiteNoise
White noise kernel: variance * delta(s, t).
Sum(Box<CovKernel>, Box<CovKernel>)
Sum of two kernels: k1(s,t) + k2(s,t).
Product(Box<CovKernel>, Box<CovKernel>)
Product of two kernels: k1(s,t) * k2(s,t).
Implementations§
Trait Implementations§
impl StructuralPartialEq for CovKernel
Auto Trait Implementations§
impl Freeze for CovKernel
impl RefUnwindSafe for CovKernel
impl Send for CovKernel
impl Sync for CovKernel
impl Unpin for CovKernel
impl UnsafeUnpin for CovKernel
impl UnwindSafe for CovKernel
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<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.