arXiv AI· Kuangyu Ding, Gesualdo Scutari·· 3 天前评分38
From Mixing to Tearing: Graph Decomposition in Decentralized Optimization via Message Passing
摘要
这条英文动态主要涉及智能体工作流。原文要点：We study the minimization of sums of smooth strongly convex functions over undirected graphs, with each function held by one agent and communication restricted to neighbors in the graph. Existing decentralized methods, whether based on gossip or on routing over spanning trees, typically use the network to mix or aggregate information to enable {\it prescribed} local optimization updates. What this communication-cente...
本站只提供摘要与原文入口。完整内容请阅读原文。
来源：arXiv AI · arxiv.org