Fabian, Christian ; Cui, Kai ; Koeppl, Heinz
Hrsg.: Ruiz, Francisco ; Dy, Jennifer ; van de Meent, Jan-Willem (2023)
Learning Sparse Graphon Mean Field Games.
26th International Conference on Artificial Intelligence and Statistics. Valencia, Spain (25.04.2023 - 27.04.2023)
Konferenzveröffentlichung, Bibliographie
Kurzbeschreibung (Abstract)
Although the field of multi-agent reinforcement learning (MARL) has made considerable progress in the last years, solving systems with a large number of agents remains a hard challenge. Graphon mean field games (GMFGs) enable the scalable analysis of MARL problems that are otherwise intractable. By the mathematical structure of graphons, this approach is limited to dense graphs which are insufficient to describe many real-world networks such as power law graphs. Our paper introduces a novel formulation of GMFGs, called LPGMFGs, which leverages the graph theoretical concept of Lp graphons and provides a machine learning tool to efficiently and accurately approximate solutions for sparse network problems. This especially includes power law networks which are empirically observed in various application areas and cannot be captured by standard graphons. We derive theoretical existence and convergence guarantees and give empirical examples that demonstrate the accuracy of our learning approach for systems with many agents. Furthermore, we extend the Online Mirror Descent (OMD) learning algorithm to our setup to accelerate learning speed, empirically show its capabilities, and conduct a theoretical analysis using the novel concept of smoothed step graphons. In general, we provide a scalable, mathematically well-founded machine learning approach to a large class of otherwise intractable problems of great relevance in numerous research fields.
Typ des Eintrags: | Konferenzveröffentlichung |
---|---|
Erschienen: | 2023 |
Herausgeber: | Ruiz, Francisco ; Dy, Jennifer ; van de Meent, Jan-Willem |
Autor(en): | Fabian, Christian ; Cui, Kai ; Koeppl, Heinz |
Art des Eintrags: | Bibliographie |
Titel: | Learning Sparse Graphon Mean Field Games |
Sprache: | Englisch |
Publikationsjahr: | 2023 |
Verlag: | MLResearch Press |
Buchtitel: | Proceedings of The 26th International Conference on Artificial Intelligence and Statistics |
Reihe: | Proceedings of Machine Learning Research |
Band einer Reihe: | 206 |
Veranstaltungstitel: | 26th International Conference on Artificial Intelligence and Statistics |
Veranstaltungsort: | Valencia, Spain |
Veranstaltungsdatum: | 25.04.2023 - 27.04.2023 |
URL / URN: | https://proceedings.mlr.press/v206/fabian23a.html |
Kurzbeschreibung (Abstract): | Although the field of multi-agent reinforcement learning (MARL) has made considerable progress in the last years, solving systems with a large number of agents remains a hard challenge. Graphon mean field games (GMFGs) enable the scalable analysis of MARL problems that are otherwise intractable. By the mathematical structure of graphons, this approach is limited to dense graphs which are insufficient to describe many real-world networks such as power law graphs. Our paper introduces a novel formulation of GMFGs, called LPGMFGs, which leverages the graph theoretical concept of Lp graphons and provides a machine learning tool to efficiently and accurately approximate solutions for sparse network problems. This especially includes power law networks which are empirically observed in various application areas and cannot be captured by standard graphons. We derive theoretical existence and convergence guarantees and give empirical examples that demonstrate the accuracy of our learning approach for systems with many agents. Furthermore, we extend the Online Mirror Descent (OMD) learning algorithm to our setup to accelerate learning speed, empirically show its capabilities, and conduct a theoretical analysis using the novel concept of smoothed step graphons. In general, we provide a scalable, mathematically well-founded machine learning approach to a large class of otherwise intractable problems of great relevance in numerous research fields. |
Freie Schlagworte: | emergenCITY, emergenCITY_KOM |
Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik > Bioinspirierte Kommunikationssysteme 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Nachrichtentechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Self-Organizing Systems Lab LOEWE LOEWE > LOEWE-Zentren LOEWE > LOEWE-Zentren > emergenCITY |
Hinterlegungsdatum: | 17 Jun 2024 10:38 |
Letzte Änderung: | 01 Jul 2024 12:59 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
![]() |
Frage zum Eintrag |
Optionen (nur für Redakteure)
![]() |
Redaktionelle Details anzeigen |