pub struct OptimizationProblem<F: Float + Debug> {
pub initial_params: Array1<F>,
pub target: Array1<F>,
pub max_steps: usize,
}Expand description
Optimization problem for meta-optimizer training
Fields§
§initial_params: Array1<F>Initial parameters
target: Array1<F>Target parameters
max_steps: usizeMaximum optimization steps
Implementations§
Source§impl<F: Float + Debug> OptimizationProblem<F>
impl<F: Float + Debug> OptimizationProblem<F>
Sourcepub fn new(
initial_params: Array1<F>,
target: Array1<F>,
max_steps: usize,
) -> Self
pub fn new( initial_params: Array1<F>, target: Array1<F>, max_steps: usize, ) -> Self
Create a new optimization problem
Sourcepub fn quadratic(dim: usize, max_steps: usize) -> Selfwhere
F: FromPrimitive,
pub fn quadratic(dim: usize, max_steps: usize) -> Selfwhere
F: FromPrimitive,
Create a quadratic optimization problem
Sourcepub fn random(dim: usize, max_steps: usize) -> Selfwhere
F: FromPrimitive,
pub fn random(dim: usize, max_steps: usize) -> Selfwhere
F: FromPrimitive,
Create a random optimization problem
Sourcepub fn evaluate(&self, params: &Array1<F>) -> F
pub fn evaluate(&self, params: &Array1<F>) -> F
Evaluate the objective function at given parameters
Sourcepub fn gradient(&self, params: &Array1<F>) -> Array1<F>
pub fn gradient(&self, params: &Array1<F>) -> Array1<F>
Compute the gradient at given parameters
Sourcepub fn has_converged(&self, params: &Array1<F>, tolerance: F) -> bool
pub fn has_converged(&self, params: &Array1<F>, tolerance: F) -> bool
Check if the problem has converged
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for OptimizationProblem<F>
impl<F> RefUnwindSafe for OptimizationProblem<F>where
F: RefUnwindSafe,
impl<F> Send for OptimizationProblem<F>where
F: Send,
impl<F> Sync for OptimizationProblem<F>where
F: Sync,
impl<F> Unpin for OptimizationProblem<F>
impl<F> UnwindSafe for OptimizationProblem<F>where
F: RefUnwindSafe,
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.