.png){kind=icon}
返回
DJAM: Distributed Jacobi Asynchronous Method for Learning Personal Models
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2018.2859596.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Processing data collected by a network of agents often boils down to solving an optimization problem. The distributed nature of these problems calls for methods that are, themselves, distributed. While most collaborative learning problems require agents to reach a common (or consensus) model, there are situations in which the consensus solution may not be optimal. For instance, agents may want to reach a compromise between agreeing with their neighbors and minimizing a personal loss function. We present DJAM, a Jacobi-like distributed algorithm for learning personalized models. This method is implementation-friendly : it has no hyperparameters that need tuning, it is asynchronous, and its updates only require single-neighbor interactions. We prove that DJAM converges with probability one to the solution, provided that the personal lass functions are strongly convex and have Lipschitz gradient. We then give evidence that DJAM is on par with state-of-the-art methods: our method reaches a solution with error similar to the error of a carefully tuned alternating direction method of multipliers (ADMM) in about the same number of single-neighbor interactions.
Keyword:
Collaborative work
distributed algorithms
distributed computing
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
分享收藏分享收藏Linear Convergence Rate of a Class of Distributed Augmented Lagrangian Algorithms一类分布式增广拉格朗日算法的线性收敛速度OAAI
OAAI分享收藏Implementation of a multidisciplinary treatment team for hepatocellular cancer at a Veterans Affairs Medical Center improves survival.png)
HPBOAAI
HPBIF0
OAAI分享收藏分享收藏
查看更多内容