mlsanityData to 14 Oct 2026

Dale meets Langevin: A Multiplicative Denoising Diffusion Model

arXiv 2510.02730 ↗First posted 3 Oct 2025cs.LG cs.CVcited by 2

On the map: Diffusion models → Diffusion foundations and sampling

Abstract (arXiv)

Exponentiated gradient descent (EGD), a biologically motivated optimisation algorithm that respects Dale's law, produces log-normally distributed synaptic weights at convergence, in alignment with experimental observations in neuroscience. Since the marginal distribution of geometric Brownian motion (GBM) at any fixed time is log-normal, this convergence property reveals a natural connection between EGD and GBM-based stochastic processes. We propose a multiplicative score-based generative model with GBM as a forward noising process and derive its corresponding reverse-time SDE in both the ambient space and in the log-transformed space. We derive two multiplicative samplers by discretising the corresponding reverse-time SDEs: a sign-agnostic sampler obtained directly from the ambient-space reverse-time SDE, and a sign-preserving sampler, which we refer to as the Dale-Langevin sampler, obtained via the Lamperti transform. We connect the framework to Mirrored Langevin Dynamics, showing that the convex function driving EGD in optimisation precisely governs the Dale-Langevin sampler. While the standard Stein score, defined as nabla log p_boldsymbolX(boldsymbolx) for a random vector boldsymbolX evaluated at boldsymbolx, comes up naturally in the additive noise based diffusion models, in the multiplicative setting, we encounter a modified version of the Stein score for sampling, which we refer to as the it Hyv"arinen score: boldsymbolx circ nabla log p_boldsymbolX(boldsymbolx). To estimate the score, we propose a new multiplicative denoising score-matching objective (M-DSM), prove its equivalence to the multiplicative explicit score-matching loss and show that it subsumes the non-negative score matching loss. Experimental results on MNIST, Fashion-MNIST, Kuzushiji-MNIST, and CIFAR-10 to validate the generative capability of the proposed framework.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 37 of its 77 references that are in the map. First posted on arXiv 3 Oct 2025.

Builds on

37 of 77 references.

Closest ancestors · 9

Same direction, newest first

  1. 2023Blackout Diffusion: Generative Diffusion Models in Discrete-State Spaces18 May
  2. 2023Diffusion Models for Constrained Domains11 Apr
  3. 2022Cold Diffusion: Inverting Arbitrary Image Transforms Without Noise19 Aug
  4. 2021Denoising Diffusion Gamma Models10 Oct
  5. 2021Diffusion Models Beat GANs on Image Synthesis11 May
  6. 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
  7. 2020Denoising Diffusion Implicit Models6 Oct
  8. 2020Denoising Diffusion Probabilistic Models19 Jun
  9. 2020Improved Techniques for Training Score-Based Generative Models16 Jun

Other references · 28

  1. 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
  2. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  3. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  5. 2014Going Deeper with Convolutionscited by 4,241
  6. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
  7. 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
  8. 2022Video Diffusion Modelscited by 2,305
  9. 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,323
  10. 2018Demystifying MMD GANscited by 1,293
  11. 2020Training Generative Adversarial Networks with Limited Datacited by 1,186
  12. 2021Alias-Free Generative Adversarial Networkscited by 1,184
16 more
  1. 2014Convex Optimization: Algorithms and Complexitycited by 575
  2. 2018Deep Learning for Classical Japanese Literaturecited by 422
  3. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
  4. 2022Generative Modelling With Inverse Heat Dissipationcited by 167
  5. 2015A Simple Way to Initialize Recurrent Networks of Rectified Linear Unitscited by 130
  6. 2018Sampling as optimization in the space of measures: The Langevin dynamics as a composite optimization problemcited by 123
  7. 2018Assessing the Scalability of Biologically-Motivated Deep Learning Algorithms and Architecturescited by 101
  8. 2018Mirrored Langevin Dynamicscited by 61
  9. 2022Normalizing flow neural networks by JKO schemecited by 39
  10. 2019Estimating Density Models with Truncation Boundaries using Score Matchingcited by 20
  11. 2024Investigating Training Objectives for Generative Speech Enhancementcited by 20
  12. 2023Learning to Jump: Thinning and Thickening Latent Counts for Generative Modelingcited by 18
  13. 2020Deep Learning Methods For Synthetic Aperture Radar Image Despeckling: An Overview Of Trends And Perspectivescited by 13
  14. 2022Winning the lottery with neural connectivity constraints: faster learning across cognitive tasks with spatially constrained sparse RNNscited by 10
  15. 2023Synaptic Weight Distributions Depend on the Geometry of Plasticitycited by 4
  16. 2024Perception-based multiplicative noise removal using SDEscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2021Score-Based Generative Modeling with Critically-Damped Langevin Diffusion
  2. 2026A Stochastic Analysis Perspective on Diffusion Models
  3. 2025Diffusion Models: A Mathematical Introduction
  4. 2026Rethinking the Diffusion Model from a Langevin Perspective
  5. 2025A Unified Approach to Analysis and Design of Denoising Markov Models
  6. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptions
  7. 2026Gradient-Free Sampling from Generative Models via Stochastic Bounded Extremum Seeking
  8. 2026Diffusion Removes Langevin's Conditioning Dependence: A Sharp Gaussian Analysis