arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.09834cs.DCcs.NAmath.NA
收藏

通过 Kronecker 积的秩扩展建立嵌套双线性算法的通信下界

Communication lower bounds for nested bilinear algorithms via rank expansion of Kronecker products

Caleb Ju, Yifan Zhang, Edgar Solomonik

AI总结:

本文利用编码矩阵 Kronecker 积的秩扩展下界,刻画嵌套双线性算法对应依赖 DAG 的通信成本,并为嵌套 Toom-Cook 卷积、Strassen 算法及部分对称张量缩并给出新下界。

摘要:

我们针对嵌套双线性算法(例如用于矩阵乘法的 Strassen 算法),给出了其在存储层次中或处理器之间的通信下界。我们的工作建立在一个既有框架之上;该框架利用秩扩展(rank expansion),即矩阵任意固定大小列子集的最小秩,对编码一个双线性算法的三个矩阵分别加以分析,从而建立通信下界。与其他只能针对特定 DAG 给出界的方法不同,该框架为对应于给定双线性算法执行过程的一类依赖有向无环图(DAG)提供下界。但我们的下界仅适用于不重复计算同一 DAG 节点的执行过程。两个双线性算法可以通过在其编码矩阵之间取 Kronecker 积来实现嵌套。我们的主要结果是:由 Kronecker 积各操作数的秩扩展下界,推出由该 Kronecker 积构造的矩阵的秩扩展下界。我们应用这些秩扩展下界,为嵌套 Toom-Cook 卷积、Strassen 算法以及部分对称张量缩并的快速算法得到了新的通信下界。

英文摘要:

We develop lower bounds on communication in the memory hierarchy or between processors for nested bilinear algorithms, such as Strassen's algorithm for matrix multiplication. We build on a previous framework that establishes communication lower bounds by use of the rank expansion, or the minimum rank of any fixed size subset of columns of a matrix, for each of the three matrices encoding a bilinear algorithm. This framework provides lower bounds for a class of dependency directed acyclic graphs (DAGs) corresponding to the execution of a given bilinear algorithm, in contrast to other approaches that yield bounds for specific DAGs. However, our lower bounds only apply to executions that do not compute the same DAG node multiple times. Two bilinear algorithms can be nested by taking Kronecker products between their encoding matrices. Our main result is a lower bound on the rank expansion of a matrix constructed by a Kronecker product derived from lower bounds on the rank expansion of the Kronecker product's operands. We apply the rank expansion lower bounds to obtain novel communication lower bounds for nested Toom-Cook convolution, Strassen's algorithm, and fast algorithms for contraction of partially symmetric tensors.

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

↑