Introduction
Variational Inference (VI) is a fundamental tool in Bayesian machine learning, yet it frequently struggles to approximate complex, multi-modal distributions. Recent advancements have integrated Markov Chain Monte Carlo (MCMC) kernels—specifically Langevin transitions—to refine simple initial distributions. However, the landscape of Langevin-based VI has remained fragmented, with methods like Unadjusted Langevin Algorithm (ULA), Unadjusted Hamiltonian Annealing (UHA), and Monte Carlo Diffusion (MCD) derived from disparate mathematical foundations.
This paper introduces Langevin Diffusion Variational Inference (LDVI), a unified framework that bridges these gaps. By simulating underdamped Langevin diffusion and its time reversal, LDVI combines the rapid convergence of momentum-based dynamics with learnable score-based augmentations to consistently outperform previous baselines.
A Unified Framework via SDEs
The authors provide a cohesive analysis based on Stochastic Differential Equations (SDEs). They model the transition from a simple prior to a complex target as a forward underdamped Langevin diffusion process. The framework consists of three key components:
- Forward/Backward SDEs: Defining the path toward the target and its corresponding time-reversed process.
- Score Network Approximation: The time-reversed SDE involves an intractable "score" term (the gradient of the log-density), which LDVI approximates using a learnable neural network, $s(t, z, \rho)$.
- Numerical Splitting Schemes: Instead of standard Euler-Maruyama discretization, the authors employ "splitting methods" (akin to leapfrog integrators in physics) to ensure tractable transition ratios, which is essential for calculating the Evidence Lower Bound (ELBO).
By adjusting parameters such as friction ($\gamma$) or the score network, the authors demonstrate that ULA, UHA, and MCD are all special cases of this unified model. This unification simplifies the path to innovation, leading directly to the LDVI algorithm.
Experimental Results
The framework was evaluated across several benchmarks, including logistic regression (Ionosphere, Sonar), time-series models (Brownian motion, Lorenz system), and hierarchical models (Seeds). LDVI consistently achieved the highest ELBO across all tasks and chain lengths ($K$).
As shown in the results for the Sonar dataset, LDVI at $K=64$ achieves an ELBO of -109.7, significantly outperforming ULA (-115.3) and the previous state-of-the-art MCD (-111.1). This efficiency allows LDVI to reach superior solutions with fewer steps than simpler methods require with much longer chains; for instance, LDVI with $K=64$ often beats MCD with $K=256$.
The Impact of Discretization
A key insight of the paper is that the numerical simulation scheme is as critical as the underlying dynamics. The authors compared their proposed splitting schemes against the common Euler-Maruyama (EM) discretization.
The results indicate that using a splitting scheme yields significantly better ELBO values than EM, even when the underlying SDE remains identical. This highlights that discretization is a "first-class citizen" in the design of diffusion-based VI algorithms.
Conclusion and Future Work
LDVI represents a significant step forward in unifying Langevin-based inference methods. By leveraging momentum and learned score functions, it provides a powerful and flexible tool for Bayesian inference. While the computational cost of training score networks adds overhead, the gains in sample efficiency and approximation quality are substantial. Future work will focus on automating hyperparameter tuning for friction and step sizes, as well as scaling these methods to the high-dimensional spaces typical of deep generative models.
Summary updated