pub struct PerturbedOptimizer { /* private fields */ }Expand description
Differentiable argmax via additive Gaussian perturbations.
Estimates E_Z[argmax(θ + ε·Z)] where Z ~ N(0, I). The forward pass
returns soft assignment probabilities; the backward pass returns an
unbiased gradient estimate via the score-function estimator.
Implementations§
Source§impl PerturbedOptimizer
impl PerturbedOptimizer
Sourcepub fn new(config: PerturbedOptimizerConfig) -> Self
pub fn new(config: PerturbedOptimizerConfig) -> Self
Create a new perturbed optimizer with the given configuration.
Sourcepub fn forward<F>(&self, scores: &[F]) -> OptimizeResult<Vec<F>>
pub fn forward<F>(&self, scores: &[F]) -> OptimizeResult<Vec<F>>
Forward pass: estimate E[argmax(θ + εZ)] via Monte Carlo.
Returns a probability vector of length scores.len().
Sourcepub fn backward<F>(
&self,
scores: &[F],
upstream: &[F],
) -> OptimizeResult<Vec<F>>
pub fn backward<F>( &self, scores: &[F], upstream: &[F], ) -> OptimizeResult<Vec<F>>
Backward pass: gradient estimate via score-function / log-derivative trick.
§Formula
dL/dθ ≈ (1 / (ε² · n)) Σ_i [<argmax(θ+εZ_i), upstream>] · Z_i§Arguments
scores– original (unperturbed) scores.upstream– upstream gradient ∂L/∂p (same shape asforwardoutput).
§Returns
Gradient ∂L/∂θ of the same length as scores.
Trait Implementations§
Source§impl Clone for PerturbedOptimizer
impl Clone for PerturbedOptimizer
Source§fn clone(&self) -> PerturbedOptimizer
fn clone(&self) -> PerturbedOptimizer
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 moreAuto Trait Implementations§
impl Freeze for PerturbedOptimizer
impl RefUnwindSafe for PerturbedOptimizer
impl Send for PerturbedOptimizer
impl Sync for PerturbedOptimizer
impl Unpin for PerturbedOptimizer
impl UnsafeUnpin for PerturbedOptimizer
impl UnwindSafe for PerturbedOptimizer
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.