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

所有已知(和某些未知)矩阵乘法方法的极限

Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

Josh Alman, Virginia Vassilevska Williams

摘要:

我们研究了设计矩阵乘法算法的已知技术。两种主要的方法是斯特拉森的激光方法,以及科恩和乌曼斯的群论方法。我们定义了一个基于归零的推广,它包含这两种方法,我们称之为太阳能方法,以及一个更一般的方法,我们称之为银河系方法。然后,我们设计了一套技术证明下限值的$ω$,矩阵乘法的指数,这可以通过使用许多张量$T$和银河方法的算法来实现。我们的一些技术利用$T$的“局部”性质,如找到$T$的一个子张量,该子张量是如此“弱”,以至于$T$本身不能用于在$ω$上实现良好的绑定,而另一些技术利用“全局”性质,如$T$是一个群代数的结构张量的单项退化。我们的主要结果是,存在一个普适常数$\ell>2$,使得对于任何$q$,推广Coppersmith-Winograd张量$CW_q$的一大类张量不能在银河方法中使用,以显示$ω$上的界优于$\ell$。我们给出的证据表明,以前的下界技术不足以证明这一点。我们还证明了一些互补的结果,包括对于任何组$G$,结构张量的$\mathbb{C}[G]$可以用来恢复最好的约束$ω$的Coppersmith-Winograd方法得到使用$CW_{|G|-2}$,只要渐近秩的结构张量不是太大。

英文摘要:

We study the known techniques for designing Matrix Multiplication algorithms. The two main approaches are the Laser method of Strassen, and the Group theoretic approach of Cohn and Umans. We define a generalization based on zeroing outs which subsumes these two approaches, which we call the Solar method, and an even more general method based on monomial degenerations, which we call the Galactic method. We then design a suite of techniques for proving lower bounds on the value of $ω$, the exponent of matrix multiplication, which can be achieved by algorithms using many tensors $T$ and the Galactic method. Some of our techniques exploit `local' properties of $T$, like finding a sub-tensor of $T$ which is so `weak' that $T$ itself couldn't be used to achieve a good bound on $ω$, while others exploit `global' properties, like $T$ being a monomial degeneration of the structural tensor of a group algebra. Our main result is that there is a universal constant $\ell>2$ such that a large class of tensors generalizing the Coppersmith-Winograd tensor $CW_q$ cannot be used within the Galactic method to show a bound on $ω$ better than $\ell$, for any $q$. We give evidence that previous lower-bounding techniques were not strong enough to show this. We also prove a number of complementary results along the way, including that for any group $G$, the structural tensor of $\mathbb{C}[G]$ can be used to recover the best bound on $ω$ which the Coppersmith-Winograd approach gets using $CW_{|G|-2}$ as long as the asymptotic rank of the structural tensor is not too large.

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

↑