arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.17079cs.MAcs.AIcs.GTcs.LG
收藏

在稀疏图上学习均场控制

Learning Mean Field Control on Sparse Graphs

Department of Electrical Engineering(电气工程与信息科技系);Hessian Center for Artificial Intelligence (hessian.AI)(黑森人工智能中心)

Christian Fabian, Kai Cui, Heinz Koeppl

AI总结:

本文提出了一种针对稀疏图的均场控制模型,通过局部弱收敛理论,设计可扩展的学习算法,以解决多智能体强化学习中稀疏图的挑战。

摘要:

大规模智能体网络在应用和自然界中普遍存在,由于其计算和理论复杂性,在多智能体强化学习(MARL)领域提出了困难的挑战。虽然图ons均场游戏及其扩展为密集和中等稀疏的智能体网络提供了高效的學習算法,但现实中的稀疏图情况仍然 largely 未解决。因此,我们提出了一种新的均场控制模型,受局部弱收敛启发,以包含如幂律网络等稀疏图,其中系数超过两个。除了理论分析外,我们设计了可扩展的学习算法,适用于具有有限一阶矩的挑战性图序列。我们比较了我们的模型和算法在合成和现实网络上的各种示例,基于Lp图ons和图exes的均场算法。结果表明,由于特殊设计针对一个重要但迄今为止难以解决的MARL问题类别,我们的方法在许多示例和各种网络上优于现有方法。

英文摘要:

Large agent networks are abundant in applications and nature and pose difficult challenges in the field of multi-agent reinforcement learning (MARL) due to their computational and theoretical complexity. While graphon mean field games and their extensions provide efficient learning algorithms for dense and moderately sparse agent networks, the case of realistic sparser graphs remains largely unsolved. Thus, we propose a novel mean field control model inspired by local weak convergence to include sparse graphs such as power law networks with coefficients above two. Besides a theoretical analysis, we design scalable learning algorithms which apply to the challenging class of graph sequences with finite first moment. We compare our model and algorithms for various examples on synthetic and real world networks with mean field algorithms based on Lp graphons and graphexes. As it turns out, our approach outperforms existing methods in many examples and on various networks due to the special design aiming at an important, but so far hard to solve class of MARL problems.

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

↑