# Reparameterization trick for discrete variables

arXiv: https://arxiv.org/abs/1611.01239 · HTML: https://mlsanity.com/paper/1611.01239/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Nov 2016.

## Built on by (most cited first, 3 of 3)

- [Natural Language-conditioned Reinforcement Learning with Inside-out Task Language Development and Translation](https://mlsanity.com/paper/2302.09368/) (2023)
- [Simulation-Based Prior Knowledge Elicitation for Parametric Bayesian Models](https://mlsanity.com/paper/2308.11672/) (2023)
- [Efficient Model Compression for Bayesian Neural Networks](https://mlsanity.com/paper/2411.00273/) (2024)

## Abstract (arXiv)

Low-variance gradient estimation is crucial for learning directed graphical models parameterized by neural networks, where the reparameterization trick is widely used for those with continuous variables. While this technique gives low-variance gradient estimates, it has not been directly applicable to discrete variables, the sampling of which inherently requires discontinuous operations. We argue that the discontinuity can be bypassed by marginalizing out the variable of interest, which results in a new reparameterization trick for discrete variables. This reparameterization greatly reduces the variance, which is understood by regarding the method as an application of common random numbers to the estimation. The resulting estimator is theoretically guaranteed to have a variance not larger than that of the likelihood-ratio method with the optimal input-dependent baseline. We give empirical results for variational learning of sigmoid belief networks.