pub struct SquaredExponential {
pub length_scale: f64,
pub signal_variance: f64,
}Expand description
Squared Exponential (RBF) kernel: k(x, x’) = σ² exp(-||x - x’||² / (2 l²))
This is the most commonly used kernel. It assumes smoothness and is infinitely differentiable.
Fields§
§length_scale: f64Length scale parameter (controls how quickly correlation decays)
signal_variance: f64Signal variance (controls output scale)
Implementations§
Trait Implementations§
Source§impl Clone for SquaredExponential
impl Clone for SquaredExponential
Source§fn clone(&self) -> SquaredExponential
fn clone(&self) -> SquaredExponential
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 moreSource§impl Debug for SquaredExponential
impl Debug for SquaredExponential
Source§impl Default for SquaredExponential
impl Default for SquaredExponential
Source§impl Kernel for SquaredExponential
impl Kernel for SquaredExponential
Source§fn compute(&self, x1: &ArrayView1<'_, f64>, x2: &ArrayView1<'_, f64>) -> f64
fn compute(&self, x1: &ArrayView1<'_, f64>, x2: &ArrayView1<'_, f64>) -> f64
Compute covariance between two points
Source§fn get_params(&self) -> Vec<f64>
fn get_params(&self) -> Vec<f64>
Get kernel parameters (for optimization)
Source§fn set_params(&mut self, params: &[f64])
fn set_params(&mut self, params: &[f64])
Set kernel parameters
Source§fn compute_matrix(&self, x: &Array2<f64>) -> Array2<f64>
fn compute_matrix(&self, x: &Array2<f64>) -> Array2<f64>
Compute covariance matrix for a set of points
Auto Trait Implementations§
impl Freeze for SquaredExponential
impl RefUnwindSafe for SquaredExponential
impl Send for SquaredExponential
impl Sync for SquaredExponential
impl Unpin for SquaredExponential
impl UnsafeUnpin for SquaredExponential
impl UnwindSafe for SquaredExponential
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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.