REVIEW 2 cited by
Optimizing the diffusion coefficient of overdamped Langevin dynamics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Overdamped Langevin dynamics are reversible stochastic differential equations which are commonly used to sample probability measures in high-dimensional spaces, such as the ones appearing in computational statistical physics and Bayesian inference. By varying the diffusion coefficient, there are in fact infinitely many overdamped Langevin dynamics which are reversible with respect to the target probability measure at hand. This suggests to optimize the diffusion coefficient in order to increase the convergence rate of the dynamics, as measured by the spectral gap of the generator associated with the stochastic differential equation. We analytically study this problem here, obtaining in particular necessary conditions on the optimal diffusion coefficient. We also derive an explicit expression of the optimal diffusion in some appropriate homogenized limit. Numerical results, both relying on discretizations of the spectral gap problem and Monte Carlo simulations of the stochastic dynamics, demonstrate the increased quality of the sampling arising from an appropriate choice of the diffusion coefficient.
Forward citations
Cited by 2 Pith papers
-
Efficient Langevin sampling with position-dependent diffusion
A new integrator, PVD-2, samples the equilibrium distribution of Brownian dynamics with position-dependent diffusion to second order using only one force evaluation per step.
-
Sampling with time-changed Markov processes
A unified framework for time-changed Markov processes shows how to accelerate MCMC convergence while preserving the target distribution, unifying several known algorithms.
Discussion (0). Continue with ORCID to comment.