.png){kind=icon}
返回
AROCK: AN ALGORITHMIC FRAMEWORK FOR ASYNCHRONOUS PARALLEL COORDINATE UPDATES
.png){kind=icon}
OA
AI
DOI：10.1137/15M1024950.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Finding a fixed point to a nonexpansive operator, i.e., x* - Tx*, abstracts many problems in numerical linear algebra, optimization, and other areas of data science. To solve fixed-point problems, we propose ARock, an algorithmic framework in which multiple agents (machines, processors, or cores) update x in an asynchronous parallel fashion. Asynchrony is crucial to parallel computing since it reduces synchronization wait, relaxes communication bottleneck, and thus speeds up computing significantly. At each step of ARock, an agent updates a randomly selected coordinate x, based on possibly out-of-date information on x. The agents share x through either global memory or communication. If writing x, is atomic, the agents can read and write x without memory locks. We prove that if the nonexpansive operator T has a fixed point, then with probability one, ARock generates a sequence that converges to a fixed point of T. Our conditions on T and step sizes are weaker than those in comparable work. Linear convergence is obtained under suitable assumptions. We propose special cases of ARock for linear systems, convex optimization, and machine learning, as well as distributed and decentralized consensus problems. Numerical experiments solving sparse logistic regression problems are presented.
Keyword:
asynchronous
parallel
coordinate update
nonexpansive operator
ADMM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
分享收藏Affinity labeling of bovine carboxypeptidase A γLeu by N-bromoacetyl-N-methyl-L-phenylalanine. I. Kinetics of inactivation.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Performance analysis of asynchronous Jacobi's method implemented in MPI, SHMEM and OpenMPMPI，SHMEM和OpenMP中实现的异步Jacobi方法的性能分析OAAI
OAAI分享收藏
查看更多内容