pub struct HalsOpts<F: BixverseFloat> {
pub max_iter: usize,
pub tol: F,
pub eps: F,
pub check_every: usize,
pub init: NmfInit,
}Expand description
HALS solver options.
Fields§
§max_iter: usizeMaximum number of outer iterations.
tol: FRelative objective decrease below which the solver stops.
eps: FFloor applied to W and H entries on every sweep.
check_every: usizeCadence (in iterations) for evaluating the Frobenius objective.
init: NmfInitHow W and H are initialised.
Implementations§
Source§impl<F: BixverseFloat> HalsOpts<F>
impl<F: BixverseFloat> HalsOpts<F>
Sourcepub fn new(
max_iter: usize,
tol: F,
eps: F,
check_every: usize,
init: NmfInit,
) -> Self
pub fn new( max_iter: usize, tol: F, eps: F, check_every: usize, init: NmfInit, ) -> Self
Generate a new instance of HalsOpts
§Params
max_iter- Maximum iterations to run the algorithm fortol- Tolerance for early stoppingeps- Floor applied to W and H entries on every sweep.check_every- Cadence (in iters) for evaluating the Frobenius objective.init- How the W and H matrices are initialised, see NmfInit.
§Returns
The initialised HalsOpts.
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for HalsOpts<F>where
F: Freeze,
impl<F> RefUnwindSafe for HalsOpts<F>where
F: RefUnwindSafe,
impl<F> Send for HalsOpts<F>
impl<F> Sync for HalsOpts<F>
impl<F> Unpin for HalsOpts<F>where
F: Unpin,
impl<F> UnsafeUnpin for HalsOpts<F>where
F: UnsafeUnpin,
impl<F> UnwindSafe for HalsOpts<F>where
F: 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
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> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
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.