mlsanityData to 7 Oct 2026

Diagonalisation SGD: Fast & Convergent SGD for Non-Differentiable Models via Reparameterisation and Smoothing

arXiv 2402.11752 ↗First posted 19 Feb 2024cs.LG cs.AI math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

It is well-known that the reparameterisation gradient estimator, which exhibits low variance in practice, is biased for non-differentiable models. This may compromise correctness of gradient-based optimisation methods such as stochastic gradient descent (SGD). We introduce a simple syntactic framework to define non-differentiable functions piecewisely and present a systematic approach to obtain smoothings for which the reparameterisation gradient estimator is unbiased. Our main contribution is a novel variant of SGD, Diagonalisation Stochastic Gradient Descent, which progressively enhances the accuracy of the smoothed approximation during optimisation, and we prove convergence to stationary points of the unsmoothed (original) objective. Our empirical evaluation reveals benefits over the state of the art: our approach is simple, fast, stable and attains orders of magnitude reduction in work-normalised variance.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 19 Feb 2024.

Builds on

19 of 48 references.

References · 19

  1. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
  2. 2016Variational Inference: A Review for Statisticianscited by 1,466
  3. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,135
  4. 2018Pyro: Deep Universal Probabilistic Programmingcited by 379
  5. 2013Black Box Variational Inferencecited by 317
  6. 2019Monte Carlo Gradient Estimation in Machine Learningcited by 281
  7. 2017Advances in Variational Inferencecited by 236
  8. 2015Gradient Estimation Using Stochastic Computation Graphscited by 120
  9. 2014Neural Variational Inference and Learning in Belief Networkscited by 116
  10. 2017REBAR: Low-variance, unbiased gradient estimates for discrete latent variable modelscited by 78
  11. 2018An Introduction to Probabilistic Programmingcited by 62
  12. 2018Variance reduction properties of the reparameterization trickcited by 41
7 more
  1. 2015On Graduated Optimization for Stochastic Non-Convex Problemscited by 34
  2. 2013Automated Variational Inference in Probabilistic Programmingcited by 31
  3. 2016The Generalized Reparameterization Gradientcited by 30
  4. 2018Reparameterization Gradient for Non-differentiable Modelscited by 11
  5. 2020Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywherecited by 6
  6. 2017Multilevel Monte Carlo Method for Statistical Model Checking of Hybrid Systemscited by 2
  7. 2023Fast and Correct Gradient-Based Optimisation for Probabilistic Programming via Smoothingcited by 2

Built on by

Not cited yet.