ARSM: Augment-REINFORCE-Swap-Merge Estimator for Gradient Backpropagation Through Categorical Variables
Not on the map. Why?
Abstract (arXiv)
To address the challenge of backpropagating the gradient through categorical variables, we propose the augment-REINFORCE-swap-merge (ARSM) gradient estimator that is unbiased and has low variance. ARSM first uses variable augmentation, REINFORCE, and Rao-Blackwellization to re-express the gradient as an expectation under the Dirichlet distribution, then uses variable swapping to construct differently expressed but equivalent expectations, and finally shares common random numbers between these expectations to achieve significant variance reduction. Experimental results show ARSM closely resembles the performance of the true gradient for optimization in univariate settings; outperforms existing estimators by a large margin when applied to categorical variational auto-encoders; and provides a "try-and-see self-critic" variance reduction method for discrete-action policy gradient, which removes the need of estimating baselines by generating a random number of pseudo actions and estimating their action-value functions.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 May 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
10 papers.
- 2021A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learningcited by 82
- 2022Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterizationcited by 35
- 2023Fantastic Rewards and How to Tame Them: A Case Study on Reward Learning for Task-oriented Dialogue Systemscited by 19
- 2023Differentiable Sampling of Categorical Distributions Using the CatLog-Derivative Trickcited by 13
- 2021Storchastic: A Framework for General Stochastic Automatic Differentiationcited by 11
- 2021Coupled Gradient Estimators for Discrete Latent Variablescited by 9
- 2021ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variablescited by 8
- 2022Gradient Estimation for Binary Latent Variables via Gradient Variance Clippingcited by 7
- 2021CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimatorcited by 4
- 2026Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Inputcited by 0
- 2026Accelerating Evolutionary Strategy via Rao-Blackwellizing Realization of Uncertain Input3 Aug 2026
- 2023Differentiable Sampling of Categorical Distributions Using the CatLog-Derivative Trick21 Nov 2023
- 2023Fantastic Rewards and How to Tame Them: A Case Study on Reward Learning for Task-oriented Dialogue Systems20 Feb 2023
- 2022Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization18 Oct 2022
- 2022Gradient Estimation for Binary Latent Variables via Gradient Variance Clipping12 Aug 2022
- 2021CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimator26 Oct 2021
- 2021A Review of the Gumbel-max Trick and its Extensions for Discrete Stochasticity in Machine Learning4 Oct 2021
- 2021Coupled Gradient Estimators for Discrete Latent Variables15 Jun 2021
- 2021ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variables28 May 2021
- 2021Storchastic: A Framework for General Stochastic Automatic Differentiation1 Apr 2021