2018
DOI: 10.5802/smai-jcm.29
|View full text |Cite
|
Sign up to set email alerts
|

Some Remarks on Preconditioning Molecular Dynamics

Abstract: We consider a Preconditioned Overdamped Langevin algorithm that does not alter the invariant distribution (up to controllable discretisation errors) and ask whether preconditioning improves the standard model in terms of reducing the asymptotic variance and of accelerating convergence to equilibrium. We present a detailed study of the dependence of the asymptotic variance on preconditioning in some elementary toy models related to molecular simulation. Our theoretical results are supported by numerical simulat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…2) and the nonreversible Langevin samplers [20,21]. As a particular example of the general framework that was introduced in [18], we mention the preconditioned overdamped Langevin dynamics dX t = −P∇V (X t ) dt + √ 2P dW t , that was presented in [4]. There, the long-time behaviour of as well as the asymptotic variance of the corresponding estimator π T ( f ) are studied and applied to equilibrium sampling in molecular dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…2) and the nonreversible Langevin samplers [20,21]. As a particular example of the general framework that was introduced in [18], we mention the preconditioned overdamped Langevin dynamics dX t = −P∇V (X t ) dt + √ 2P dW t , that was presented in [4]. There, the long-time behaviour of as well as the asymptotic variance of the corresponding estimator π T ( f ) are studied and applied to equilibrium sampling in molecular dynamics.…”
Section: Introductionmentioning
confidence: 99%
“…To do this, there is a variety of techniques based on Monte Carlo methods [ 35 ] and corresponding multilevel approaches. [ 36 ] A particularly prominent variant is the so‐called Langevin sampler, [ 37,38 ] or its pre‐conditioned or underdamped versions, [ 39,40 ] that generates a sequence of parameter points (θ1,,θn) according to the following iterative scheme: In each step, one first computes the proposal θk+1 for the next parameter point via trueθk+1=θkΔtgradSXfalse(θkfalse)+2Δtrkwhere rj is a random number generated from the standard m‐dimensional normal distribution with mean 0 and variance 1, Δt some sufficiently small stepsize, and gradSX the gradient of the function SX from Equation (37). Next, one determines the acceptance probability α according to the Metropolis–Hastings algorithm [ 41 ] : α=min1,0.28emeSXfalse(θk+1false)eSXfalse(θkfalse)qfalse(θk,θk+1false)qfalse(θk+1,θkfalse)with …”
Section: Parameter Estimationmentioning
confidence: 99%
“…To do this, there is a variety of techniques based on Monte Carlo methods [35] and corresponding multilevel approaches. [36] A particularly prominent variant is the so-called Langevin sampler, [37,38] or its pre-conditioned or underdamped versions, [39,40] that generates a sequence of parameter points (𝜃 1 , … , 𝜃 n ) according to the following iterative scheme: In each step, one first computes the proposal θk+1 for the next parameter point via…”
Section: Computing the Posterior And Related Expectation Valuesmentioning
confidence: 99%