arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.20307cs.DS
收藏

协调者模型及其扩展中经典函数的最优通信

Optimal Communication for Classic Functions in the Coordinator Model and Beyond

Hossein Esfandiari, Praneeth Kacham, Vahab Mirrokni, David P. Woodruff, Peilin Zhong

AI总结:

本文在协调者模型中引入参数 c_f[s] 刻画近似函数和的通信复杂度,为包括矩估计和 Huber 损失在内的广泛函数类给出两轮最优通信协议,并将可组合草图方法推广到个性化 CONGEST 模型以高效求解线性回归和低秩近似。

摘要:

在具有 s 个服务器的协调者通信模型中,给定任意非负函数 f,我们研究以 1 ± ε 因子近似求和 ∑_{i ∈ [n]} f(x_i) 的问题。这里向量 x ∈ R^n 定义为 x = x(1) + ⋯ + x(s),其中 x(j) ≥ 0 表示第 j 个服务器持有的非负向量。该问题的一个特例是 f(x) = x^k,它对应于分布式通信模型中已被广泛研究的 F_k 矩估计问题。我们引入一个新参数 c_f[s],它刻画了近似 ∑_{i∈[n]} f(x_i) 的通信复杂度,并且对于包含 f(x) = x^k(k ≥ 2)以及其他鲁棒函数(如 Huber 损失函数)在内的一大类函数,我们给出了一个两轮协议,其总通信量为 c_f[s]/ε^2 比特,最多相差多对数因子。对于这一大类函数,我们的结果改进了 Kannan、Vempala 和 Woodruff(COLT 2014)以及 Woodruff 和 Zhang(STOC 2012)所获得的通信上界,在最少轮数下达到了最多相差多对数因子的最优通信。我们证明该协议也可用于近似高阶相关性。除了协调者模型之外,针对每个节点都是一个服务器的其他图拓扑的算法也已被广泛研究。我们认为直接提升协议会导致算法效率低下。因此,一个自然的问题是哪些问题可以在一般图拓扑中被高效解决。我们通过设计可组合草图,在所谓的个性化 CONGEST 模型中给出了用于求解线性回归和低秩近似的通信高效协议。我们的草图构造可能具有独立的研究价值,并且可以实现任何具有单调性性质的重要性采样过程。

英文摘要:

In the coordinator model of communication with $s$ servers, given an arbitrary non-negative function $f$, we study the problem of approximating the sum $\sum_{i \in [n]}f(x_i)$ up to a $1 \pm \varepsilon$ factor. Here the vector $x \in R^n$ is defined to be $x = x(1) + \cdots + x(s)$, where $x(j) \ge 0$ denotes the non-negative vector held by the $j$-th server. A special case of the problem is when $f(x) = x^k$ which corresponds to the well-studied problem of $F_k$ moment estimation in the distributed communication model. We introduce a new parameter $c_f[s]$ which captures the communication complexity of approximating $\sum_{i\in [n]} f(x_i)$ and for a broad class of functions $f$ which includes $f(x) = x^k$ for $k \ge 2$ and other robust functions such as the Huber loss function, we give a two round protocol that uses total communication $c_f[s]/\varepsilon^2$ bits, up to polylogarithmic factors. For this broad class of functions, our result improves upon the communication bounds achieved by Kannan, Vempala, and Woodruff (COLT 2014) and Woodruff and Zhang (STOC 2012), obtaining the optimal communication up to polylogarithmic factors in the minimum number of rounds. We show that our protocol can also be used for approximating higher-order correlations. Apart from the coordinator model, algorithms for other graph topologies in which each node is a server have been extensively studied. We argue that directly lifting protocols leads to inefficient algorithms. Hence, a natural question is the problems that can be efficiently solved in general graph topologies. We give communication efficient protocols in the so-called personalized CONGEST model for solving linear regression and low rank approximation by designing composable sketches. Our sketch construction may be of independent interest and can implement any importance sampling procedure that has a monotonicity property.

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

↑