arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.15482cs.LGcs.GTmath.OC
收藏

基于采样不变参数化的 Mean-Field Games 无监督解算子学习

Unsupervised Solution Operator Learning for Mean-Field Games via Sampling-Invariant Parametrizations

Rensselaer Polytechnic Institute(伦斯勒理工学院);Purdue University(普渡大学)

Han Huang, Rongjie Lai

AI总结:

针对单实例 Mean-Field Games 求解耗时长的问题,提出一种基于采样不变参数化的无监督解算子学习框架,通过一次前向传播输出解,具备无离散化和无需监督标签的优势。

摘要:

深度学习的最新进展见证了许多创新框架,能够准确高效地求解高维 Mean-Field Games (MFG)。然而,这些方法局限于求解单个实例的 MFG,且每个实例需要大量计算时间,限制了其实用性。为克服这一问题,我们开发了一种新颖的框架来学习 MFG 解算子。我们的模型以 MFG 实例作为输入,并通过一次前向传播输出其解。为确保所提出的参数化适合算子学习,我们引入并证明了模型的采样不变性概念,确立了其在采样极限下向连续算子的收敛性。我们的方法具有两个关键优势:首先,它是无离散化的,使其特别适合学习高维 MFGs 的算子;其次,它无需访问监督标签即可进行训练,显著减少了现有算子学习方法中创建训练数据集的计算开销。我们在具有不同复杂度和维度的合成和现实数据集上测试了该框架,以验证其鲁棒性。

英文摘要:

Recent advances in deep learning has witnessed many innovative frameworks that solve high dimensional mean-field games (MFG) accurately and efficiently. These methods, however, are restricted to solving single-instance MFG and demands extensive computational time per instance, limiting practicality. To overcome this, we develop a novel framework to learn the MFG solution operator. Our model takes a MFG instances as input and output their solutions with one forward pass. To ensure the proposed parametrization is well-suited for operator learning, we introduce and prove the notion of sampling invariance for our model, establishing its convergence to a continuous operator in the sampling limit. Our method features two key advantages. First, it is discretization-free, making it particularly suitable for learning operators of high-dimensional MFGs. Secondly, it can be trained without the need for access to supervised labels, significantly reducing the computational overhead associated with creating training datasets in existing operator learning methods. We test our framework on synthetic and realistic datasets with varying complexity and dimensionality to substantiate its robustness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑