用于吉布斯逼近的多级朗之文路径平均法

IF 1.4 3区 数学 Q2 MATHEMATICS, APPLIED Mathematics of Operations Research Pub Date : 2024-03-20 DOI:10.1287/moor.2021.0243
Maxime Egéa, Fabien Panloup
{"title":"用于吉布斯逼近的多级朗之文路径平均法","authors":"Maxime Egéa, Fabien Panloup","doi":"10.1287/moor.2021.0243","DOIUrl":null,"url":null,"abstract":"We propose and study a new multilevel method for the numerical approximation of a Gibbs distribution π on [Formula: see text], based on (overdamped) Langevin diffusions. This method relies on a multilevel occupation measure, that is, on an appropriate combination of R occupation measures of (constant-step) Euler schemes with respective steps [Formula: see text]. We first state a quantitative result under general assumptions that guarantees an ε-approximation (in an L<jats:sup>2</jats:sup>-sense) with a cost of the order [Formula: see text] or [Formula: see text] under less contractive assumptions. We then apply it to overdamped Langevin diffusions with strongly convex potential [Formula: see text] and obtain an ε-complexity of the order [Formula: see text] or [Formula: see text] under additional assumptions on U. More precisely, up to universal constants, an appropriate choice of the parameters leads to a cost controlled by [Formula: see text] (where [Formula: see text] and [Formula: see text] respectively denote the supremum and the infimum of the largest and lowest eigenvalue of [Formula: see text]). We finally complete these theoretical results with some numerical illustrations, including comparisons to other algorithms in Bayesian learning and opening to the non–strongly convex setting.Funding: The authors are grateful to the SIRIC ILIAD Nantes-Angers program, supported by the French National Cancer Institute [INCA-DGOS-Inserm Grant 12558].","PeriodicalId":49852,"journal":{"name":"Mathematics of Operations Research","volume":"80 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2024-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multilevel Langevin Pathwise Average for Gibbs Approximation\",\"authors\":\"Maxime Egéa, Fabien Panloup\",\"doi\":\"10.1287/moor.2021.0243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose and study a new multilevel method for the numerical approximation of a Gibbs distribution π on [Formula: see text], based on (overdamped) Langevin diffusions. This method relies on a multilevel occupation measure, that is, on an appropriate combination of R occupation measures of (constant-step) Euler schemes with respective steps [Formula: see text]. We first state a quantitative result under general assumptions that guarantees an ε-approximation (in an L<jats:sup>2</jats:sup>-sense) with a cost of the order [Formula: see text] or [Formula: see text] under less contractive assumptions. We then apply it to overdamped Langevin diffusions with strongly convex potential [Formula: see text] and obtain an ε-complexity of the order [Formula: see text] or [Formula: see text] under additional assumptions on U. More precisely, up to universal constants, an appropriate choice of the parameters leads to a cost controlled by [Formula: see text] (where [Formula: see text] and [Formula: see text] respectively denote the supremum and the infimum of the largest and lowest eigenvalue of [Formula: see text]). We finally complete these theoretical results with some numerical illustrations, including comparisons to other algorithms in Bayesian learning and opening to the non–strongly convex setting.Funding: The authors are grateful to the SIRIC ILIAD Nantes-Angers program, supported by the French National Cancer Institute [INCA-DGOS-Inserm Grant 12558].\",\"PeriodicalId\":49852,\"journal\":{\"name\":\"Mathematics of Operations Research\",\"volume\":\"80 1\",\"pages\":\"\"},\"PeriodicalIF\":1.4000,\"publicationDate\":\"2024-03-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematics of Operations Research\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1287/moor.2021.0243\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Operations Research","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1287/moor.2021.0243","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

我们提出并研究了一种新的多级方法,基于(过阻尼)朗格文扩散,对[公式:见正文]上的吉布斯分布π进行数值逼近。该方法依赖于多级占优度量,即具有各自步长的(恒定步长)欧拉方案的 R 级占优度量的适当组合[公式:见正文]。我们首先给出一个一般假设下的定量结果,它保证了ε 近似(在 L2 意义上),其代价为[公式:见正文]或[公式:见正文]。然后,我们将其应用于具有强凸势的、过阻尼的朗格文扩散[公式:见正文],并在 U 的额外假设下得到[公式:见正文]或[公式:见正文]阶的ε复杂性。更确切地说,在不超出普遍常数的情况下,参数的适当选择会导致[公式:见正文]所控制的代价(其中[公式:见正文]和[公式:见正文]分别表示[公式:见正文]的最大和最小特征值的上峰和下峰)。最后,我们通过一些数值说明完成了这些理论结果,包括与贝叶斯学习中其他算法的比较,以及向非强凸设置的开放:作者感谢法国国家癌症研究所[INCA-DGOS-Inserm Grant 12558]支持的 SIRIC ILIAD Nantes-Angers 计划。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multilevel Langevin Pathwise Average for Gibbs Approximation
We propose and study a new multilevel method for the numerical approximation of a Gibbs distribution π on [Formula: see text], based on (overdamped) Langevin diffusions. This method relies on a multilevel occupation measure, that is, on an appropriate combination of R occupation measures of (constant-step) Euler schemes with respective steps [Formula: see text]. We first state a quantitative result under general assumptions that guarantees an ε-approximation (in an L2-sense) with a cost of the order [Formula: see text] or [Formula: see text] under less contractive assumptions. We then apply it to overdamped Langevin diffusions with strongly convex potential [Formula: see text] and obtain an ε-complexity of the order [Formula: see text] or [Formula: see text] under additional assumptions on U. More precisely, up to universal constants, an appropriate choice of the parameters leads to a cost controlled by [Formula: see text] (where [Formula: see text] and [Formula: see text] respectively denote the supremum and the infimum of the largest and lowest eigenvalue of [Formula: see text]). We finally complete these theoretical results with some numerical illustrations, including comparisons to other algorithms in Bayesian learning and opening to the non–strongly convex setting.Funding: The authors are grateful to the SIRIC ILIAD Nantes-Angers program, supported by the French National Cancer Institute [INCA-DGOS-Inserm Grant 12558].
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Mathematics of Operations Research
Mathematics of Operations Research 管理科学-应用数学
CiteScore
3.40
自引率
5.90%
发文量
178
审稿时长
15.0 months
期刊介绍: Mathematics of Operations Research is an international journal of the Institute for Operations Research and the Management Sciences (INFORMS). The journal invites articles concerned with the mathematical and computational foundations in the areas of continuous, discrete, and stochastic optimization; mathematical programming; dynamic programming; stochastic processes; stochastic models; simulation methodology; control and adaptation; networks; game theory; and decision theory. Also sought are contributions to learning theory and machine learning that have special relevance to decision making, operations research, and management science. The emphasis is on originality, quality, and importance; correctness alone is not sufficient. Significant developments in operations research and management science not having substantial mathematical interest should be directed to other journals such as Management Science or Operations Research.
期刊最新文献
Dual Solutions in Convex Stochastic Optimization Exit Game with Private Information A Retrospective Approximation Approach for Smooth Stochastic Optimization The Minimax Property in Infinite Two-Person Win-Lose Games Envy-Free Division of Multilayered Cakes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1