arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.00703stat.CO
收藏

一种用于分布式模型拟合的划分不敏感并行框架

A Partition-insensitive Parallel Framework for Distributed Model Fitting

Xiaofei Wu, Rongmei Liang, Fabio Roli, Marcello Pelillo, Jing Yuan

AI总结:

本文提出一种用于分布式模型拟合的划分不敏感并行框架,其解不受节点或数据量变化影响且每次迭代更新变量更少,理论证明具有线性收敛速率,数值实验验证了其通用性、鲁棒性和准确性。

摘要:

分布式模型拟合是指利用分布式计算资源将数学或统计模型拟合到数据的过程,计算任务被分配给多台互联的计算机或节点,这些节点通常组织成集群或网络。现有的分布式模型拟合方法大多将其表述为共识优化问题,然后基于交替方向乘子法(ADMM)构建算法。本文提出了一种用于实现分布式模型拟合的新型并行框架。与以往的共识框架相比,该框架具有两个显著优势。首先,它对样本划分表现出不敏感性,即算法的解不受从节点数量和每个节点承载数据量的变化影响。其次,每次迭代需要更新的变量更少,使得该框架运行更简洁高效,并能适应高维数据。此外,我们从理论上证明了新并行框架下的算法具有最坏情况下的线性收敛速率。数值实验验证了该框架的通用性、鲁棒性和准确性。

英文摘要:

Distributed model fitting refers to the process of fitting a mathematical or statistical model to the data using distributed computing resources, such that computing tasks are divided among multiple interconnected computers or nodes, often organized in a cluster or network. Most of the existing methods for distributed model fitting are to formulate it in a consensus optimization problem, and then build up algorithms based on the alternating direction method of multipliers (ADMM). This paper introduces a novel parallel framework for achieving a distributed model fitting. In contrast to previous consensus frameworks, the introduced parallel framework offers two notable advantages. Firstly, it exhibits insensitivity to sample partitioning, meaning that the solution of the algorithm remains unaffected by variations in the number of slave nodes or/and the amount of data each node carries. Secondly, fewer variables are required to be updated at each iteration, so that the proposed parallel framework performs in a more succinct and efficient way, and adapts to high-dimensional data. In addition, we prove that the algorithms under the new parallel framework have a worst-case linear convergence rate in theory. Numerical experiments confirm the generality, robustness, and accuracy of our proposed parallel framework.

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

↑