Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2501.17979 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915759219802112 |
|---|---|
| author | Lelièvre, Tony Lin, Xuyang Monmarché, Pierre |
| author_facet | Lelièvre, Tony Lin, Xuyang Monmarché, Pierre |
| contents | Free-energy-based adaptive biasing methods, such as Metadynamics, the Adaptive Biasing Force (ABF) and their variants, are enhanced sampling algorithms widely used in molecular simulations. Although their efficiency has been empirically acknowledged for decades, providing theoretical insights via a quantitative convergence analysis is a difficult problem, in particular for the kinetic Langevin diffusion, which is non-reversible and hypocoercive. We obtain the first exponential convergence result for such a process, in an idealized setting where the dynamics can be associated with a mean-field non-linear flow on the space of probability measures. A key of the analysis is the interpretation of the (idealized) algorithm as the gradient descent of a suitable functional over the space of probability distributions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_17979 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Convergence rates for an Adaptive Biasing Potential scheme from a Wasserstein optimization perspective Lelièvre, Tony Lin, Xuyang Monmarché, Pierre Probability Free-energy-based adaptive biasing methods, such as Metadynamics, the Adaptive Biasing Force (ABF) and their variants, are enhanced sampling algorithms widely used in molecular simulations. Although their efficiency has been empirically acknowledged for decades, providing theoretical insights via a quantitative convergence analysis is a difficult problem, in particular for the kinetic Langevin diffusion, which is non-reversible and hypocoercive. We obtain the first exponential convergence result for such a process, in an idealized setting where the dynamics can be associated with a mean-field non-linear flow on the space of probability measures. A key of the analysis is the interpretation of the (idealized) algorithm as the gradient descent of a suitable functional over the space of probability distributions. |
| title | Convergence rates for an Adaptive Biasing Potential scheme from a Wasserstein optimization perspective |
| topic | Probability |
| url | https://arxiv.org/abs/2501.17979 |