arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.02604cs.DCcs.LGcs.SYeess.SY
收藏

异步分布式ADMM用于大规模优化-第二部分:线性收敛性分析和数值性能

Asynchronous Distributed ADMM for Large-Scale Optimization- Part II: Linear Convergence Analysis and Numerical Performance

The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳));University of Minnesota(明尼苏达大学);Iowa State University(爱荷华州立大学);East China Normal University(华东师范大学)

Tsung-Hui Chang, Wei-Cheng Liao, Mingyi Hong, Xiangfeng Wang

AI总结:

本文研究了异步分布式ADMM的线性收敛条件及其在大规模逻辑回归中的高效性。

摘要:

本文研究了异步分布式ADMM的线性收敛条件及其在大规模逻辑回归中的高效性。

英文摘要:

The alternating direction method of multipliers (ADMM) has been recognized as a versatile approach for solving modern large-scale machine learning and signal processing problems efficiently. When the data size and/or the problem dimension is large, a distributed version of ADMM can be used, which is capable of distributing the computation load and the data set to a network of computing nodes. Unfortunately, a direct synchronous implementation of such algorithm does not scale well with the problem size, as the algorithm speed is limited by the slowest computing nodes. To address this issue, in a companion paper, we have proposed an asynchronous distributed ADMM (AD-ADMM) and studied its worst-case convergence conditions. In this paper, we further the study by characterizing the conditions under which the AD-ADMM achieves linear convergence. Our conditions as well as the resulting linear rates reveal the impact that various algorithm parameters, network delay and network size have on the algorithm performance. To demonstrate the superior time efficiency of the proposed AD-ADMM, we test the AD-ADMM on a high-performance computer cluster by solving a large-scale logistic regression problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑