数据矩阵随机分裂的网络内线性回归
In-Network Linear Regression with Arbitrarily Split Data Matrices
摘要:
在本文中,我们解决的问题是如何网络的代理可以协作适合线性模型时,每个代理只有一个任意的和的回归数据。这个问题概括了以前研究的数据矩阵分裂的情况下,允许一些代理有更多的测量某些功能比其他的,甚至有其他代理的测量。我们提出了一个以变量为中心的框架,在网络中的分布式优化,并使用这个框架来开发一个邻近的算法,道格拉斯-Rachford方法的基础上,解决了这个问题。
英文摘要:
In this paper, we address the problem of how a network of agents can collaboratively fit a linear model when each agent only ever has an arbitrary summand of the regression data. This problem generalizes previously studied data-matrix-splitting scenarios, allowing for some agents to have more measurements of some features than of others and even have measurements that other agents have. We present a variable-centric framework for distributed optimization in a network, and use this framework to develop a proximal algorithm, based on the Douglas-Rachford method, that solves the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。