Problem

Struct Problem 

Source
pub struct Problem { /* private fields */ }
Expand description

Represents an instance of the optimization problem.

The problem is defined as: $$\max_{c\in\mathbb{R}, B \in \mathbb{S}^n_+} c - \lambda \text{Tr}(B) + t \log \det (B) \qquad \text{s.t. }\quad f_i - c = \Phi_i^T B \Phi_i, \:\:\forall i\in[\![1, N]\!]$$ where:

  • $\lambda$ is the trace penalty,
  • $t$ is the relative precision, with $t = \varepsilon / n$,
  • $x_i$ are the sample points,
  • $f_i$ are the function values at the sample points,
  • $\Phi$ is the features matrix derived from the kernel matrix $K$,
  • $K$ is the kernel matrix computed from the sample points using a specified kernel function.

In practice, $K$ only is computed first, and $\Phi$ is optionally computed later.

Implementations§

Source§

impl Problem

Source

pub fn new( lambda: f64, t: f64, x_samples: Mat<f64>, f_samples: Mat<f64>, ) -> Result<Self, ProblemError>

Creates a new problem instance from samples and parameters.

The features matrix $\Phi$ and kernel matrix $K$ are not computed at this stage.

§Arguments
  • lambda - Trace penalty parameter.
  • t - Relative precision parameter.
  • x_samples - Sample points matrix of shape (n, d).
  • f_samples - Function values at the sample points of shape (n, 1).

Note: this function does not compute the kernel matrix $K$ or the features matrix $\Phi$. To compute them, please call initialize_native_kernel and compute_phi respectively.

Source

pub fn initialize_native_kernel( &mut self, kernel: Kernel, ) -> Result<(), ProblemError>

Initializes the kernel matrix $K$ using the specified native kernel.

This method computes the kernel matrix based on the provided kernel type and its parameters, and then derives the features matrix from the Cholesky decomposition of the kernel matrix.

§Arguments
  • kernel - The kernel type and its associated parameter (see Kernel enum).
§Errors

Returns ProblemError::KernelAlreadyInitialized if the kernel has already been initialized. Returns a faer variant of ProblemError if there is an error during the Cholesky decomposition.

Source

pub fn compute_phi(&mut self) -> Result<(), ProblemError>

Computes the features matrix $\Phi$ from the kernel matrix $K$ using Cholesky decomposition.

This function must be called after initialize_native_kernel.

Trait Implementations§

Source§

impl Clone for Problem

Source§

fn clone(&self) -> Problem

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for Problem

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,