学习具有一般分布依赖性的高维麦金-弗拉索夫前后向随机微分方程

IF 2.8 2区 数学 Q1 MATHEMATICS, APPLIED SIAM Journal on Numerical Analysis Pub Date : 2024-01-04 DOI:10.1137/22m151861x
Jiequn Han, Ruimeng Hu, Jihao Long
{"title":"学习具有一般分布依赖性的高维麦金-弗拉索夫前后向随机微分方程","authors":"Jiequn Han, Ruimeng Hu, Jihao Long","doi":"10.1137/22m151861x","DOIUrl":null,"url":null,"abstract":"SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 1-24, February 2024. <br/> Abstract. One of the core problems in mean-field control and mean-field games is to solve the corresponding McKean–Vlasov forward-backward stochastic differential equations (MV-FBSDEs). Most existing methods are tailored to special cases in which the mean-field interaction only depends on expectation or other moments and thus are inadequate to solve problems when the mean-field interaction has full distribution dependence. In this paper, we propose a novel deep learning method for computing MV-FBSDEs with a general form of mean-field interactions. Specifically, built on fictitious play, we recast the problem into repeatedly solving standard FBSDEs with explicit coefficient functions. These coefficient functions are used to approximate the MV-FBSDEs’ model coefficients with full distribution dependence, and are updated by solving another supervising learning problem using training data simulated from the last iteration’s FBSDE solutions. We use deep neural networks to solve standard BSDEs and approximate coefficient functions in order to solve high-dimensional MV-FBSDEs. Under proper assumptions on the learned functions, we prove that the convergence of the proposed method is free of the curse of dimensionality (CoD) by using a class of integral probability metrics previously developed in [J. Han, R. Hu, and J. Long, Stochastic Process. Appl., 164 (2023), pp. 242–287]. The proved theorem shows the advantage of the method in high dimensions. We present the numerical performance in high-dimensional MV-FBSDE problems, including a mean-field game example of the well-known Cucker–Smale model, the cost of which depends on the full distribution of the forward process.","PeriodicalId":49527,"journal":{"name":"SIAM Journal on Numerical Analysis","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning High-Dimensional McKean–Vlasov Forward-Backward Stochastic Differential Equations with General Distribution Dependence\",\"authors\":\"Jiequn Han, Ruimeng Hu, Jihao Long\",\"doi\":\"10.1137/22m151861x\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 1-24, February 2024. <br/> Abstract. One of the core problems in mean-field control and mean-field games is to solve the corresponding McKean–Vlasov forward-backward stochastic differential equations (MV-FBSDEs). Most existing methods are tailored to special cases in which the mean-field interaction only depends on expectation or other moments and thus are inadequate to solve problems when the mean-field interaction has full distribution dependence. In this paper, we propose a novel deep learning method for computing MV-FBSDEs with a general form of mean-field interactions. Specifically, built on fictitious play, we recast the problem into repeatedly solving standard FBSDEs with explicit coefficient functions. These coefficient functions are used to approximate the MV-FBSDEs’ model coefficients with full distribution dependence, and are updated by solving another supervising learning problem using training data simulated from the last iteration’s FBSDE solutions. We use deep neural networks to solve standard BSDEs and approximate coefficient functions in order to solve high-dimensional MV-FBSDEs. Under proper assumptions on the learned functions, we prove that the convergence of the proposed method is free of the curse of dimensionality (CoD) by using a class of integral probability metrics previously developed in [J. Han, R. Hu, and J. Long, Stochastic Process. Appl., 164 (2023), pp. 242–287]. The proved theorem shows the advantage of the method in high dimensions. We present the numerical performance in high-dimensional MV-FBSDE problems, including a mean-field game example of the well-known Cucker–Smale model, the cost of which depends on the full distribution of the forward process.\",\"PeriodicalId\":49527,\"journal\":{\"name\":\"SIAM Journal on Numerical Analysis\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-01-04\",\"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/22m151861x\",\"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/22m151861x","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

SIAM 数值分析期刊》第 62 卷第 1 期第 1-24 页,2024 年 2 月。 摘要均场控制和均场博弈的核心问题之一是求解相应的麦金-弗拉索夫前后向随机微分方程(MV-FBSDE)。现有的大多数方法都是针对均场相互作用仅依赖于期望或其他矩的特殊情况而设计的,因此不足以解决均场相互作用具有完全分布依赖性的问题。在本文中,我们提出了一种新颖的深度学习方法,用于计算具有一般均场相互作用形式的 MV-FBSDE。具体来说,在虚构游戏的基础上,我们将问题重铸为重复求解具有显式系数函数的标准 FBSDE。这些系数函数用于近似具有完全分布依赖性的 MV-FBSDE 模型系数,并通过使用上一次迭代的 FBSDE 解模拟的训练数据解决另一个监督学习问题来更新。我们使用深度神经网络求解标准 BSDE 和近似系数函数,以求解高维 MV-FBSDE。在所学函数的适当假设条件下,我们利用之前在[J. Han, R. Hu, and J. Long, Stochastic Process.应用》,164 (2023),第 242-287 页]。所证明的定理显示了该方法在高维度下的优势。我们介绍了高维 MV-FBSDE 问题的数值性能,包括著名的 Cucker-Smale 模型的均场博弈实例,其代价取决于前向过程的全分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Learning High-Dimensional McKean–Vlasov Forward-Backward Stochastic Differential Equations with General Distribution Dependence
SIAM Journal on Numerical Analysis, Volume 62, Issue 1, Page 1-24, February 2024.
Abstract. One of the core problems in mean-field control and mean-field games is to solve the corresponding McKean–Vlasov forward-backward stochastic differential equations (MV-FBSDEs). Most existing methods are tailored to special cases in which the mean-field interaction only depends on expectation or other moments and thus are inadequate to solve problems when the mean-field interaction has full distribution dependence. In this paper, we propose a novel deep learning method for computing MV-FBSDEs with a general form of mean-field interactions. Specifically, built on fictitious play, we recast the problem into repeatedly solving standard FBSDEs with explicit coefficient functions. These coefficient functions are used to approximate the MV-FBSDEs’ model coefficients with full distribution dependence, and are updated by solving another supervising learning problem using training data simulated from the last iteration’s FBSDE solutions. We use deep neural networks to solve standard BSDEs and approximate coefficient functions in order to solve high-dimensional MV-FBSDEs. Under proper assumptions on the learned functions, we prove that the convergence of the proposed method is free of the curse of dimensionality (CoD) by using a class of integral probability metrics previously developed in [J. Han, R. Hu, and J. Long, Stochastic Process. Appl., 164 (2023), pp. 242–287]. The proved theorem shows the advantage of the method in high dimensions. We present the numerical performance in high-dimensional MV-FBSDE problems, including a mean-field game example of the well-known Cucker–Smale model, the cost of which depends on the full distribution of the forward process.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
期刊最新文献
How Sharp Are Error Bounds? –Lower Bounds on Quadrature Worst-Case Errors for Analytic Functions– Fractal Multiquadric Interpolation Functions High Order Biorthogonal Functions in [math](curl) Convergence Analysis of the Parareal Algorithm with Nonuniform Fine Time Grid Numerical Reconstruction of Diffusion and Potential Coefficients from Two Observations: Decoupled Recovery and Error Estimates
×
引用
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