pith. sign in

arxiv: 1305.2982 · v1 · pith:FT3W22ZBnew · submitted 2013-05-14 · 💻 cs.LG

Estimating or Propagating Gradients Through Stochastic Neurons

classification 💻 cs.LG
keywords estimatorgradientstochasticneuronsunbiasedgradientslearningrespect
0
0 comments X
read the original abstract

Stochastic neurons can be useful for a number of reasons in deep learning models, but in many cases they pose a challenging problem: how to estimate the gradient of a loss function with respect to the input of such stochastic neurons, i.e., can we "back-propagate" through these stochastic neurons? We examine this question, existing approaches, and present two novel families of solutions, applicable in different settings. In particular, it is demonstrated that a simple biologically plausible formula gives rise to an an unbiased (but noisy) estimator of the gradient with respect to a binary stochastic neuron firing probability. Unlike other estimators which view the noise as a small perturbation in order to estimate gradients by finite differences, this estimator is unbiased even without assuming that the stochastic perturbation is small. This estimator is also interesting because it can be applied in very general settings which do not allow gradient back-propagation, including the estimation of the gradient with respect to future rewards, as required in reinforcement learning setups. We also propose an approach to approximating this unbiased but high-variance estimator by learning to predict it using a biased estimator. The second approach we propose assumes that an estimator of the gradient can be back-propagated and it provides an unbiased estimator of the gradient, but can only work with non-linearities unlike the hard threshold, but like the rectifier, that are not flat for all of their range. This is similar to traditional sigmoidal units but has the advantage that for many inputs, a hard decision (e.g., a 0 output) can be produced, which would be convenient for conditional computation and achieving sparse representations and sparse gradients.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Learning Latent Trees with Stochastic Perturbations and Differentiable Dynamic Programming

    cs.CL 2019-06 unverdicted novelty 7.0

    A fully differentiable parser that stochastically samples projective dependency trees using Gumbel perturbations and dynamic programming to boost downstream task performance without direct supervision.

  2. Learning to Look Benign: Targeted Evasion of Malware Detectors via API Import Injection

    cs.CR 2026-05 unverdicted novelty 6.0

    A strictly additive CVAE framework injects 20 API imports to reduce malware recall from 87.5% to 30% while routing 99% of evaded samples into a pre-selected benign category, with transfer shown on VirusTotal.