pub struct MultiTaskCoordinator<T: Float + Debug + Send + Sync + 'static> { /* private fields */ }Expand description
Multi-task coordinator.
Trains one shared parameter vector on all tasks at once, combining the
per-task gradients according to TaskWeightingStrategy and
GradientBalancingMethod, and measures the real gradient interference
between tasks.
Implementations§
Source§impl<T: Float + Debug + Send + Sync + 'static + Default + Clone + Sum + ScalarOperand> MultiTaskCoordinator<T>
impl<T: Float + Debug + Send + Sync + 'static + Default + Clone + Sum + ScalarOperand> MultiTaskCoordinator<T>
pub fn new(settings: &MultiTaskSettings) -> Result<Self>
Sourcepub fn with_steps(self, steps: usize) -> Result<Self>
pub fn with_steps(self, steps: usize) -> Result<Self>
Override the number of joint gradient steps.
pub fn learn_simultaneously( &mut self, tasks: &[MetaTask<T>], meta_parameters: &mut HashMap<String, Array1<T>>, ) -> Result<MultiTaskResult<T>>
Sourcepub fn interference_measure(&self) -> T
pub fn interference_measure(&self) -> T
Gradient interference measured by the most recent call, in [0, 1].
Zero before any multi-task step has run.
Auto Trait Implementations§
impl<T> Freeze for MultiTaskCoordinator<T>where
T: Freeze,
impl<T> RefUnwindSafe for MultiTaskCoordinator<T>where
T: RefUnwindSafe,
impl<T> Send for MultiTaskCoordinator<T>
impl<T> Sync for MultiTaskCoordinator<T>
impl<T> Unpin for MultiTaskCoordinator<T>where
T: Unpin,
impl<T> UnsafeUnpin for MultiTaskCoordinator<T>where
T: UnsafeUnpin,
impl<T> UnwindSafe for MultiTaskCoordinator<T>where
T: 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> 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.