pub struct PerturbedOptimizer<F>{ /* private fields */ }Expand description
A differentiable wrapper around any black-box combinatorial optimizer.
Wraps a function optimizer: θ → y*(θ) and computes a smooth
approximation E[y*(θ + σZ)] via Monte Carlo.
§Type Parameter
F– function type for the combinatorial optimizer, mapping&[f64]toVec<f64>.
Implementations§
Source§impl<F> PerturbedOptimizer<F>
impl<F> PerturbedOptimizer<F>
Sourcepub fn with_config(optimizer: F, config: PerturbedOptimizerConfig) -> Self
pub fn with_config(optimizer: F, config: PerturbedOptimizerConfig) -> Self
Create a new perturbed optimizer with custom configuration.
Sourcepub fn gradient(&self, theta: &[f64], dl_dy: &[f64]) -> OptimizeResult<Vec<f64>>
pub fn gradient(&self, theta: &[f64], dl_dy: &[f64]) -> OptimizeResult<Vec<f64>>
Gradient estimate via reparameterized covariance:
grad_theta L ~ (1/sigma) Cov[y*(theta + sigma*Z), Z] * dL/dy
= (1/sigma^2*N) Sum_k (y_k - y_mean) * Z_k * dL/dy
This is an unbiased estimator when y* is the gradient of a linear function, and has lower variance than REINFORCE.
§Arguments
theta– parameter vector (length d).dl_dy– upstream gradient dL/dŷ (length = optimizer output length).
§Returns
Gradient estimate ∇_θ L (length d).
Sourcepub fn reinforce_gradient(
&self,
theta: &[f64],
dl_dy: &[f64],
) -> OptimizeResult<Vec<f64>>
pub fn reinforce_gradient( &self, theta: &[f64], dl_dy: &[f64], ) -> OptimizeResult<Vec<f64>>
REINFORCE (score-function) gradient estimator:
∇_θ L ≈ (1/σN) Σ_k L(y_k) Z_k
where L(y_k) = dL/dy · y_k (linear approximation to the loss).
§Arguments
theta– parameter vector.dl_dy– upstream gradient (defines the loss as L = dl_dy · y).
Sourcepub fn last_mean_output(&self) -> Option<Vec<f64>>
pub fn last_mean_output(&self) -> Option<Vec<f64>>
Access the cached mean output from the last forward pass.
Auto Trait Implementations§
impl<F> Freeze for PerturbedOptimizer<F>where
F: Freeze,
impl<F> RefUnwindSafe for PerturbedOptimizer<F>where
F: RefUnwindSafe,
impl<F> Send for PerturbedOptimizer<F>where
F: Send,
impl<F> Sync for PerturbedOptimizer<F>where
F: Sync,
impl<F> Unpin for PerturbedOptimizer<F>where
F: Unpin,
impl<F> UnsafeUnpin for PerturbedOptimizer<F>where
F: UnsafeUnpin,
impl<F> UnwindSafe for PerturbedOptimizer<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
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.