pub struct Exponential {
    pub ls: f64,
    pub ampl: f64,
}
Expand description

The Exponential Kernel.

k(x,y) = A exp(-||x-y|| / 2l²)

Where A is the amplitude and l is the length scale.

Fields§

§ls: f64

The length scale of the kernel.

§ampl: f64

The amplitude of the kernel.

Implementations§

Construct a new squared exponential kernel.

Trait Implementations§

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more
Formats the value using the given formatter. Read more

Constructs the default Exponential kernel.

The defaults are:

  • ls = 1
  • amplitude = 1
Returns the “default value” for a type. Read more
Deserialize this value from the given Serde deserializer. Read more

The squared exponential kernel function.

Numbers of parameters (such as bandwidth and amplitude) of the kernel. Read more
Can the kernel be rescaled (see the rescale function) ? This value is false by default. Read more
Takes two equal length slices (row vector) and returns a vector containing the value of the gradient for each parameter in an arbitrary order. Read more
Multiplies the amplitude of the kernel by the scale parameter such that a kernel a*K(x,y) becomes scale*a*K(x,y). Read more
Returns a vector containing all the parameters of the kernel in the same order as the outputs of the gradient function.
Sets all the parameters of the kernel by reading them from a slice where they are in the same order as the outputs of the gradient function.
Optional, function that fits the kernel parameters on the training data using fast heuristics. This is used as a starting point for gradient descent. Read more
Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Should always be Self
The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Checks if self is actually part of its subset T (and can be converted to it).
Use with care! Same as self.to_subset but without any property checks. Always succeeds.
The inclusion map: converts self to the equivalent element of its superset.
The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion error.
Performs the conversion.