English

Estimating Gradients for Discrete Random Variables by Sampling without Replacement

Machine Learning 2020-02-17 v1 Machine Learning

Abstract

We derive an unbiased estimator for expectations over discrete random variables based on sampling without replacement, which reduces variance as it avoids duplicate samples. We show that our estimator can be derived as the Rao-Blackwellization of three different estimators. Combining our estimator with REINFORCE, we obtain a policy gradient estimator and we reduce its variance using a built-in control variate which is obtained without additional model evaluations. The resulting estimator is closely related to other gradient estimators. Experiments with a toy problem, a categorical Variational Auto-Encoder and a structured prediction problem show that our estimator is the only estimator that is consistently among the best estimators in both high and low entropy settings.

Keywords

Cite

@article{arxiv.2002.06043,
  title  = {Estimating Gradients for Discrete Random Variables by Sampling without Replacement},
  author = {Wouter Kool and Herke van Hoof and Max Welling},
  journal= {arXiv preprint arXiv:2002.06043},
  year   = {2020}
}

Comments

ICLR 2020

R2 v1 2026-06-23T13:41:59.028Z