#[non_exhaustive]pub enum UnbalancedRegularization {
KLDivergence,
L2,
}Expand description
Marginal relaxation type for unbalanced OT.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
KLDivergence
KL-divergence marginal penalty: τ KL(T1 | a) + τ KL(1ᵀT | b). This is the standard choice for UOT and leads to a closed-form proximal step in the scaling algorithm.
L2
L2-norm marginal penalty: (τ/2) ‖T1 − a‖² + (τ/2) ‖1ᵀT − b‖². The proximal step is a soft-thresholding operator.
Trait Implementations§
Source§impl Clone for UnbalancedRegularization
impl Clone for UnbalancedRegularization
Source§fn clone(&self) -> UnbalancedRegularization
fn clone(&self) -> UnbalancedRegularization
Returns a duplicate 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 Debug for UnbalancedRegularization
impl Debug for UnbalancedRegularization
Source§impl PartialEq for UnbalancedRegularization
impl PartialEq for UnbalancedRegularization
impl StructuralPartialEq for UnbalancedRegularization
Auto Trait Implementations§
impl Freeze for UnbalancedRegularization
impl RefUnwindSafe for UnbalancedRegularization
impl Send for UnbalancedRegularization
impl Sync for UnbalancedRegularization
impl Unpin for UnbalancedRegularization
impl UnsafeUnpin for UnbalancedRegularization
impl UnwindSafe for UnbalancedRegularization
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.