Reparameterization Gradient for Non-differentiable Models
Not on the map. Why?
Abstract (arXiv)
We present a new algorithm for stochastic variational inference that targets at models with non-differentiable densities. One of the key challenges in stochastic variational inference is to come up with a low-variance estimator of the gradient of a variational objective. We tackle the challenge by generalizing the reparameterization trick, one of the most effective techniques for addressing the variance issue for differentiable models, so that the trick works for non-differentiable models as well. Our algorithm splits the space of latent variables into regions where the density of the variables is differentiable, and their boundaries where the density may fail to be differentiable. For each differentiable region, the algorithm applies the standard reparameterization trick and estimates the gradient restricted to the region. For each potentially non-differentiable boundary, it uses a form of manifold sampling and computes the direction for variational parameters that, if followed, would increase the boundary's contribution to the variational objective. The sum of all the estimates becomes the gradient estimate of our algorithm. Our estimator enjoys the reduced variance of the reparameterization gradient while remaining unbiased even for non-differentiable models. The experiments with our preliminary implementation confirm the benefit of reduced variance and unbiasedness.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 5; 2024: 3; 2025: 0; 2026: 1.
11 papers.
- 2021A unified view of likelihood ratio and reparameterization gradientscited by 12
- 2021Model-free Policy Learning with Reward Gradientscited by 9
- 2023Zero Grads: Learning Local Surrogate Losses for Non-Differentiable Graphicscited by 5
- 2024Probabilistic Programming with Programmable Variational Inferencecited by 4
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothingcited by 2
- 2023Revisiting the Gumbel-Softmax in MADDPGcited by 2
- 2023Rethinking Variational Inference for Probabilistic Programs with Stochastic Supportcited by 2
- 2024Safe Reinforcement Learning using Finite-Horizon Gradient-based Estimationcited by 2
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programscited by 1
- 2024Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothingcited by 0
- 2026Does "Do Differentiable Simulators Give Better Policy Gradients?'' Give Better Policy Gradients?cited by 0
- 2026Does "Do Differentiable Simulators Give Better Policy Gradients?'' Give Better Policy Gradients?20 Apr 2026
- 2024Safe Reinforcement Learning using Finite-Horizon Gradient-based Estimation15 Dec 2024
- 2024Probabilistic Programming with Programmable Variational Inference22 Jun 2024
- 2024Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothing19 Feb 2024
- 2023Rethinking Variational Inference for Probabilistic Programs with Stochastic Support1 Nov 2023
- 2023Zero Grads: Learning Local Surrogate Losses for Non-Differentiable Graphics10 Aug 2023
- 2023Revisiting the Gumbel-Softmax in MADDPG23 Feb 2023
- 2023ωPAP Spaces: Reasoning Denotationally About Higher-Order, Recursive Probabilistic and Differentiable Programs21 Feb 2023
- 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothing9 Jan 2023
- 2021A unified view of likelihood ratio and reparameterization gradients31 May 2021
- 2021Model-free Policy Learning with Reward Gradients9 Mar 2021