pub struct TaskBatch<A: Float + ScalarOperand + Debug> {
pub initial_params: Array<A, IxDyn>,
pub inner_gradients: Vec<Array<A, IxDyn>>,
pub final_loss_grad: Array<A, IxDyn>,
}Expand description
Per-task data used by the meta-update.
For each task T_i the caller supplies:
initial_params– the meta-parametersthetaat the start of the inner loop (theta_i^{(0)}).inner_gradients– the gradientsg_0, g_1, ..., g_{K-1}evaluated at each inner iteratetheta_i^{(0)}, ..., theta_i^{(K-1)}. The length of this vector must be at least 1 and matches the number of inner steps.final_loss_grad– the gradient of the meta-loss evaluated at the adapted parameterstheta_i^{(K)}(sometimes denoted∂L/∂theta').
All arrays must share the same shape; mismatches surface as
OptimError::InvalidParameter.
Fields§
§initial_params: Array<A, IxDyn>Parameters at the start of the inner loop (theta_i^{(0)}).
inner_gradients: Vec<Array<A, IxDyn>>Sequence of gradients along the inner trajectory.
final_loss_grad: Array<A, IxDyn>Gradient of the meta-loss at the adapted parameters.
Trait Implementations§
Auto Trait Implementations§
impl<A> Freeze for TaskBatch<A>
impl<A> RefUnwindSafe for TaskBatch<A>where
A: RefUnwindSafe,
impl<A> Send for TaskBatch<A>where
A: Send,
impl<A> Sync for TaskBatch<A>where
A: Sync,
impl<A> Unpin for TaskBatch<A>
impl<A> UnsafeUnpin for TaskBatch<A>
impl<A> UnwindSafe for TaskBatch<A>where
A: 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
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> 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.