离散动能朗万动力学的收缩与收敛速率

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED
Benedict J. Leimkuhler, Daniel Paulin, Peter A. Whalley
{"title":"离散动能朗万动力学的收缩与收敛速率","authors":"Benedict J. Leimkuhler, Daniel Paulin, Peter A. Whalley","doi":"10.1137/23m1556289","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 3, Page 1226-1258, June 2024. <br/>Abstract. We provide a framework to analyze the convergence of discretized kinetic Langevin dynamics for [math]-[math]Lipschitz, [math]-convex potentials. Our approach gives convergence rates of [math], with explicit step size restrictions, which are of the same order as the stability threshold for Gaussian targets and are valid for a large interval of the friction parameter. We apply this methodology to various integration schemes which are popular in the molecular dynamics and machine learning communities. Further, we introduce the property “[math]-limit convergent” to characterize underdamped Langevin schemes that converge to overdamped dynamics in the high-friction limit and which have step size restrictions that are independent of the friction parameter; we show that this property is not generic by exhibiting methods from both the class and its complement. Finally, we provide asymptotic bias estimates for the BAOAB scheme, which remain accurate in the high-friction limit by comparison to a modified stochastic dynamics which preserves the invariant measure.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Contraction and Convergence Rates for Discretized Kinetic Langevin Dynamics\",\"authors\":\"Benedict J. Leimkuhler, Daniel Paulin, Peter A. Whalley\",\"doi\":\"10.1137/23m1556289\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Numerical Analysis, Volume 62, Issue 3, Page 1226-1258, June 2024. <br/>Abstract. We provide a framework to analyze the convergence of discretized kinetic Langevin dynamics for [math]-[math]Lipschitz, [math]-convex potentials. Our approach gives convergence rates of [math], with explicit step size restrictions, which are of the same order as the stability threshold for Gaussian targets and are valid for a large interval of the friction parameter. We apply this methodology to various integration schemes which are popular in the molecular dynamics and machine learning communities. Further, we introduce the property “[math]-limit convergent” to characterize underdamped Langevin schemes that converge to overdamped dynamics in the high-friction limit and which have step size restrictions that are independent of the friction parameter; we show that this property is not generic by exhibiting methods from both the class and its complement. Finally, we provide asymptotic bias estimates for the BAOAB scheme, which remain accurate in the high-friction limit by comparison to a modified stochastic dynamics which preserves the invariant measure.\",\"PeriodicalId\":49527,\"journal\":{\"name\":\"SIAM Journal on Numerical Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Journal on Numerical Analysis\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1137/23m1556289\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Numerical Analysis","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/23m1556289","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

SIAM 数值分析期刊》第 62 卷第 3 期第 1226-1258 页,2024 年 6 月。摘要。我们提供了一个框架,用于分析[math]-[math]Lipschitz、[math]-凸势能的离散动力学 Langevin 动力学的收敛性。我们的方法给出了[math]的收敛率,并有明确的步长限制,与高斯目标的稳定阈值同阶,且对摩擦参数的大区间有效。我们将这一方法应用于分子动力学和机器学习领域流行的各种积分方案。此外,我们还引入了"[math]-limit convergent "属性,以描述在高摩擦极限下收敛于过阻尼动力学的欠阻尼 Langevin 方案,这些方案的步长限制与摩擦参数无关。最后,我们提供了 BAOAB 方案的渐近偏差估计值,通过与保留不变度量的修正随机动力学进行比较,BAOAB 方案在高摩擦极限下仍然保持精确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Contraction and Convergence Rates for Discretized Kinetic Langevin Dynamics
SIAM Journal on Numerical Analysis, Volume 62, Issue 3, Page 1226-1258, June 2024.
Abstract. We provide a framework to analyze the convergence of discretized kinetic Langevin dynamics for [math]-[math]Lipschitz, [math]-convex potentials. Our approach gives convergence rates of [math], with explicit step size restrictions, which are of the same order as the stability threshold for Gaussian targets and are valid for a large interval of the friction parameter. We apply this methodology to various integration schemes which are popular in the molecular dynamics and machine learning communities. Further, we introduce the property “[math]-limit convergent” to characterize underdamped Langevin schemes that converge to overdamped dynamics in the high-friction limit and which have step size restrictions that are independent of the friction parameter; we show that this property is not generic by exhibiting methods from both the class and its complement. Finally, we provide asymptotic bias estimates for the BAOAB scheme, which remain accurate in the high-friction limit by comparison to a modified stochastic dynamics which preserves the invariant measure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.80
自引率
6.90%
发文量
110
审稿时长
4-8 weeks
期刊介绍: SIAM Journal on Numerical Analysis (SINUM) contains research articles on the development and analysis of numerical methods. Topics include the rigorous study of convergence of algorithms, their accuracy, their stability, and their computational complexity. Also included are results in mathematical analysis that contribute to algorithm analysis, and computational results that demonstrate algorithm behavior and applicability.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信