English

Improved Gradient-Based Optimization Over Discrete Distributions

Machine Learning 2019-06-18 v3 Machine Learning

Abstract

In many applications we seek to maximize an expectation with respect to a distribution over discrete variables. Estimating gradients of such objectives with respect to the distribution parameters is a challenging problem. We analyze existing solutions including finite-difference (FD) estimators and continuous relaxation (CR) estimators in terms of bias and variance. We show that the commonly used Gumbel-Softmax estimator is biased and propose a simple method to reduce it. We also derive a simpler piece-wise linear continuous relaxation that also possesses reduced bias. We demonstrate empirically that reduced bias leads to a better performance in variational inference and on binary optimization tasks.

Keywords

Cite

@article{arxiv.1810.00116,
  title  = {Improved Gradient-Based Optimization Over Discrete Distributions},
  author = {Evgeny Andriyash and Arash Vahdat and Bill Macready},
  journal= {arXiv preprint arXiv:1810.00116},
  year   = {2019}
}
R2 v1 2026-06-23T04:22:46.184Z