mlsanityData to 14 Oct 2026

DBsurf: A Discrepancy Based Method for Discrete Stochastic Gradient Estimation

arXiv 2309.03974 ↗First posted 7 Sep 2023cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Computing gradients of an expectation with respect to the distributional parameters of a discrete distribution is a problem arising in many fields of science and engineering. Typically, this problem is tackled using Reinforce, which frames the problem of gradient estimation as a Monte Carlo simulation. Unfortunately, the Reinforce estimator is especially sensitive to discrepancies between the true probability distribution and the drawn samples, a common issue in low sampling regimes that results in inaccurate gradient estimates. In this paper, we introduce DBsurf, a reinforce-based estimator for discrete distributions that uses a novel sampling procedure to reduce the discrepancy between the samples and the actual distribution. To assess the performance of our estimator, we subject it to a diverse set of tasks. Among existing estimators, DBsurf attains the lowest variance in a least squares problem commonly used in the literature for benchmarking. Furthermore, DBsurf achieves the best results for training variational auto-encoders (VAE) across different datasets and sampling setups. Finally, we apply DBsurf to build a simple and efficient Neural Architecture Search (NAS) algorithm with state-of-the-art performance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 39 references that are in the map. First posted on arXiv 7 Sep 2023.

Builds on

24 of 39 references.

References · 24

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2013Auto-Encoding Variational Bayescited by 4,053
  4. 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
  5. 2018DARTS: Differentiable Architecture Searchcited by 1,798
  6. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  7. 2018Efficient Neural Architecture Search via Parameter Sharingcited by 837
  8. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 673
  9. 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 416
  10. 2018SNAS: Stochastic Neural Architecture Searchcited by 289
  11. 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
  12. 2019PC-DARTS: Partial Channel Connections for Memory-Efficient Architecture Searchcited by 265
12 more
  1. 2019Searching for A Robust Neural Architecture in Four GPU Hourscited by 260
  2. 2018Implicit Reparameterization Gradientscited by 85
  3. 2017REBAR: Low-variance, unbiased gradient estimates for discrete latent variable modelscited by 79
  4. 2020DSNAS: Direct Neural Architecture Search without Parameter Retrainingcited by 69
  5. 2020Few-shot Neural Architecture Searchcited by 50
  6. 2020Estimating Gradients for Discrete Random Variables by Sampling without Replacementcited by 31
  7. 2016The Generalized Reparameterization Gradientcited by 30
  8. 2020DisARM: An Antithetic Gradient Estimator for Binary Latent Variablescited by 28
  9. 2022Generalizing Few-Shot NAS with Gradient Matchingcited by 25
  10. 2022Gradient Estimation with Discrete Stein Operatorscited by 23
  11. 2021ARMS: Antithetic-REINFORCE-Multi-Sample Gradient for Binary Variablescited by 9
  12. 2021Double Control Variates for Gradient Estimation in Discrete Latent Variable Modelscited by 9

Built on by

Not cited yet.