Skip to main content

PerturbedOptimizer

Struct PerturbedOptimizer 

Source
pub struct PerturbedOptimizer<F>
where F: Fn(&[f64]) -> Vec<f64>,
{ /* 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] to Vec<f64>.

Implementations§

Source§

impl<F> PerturbedOptimizer<F>
where F: Fn(&[f64]) -> Vec<f64>,

Source

pub fn new(optimizer: F) -> Self

Create a new perturbed optimizer with default configuration.

Source

pub fn with_config(optimizer: F, config: PerturbedOptimizerConfig) -> Self

Create a new perturbed optimizer with custom configuration.

Source

pub fn forward(&mut self, theta: &[f64]) -> OptimizeResult<Vec<f64>>

Forward pass: compute E[y*(θ + σZ)] via Monte Carlo.

Samples n_samples perturbations Z_k ~ N(0, I) and returns the sample mean of the optimizer outputs.

§Arguments
  • theta – parameter vector (length d).
§Returns

Expected optimizer output ŷ(θ) (length equal to optimizer output).

Source

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).

Source

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).
Source

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> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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 more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> Ungil for T
where T: Send,