多代理系统中网络拓扑的图注意推理

Akshay Kolli, Reza Azadeh, Kshitj Jerath
{"title":"多代理系统中网络拓扑的图注意推理","authors":"Akshay Kolli, Reza Azadeh, Kshitj Jerath","doi":"arxiv-2408.15449","DOIUrl":null,"url":null,"abstract":"Accurately identifying the underlying graph structures of multi-agent systems\nremains a difficult challenge. Our work introduces a novel machine\nlearning-based solution that leverages the attention mechanism to predict\nfuture states of multi-agent systems by learning node representations. The\ngraph structure is then inferred from the strength of the attention values.\nThis approach is applied to both linear consensus dynamics and the non-linear\ndynamics of Kuramoto oscillators, resulting in implicit learning the graph by\nlearning good agent representations. Our results demonstrate that the presented\ndata-driven graph attention machine learning model can identify the network\ntopology in multi-agent systems, even when the underlying dynamic model is not\nknown, as evidenced by the F1 scores achieved in the link prediction.","PeriodicalId":501315,"journal":{"name":"arXiv - CS - Multiagent Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Graph Attention Inference of Network Topology in Multi-Agent Systems\",\"authors\":\"Akshay Kolli, Reza Azadeh, Kshitj Jerath\",\"doi\":\"arxiv-2408.15449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Accurately identifying the underlying graph structures of multi-agent systems\\nremains a difficult challenge. Our work introduces a novel machine\\nlearning-based solution that leverages the attention mechanism to predict\\nfuture states of multi-agent systems by learning node representations. The\\ngraph structure is then inferred from the strength of the attention values.\\nThis approach is applied to both linear consensus dynamics and the non-linear\\ndynamics of Kuramoto oscillators, resulting in implicit learning the graph by\\nlearning good agent representations. Our results demonstrate that the presented\\ndata-driven graph attention machine learning model can identify the network\\ntopology in multi-agent systems, even when the underlying dynamic model is not\\nknown, as evidenced by the F1 scores achieved in the link prediction.\",\"PeriodicalId\":501315,\"journal\":{\"name\":\"arXiv - CS - Multiagent Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Multiagent Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.15449\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Multiagent Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.15449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

准确识别多代理系统的底层图结构仍然是一项艰巨的挑战。我们的工作引入了一种新颖的基于机器学习的解决方案,它利用注意力机制,通过学习节点表征来预测多机器人系统的未来状态。这种方法既适用于线性共识动力学,也适用于仓本振荡器的非线性动力学,从而通过学习良好的代理表征来隐式学习图谱。我们的研究结果表明,提出的数据驱动图注意力机器学习模型可以识别多代理系统中的网络拓扑结构,即使在不知道底层动态模型的情况下也是如此,这一点可以从链接预测中获得的 F1 分数得到证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Graph Attention Inference of Network Topology in Multi-Agent Systems
Accurately identifying the underlying graph structures of multi-agent systems remains a difficult challenge. Our work introduces a novel machine learning-based solution that leverages the attention mechanism to predict future states of multi-agent systems by learning node representations. The graph structure is then inferred from the strength of the attention values. This approach is applied to both linear consensus dynamics and the non-linear dynamics of Kuramoto oscillators, resulting in implicit learning the graph by learning good agent representations. Our results demonstrate that the presented data-driven graph attention machine learning model can identify the network topology in multi-agent systems, even when the underlying dynamic model is not known, as evidenced by the F1 scores achieved in the link prediction.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信