利用收费公路效应进行平均场博弈数值计算
Leveraging the turnpike effect for Mean Field Games numerics
AI总结:
针对 DGM 求解长时域平均场博弈性能下降的问题,本文提出将收费公路估计嵌入损失函数的加速 DGM,并在局部耦合及新型线性二次模型上验证其优势。
摘要:
最近,一种被称为 Deep Galerkin Method(DGM,深度 Galerkin 方法)的深度学习算法在尝试数值求解有限时域平均场博弈的研究者中引起了广泛关注,尽管其性能似乎会随时域增加而显著下降。另一方面,已经证明,某些特定类别的平均场博弈具有经济学家在七十多年前发现的某种形式的收费公路性质。这一现象的核心是证明:长时间区间上最优控制问题的解,其大部分时间都停留在相应无限时域优化问题的遍历解的平稳解附近。在回顾了 DGM 用于有限时域平均场博弈的实现之后,我们引入了一个“收费公路加速”版本,该版本将收费公路估计纳入待优化的损失函数中,并进行了对比数值分析,以展示该加速版本相对于基线 DGM 算法的优势。我们在一些已知具有收费公路性质的局部耦合平均场博弈模型,以及一类我们为其推导了显式收费公路估计的新型线性二次模型上进行了演示。
英文摘要:
Recently, a deep-learning algorithm referred to as Deep Galerkin Method (DGM), has gained a lot of attention among those trying to solve numerically Mean Field Games with finite horizon, even if the performance seems to be decreasing significantly with increasing horizon. On the other hand, it has been proven that some specific classes of Mean Field Games enjoy some form of the turnpike property identified over seven decades ago by economists. The gist of this phenomenon is a proof that the solution of an optimal control problem over a long time interval spends most of its time near the stationary solution of the ergodic solution of the corresponding infinite horizon optimization problem. After reviewing the implementation of DGM for finite horizon Mean Field Games, we introduce a ``turnpike-accelerated'' version that incorporates the turnpike estimates in the loss function to be optimized, and we perform a comparative numerical analysis to show the advantages of this accelerated version over the baseline DGM algorithm. We demonstrate on some of the Mean Field Game models with local-couplings known to have the turnpike property, as well as a new class of linear-quadratic models for which we derive explicit turnpike estimates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。