解包ADMM:基于转置约简的高效分布式计算
Unwrapping ADMM: Efficient Distributed Computing via Transpose Reduction
摘要:
最近的分布式模型拟合方法严重依赖于共识ADMM,其中每个节点仅使用本地数据解决小的子问题。我们提出了迭代法,解决{ \em全球}的子问题,在整个分布式数据集。这可以使用转置约简策略,允许单个节点在不将所有数据放在一个地方的情况下解决大规模数据集的最小二乘问题。这导致简单的迭代法,避免了共识方法所需的昂贵的内部循环。为了证明这种方法的效率,我们适合线性分类器和稀疏线性模型的数据集超过5 Tb的大小使用分布式实现超过7000个核心,在更短的时间比以前的方法。
英文摘要:
Recent approaches to distributed model fitting rely heavily on consensus ADMM, where each node solves small sub-problems using only local data. We propose iterative methods that solve {\em global} sub-problems over an entire distributed dataset. This is possible using transpose reduction strategies that allow a single node to solve least-squares over massive datasets without putting all the data in one place. This results in simple iterative methods that avoid the expensive inner loops required for consensus methods. To demonstrate the efficiency of this approach, we fit linear classifiers and sparse linear models to datasets over 5 Tb in size using a distributed implementation with over 7000 cores in far less time than previous approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。