pub struct ProductKernel<A, B>{ /* private fields */ }
Expand description
Kernel representing the product of two other kernels
Implementations§
Trait Implementations§
source§impl<A, B, C> Add<C> for ProductKernel<A, B>
impl<A, B, C> Add<C> for ProductKernel<A, B>
source§impl<A, B> Clone for ProductKernel<A, B>
impl<A, B> Clone for ProductKernel<A, B>
source§fn clone(&self) -> ProductKernel<A, B>
fn clone(&self) -> ProductKernel<A, B>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl<A, B> Debug for ProductKernel<A, B>
impl<A, B> Debug for ProductKernel<A, B>
source§impl<'de, A, B> Deserialize<'de> for ProductKernel<A, B>
impl<'de, A, B> Deserialize<'de> for ProductKernel<A, B>
source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
source§impl<A, B> Kernel for ProductKernel<A, B>
impl<A, B> Kernel for ProductKernel<A, B>
source§fn n_parameters(&self) -> usize
fn n_parameters(&self) -> usize
Return the number of parameters used in this
Kernel
.source§fn covariance<R1, R2, C1, C2, S1, S2>(
&self,
x1: &Matrix<f64, R1, C1, S1>,
x2: &Matrix<f64, R2, C2, S2>,
) -> DMatrix<f64>where
R1: Dim,
R2: Dim,
C1: Dim,
C2: Dim,
S1: Storage<f64, R1, C1>,
S2: Storage<f64, R2, C2>,
ShapeConstraint: SameNumberOfColumns<C1, C2>,
fn covariance<R1, R2, C1, C2, S1, S2>(
&self,
x1: &Matrix<f64, R1, C1, S1>,
x2: &Matrix<f64, R2, C2, S2>,
) -> DMatrix<f64>where
R1: Dim,
R2: Dim,
C1: Dim,
C2: Dim,
S1: Storage<f64, R1, C1>,
S2: Storage<f64, R2, C2>,
ShapeConstraint: SameNumberOfColumns<C1, C2>,
Returns the covariance matrix for two equal sized vectors
source§fn is_stationary(&self) -> bool
fn is_stationary(&self) -> bool
Reports if the given kernel function is stationary.
source§fn diag<R, C, S>(&self, x: &Matrix<f64, R, C, S>) -> DVector<f64>
fn diag<R, C, S>(&self, x: &Matrix<f64, R, C, S>) -> DVector<f64>
Returns the diagonal of the kernel(x, x)
source§fn parameters(&self) -> DVector<f64>
fn parameters(&self) -> DVector<f64>
Return the corresponding parameter vector
The parameters here are in a log-scale
source§fn reparameterize(&self, params: &[f64]) -> Result<Self, KernelError>
fn reparameterize(&self, params: &[f64]) -> Result<Self, KernelError>
Create a new kernel of the given type from the provided parameters.
The parameters here are in a log-scale
source§fn covariance_with_gradient<R, C, S>(
&self,
x: &Matrix<f64, R, C, S>,
) -> Result<(DMatrix<f64>, CovGrad), CovGradError>
fn covariance_with_gradient<R, C, S>( &self, x: &Matrix<f64, R, C, S>, ) -> Result<(DMatrix<f64>, CovGrad), CovGradError>
Covariance and Gradient with the log-scaled hyper-parameters
source§fn consume_parameters<I: IntoIterator<Item = f64>>(
&self,
params: I,
) -> Result<(Self, I::IntoIter), KernelError>
fn consume_parameters<I: IntoIterator<Item = f64>>( &self, params: I, ) -> Result<(Self, I::IntoIter), KernelError>
Takes a sequence of parameters and consumes only the ones it needs
to create itself.
The parameters here are in a log-scale
fn add<B: Kernel>(self, other: B) -> AddKernel<Self, B>
fn mul<B: Kernel>(self, other: B) -> ProductKernel<Self, B>
source§impl<A, B, C> Mul<C> for ProductKernel<A, B>
impl<A, B, C> Mul<C> for ProductKernel<A, B>
§type Output = ProductKernel<ProductKernel<A, B>, C>
type Output = ProductKernel<ProductKernel<A, B>, C>
The resulting type after applying the
*
operator.source§impl<A, B> PartialEq for ProductKernel<A, B>
impl<A, B> PartialEq for ProductKernel<A, B>
source§fn eq(&self, other: &ProductKernel<A, B>) -> bool
fn eq(&self, other: &ProductKernel<A, B>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl<A, B> Serialize for ProductKernel<A, B>
impl<A, B> Serialize for ProductKernel<A, B>
impl<A, B> Eq for ProductKernel<A, B>
impl<A, B> StructuralPartialEq for ProductKernel<A, B>
Auto Trait Implementations§
impl<A, B> Freeze for ProductKernel<A, B>
impl<A, B> RefUnwindSafe for ProductKernel<A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<A, B> Send for ProductKernel<A, B>
impl<A, B> Sync for ProductKernel<A, B>
impl<A, B> Unpin for ProductKernel<A, B>
impl<A, B> UnwindSafe for ProductKernel<A, B>where
A: UnwindSafe,
B: UnwindSafe,
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§default unsafe fn clone_to_uninit(&self, dst: *mut T)
default unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)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<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.