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

低带宽模型下的矩形矩阵乘法

Rectangular Matrix Multiplication in the Low-Bandwidth Model

IIT Roorkee(印度理工学院罗尔基分校);Aalto University(阿尔托大学)

Chetan Gupta, Jukka Suomela, Hossein Vahidi

AI总结:

研究低带宽分布式计算模型中矩形矩阵乘法的轮复杂度,针对两种自然长宽比⟨n,d,n⟩和⟨d,n,d⟩,给出了匹配的上下界并揭示了相变现象。

摘要:

我们研究低带宽分布式计算模型中的矩形矩阵乘法。有$n$台计算机;初始时输入矩阵均匀分布在计算机之间,每轮通信中每台计算机可以发送和接收一个$O(\log n)$比特的消息。最终每台计算机必须输出其指定的乘积矩阵部分。 先前的工作主要关注在各种稀疏性假设下的方阵$n \times n$乘法,而我们研究无稀疏性假设的矩形实例。我们用$\langle a,b,c\rangle$表示在此模型中将一个$a\times b$矩阵乘以一个$b\times c$矩阵的任务。我们专注于两种自然的长宽比:$\langle n,d,n\rangle$和$\langle d,n,d\rangle$,其中$d \le n$,并研究轮复杂度如何依赖于$n$和$d$。 当$d \to n$时,$\langle n,d,n\rangle$和$\langle d,n,d\rangle$都趋近于$\langle n,n,n\rangle$,即通常的方阵乘法任务。如果考虑在半环上的乘法,当前该情况下的最佳上界是$O(n^{4/3})$轮,并且有一个平凡的无条件下界$\Omega(n)$。 我们证明对于$\langle d,n,d\rangle$,可以实现$\tilde O(d^{4/3})$的复杂度,这似乎是当$d=n$时上界$\tilde O(n^{4/3})$的自然推广。然而,$\langle n,d,n\rangle$的情况根本不同,并且表现出相变。我们证明对于$d \le \sqrt{n}$,$\langle n,d,n\rangle$的复杂度是$\Theta(d \sqrt{n})$;我们给出了匹配的上下界。但在$d \ge \sqrt{n}$的区域,行为确实不同,上界为$O(d^{2/3} n^{2/3})$。

英文摘要:

We study rectangular matrix multiplication in the low-bandwidth model of distributed computing. There are $n$ computers; initially the input matrices are distributed evenly between computers, and in each communication round every computer can send and receive an $O(\log n)$-bit message. Eventually each computer must output its designated part of the product matrix. While prior work has focused primarily on square $n \times n$ multiplication under various sparsity assumptions, we study rectangular instances with no sparsity assumption. We denote by $\langle a,b,c\rangle$ the task of multiplying an $a\times b$ matrix by a $b\times c$ matrix in this model. We concentrate on two natural aspect ratios, $\langle n,d,n\rangle$ and $\langle d,n,d\rangle$, for $d \le n$, and we study how the round complexity depends on $n$ and $d$. When $d \to n$, both $\langle n,d,n\rangle$ and $\langle d,n,d\rangle$ approach $\langle n,n,n\rangle$, which is the usual task of multiplying square matrices. If we consider multiplication over semirings, the current best upper bound in that case is $O(n^{4/3})$ rounds, and there is a trivial unconditional lower bound of $Ω(n)$. We show that for $\langle d,n,d\rangle$, we can achieve the complexity of $\tilde O(d^{4/3})$, which seems like a natural generalization of the upper bound $\tilde O(n^{4/3})$ when $d=n$. However, the case of $\langle n,d,n\rangle$ is fundamentally different, and also exhibits a phase transition. We show that for $d \le \sqrt{n}$, the complexity of $\langle n,d,n\rangle$ is $Θ(d \sqrt{n})$; we have matching upper and lower bounds. However, the behavior is genuinely different in the region $d \ge \sqrt{n}$, where the upper bound is $O(d^{2/3} n^{2/3})$.

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

↑