Beyond ReinMax: Low-Variance Gradient Estimators for Discrete Latent Variables
Not on the map. Why?
Abstract (arXiv)
Machine learning models involving discrete latent variables require gradient estimators to facilitate backpropagation in a computationally efficient manner. The most recent addition to the Straight-Through family of estimators, ReinMax, can be viewed from a numerical ODE perspective as incorporating an approximation via Heun's method to reduce bias, but at the cost of high variance. In this work, we introduce the ReinMax-Rao and ReinMax-CV estimators which incorporate Rao-Blackwellisation and control variate techniques into ReinMax to reduce its variance. Our estimators demonstrate superior performance on training variational autoencoders with discrete latent spaces. Furthermore, we investigate the possibility of leveraging alternative numerical methods for constructing more accurate gradient approximations and present an alternative view of ReinMax from a simpler numerical integration perspective.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 15 references that are in the map. First posted on arXiv 9 Mar 2026.
Builds on
9 of 15 references.
References · 9
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 763
- 2014A* Samplingcited by 150
- 2017REBAR: Low-variance, unbiased gradient estimates for discrete latent variable modelscited by 78
- 2020Rao-Blackwellizing the Straight-Through Gumbel-Softmax Gradient Estimatorcited by 37
- 2023Bridging Discrete and Backpropagation: Straight-Through and Beyondcited by 31
- 2022Training Discrete Deep Generative Models via Gapped Straight-Through Estimatorcited by 8
Built on by
Not cited yet.