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

矩阵乘法:强唯一可解问题

Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

Union College(联合学院)

Matthew Anderson, Zongliang Ji, Anthony Yang Xu

摘要:

Cohn和Umans提出了一个基于嵌入计算的快速矩阵乘法算法框架。在随后与Kleinberg和Szegedy的工作中,他们将此与搜索称为强唯一可解谜题(strong uniquely solvable puzzles)的组合对象联系起来。我们开始系统地用计算机辅助搜索这些物体。我们开发和实现基于约束的算法建立在减少到$\mathrm{SAT}$和$\mathrm{IP}$验证难题是强大的USP,并寻找大的强大的USP。我们生产的最大尺寸上的一个强USP宽度$k \le 5$的紧界,构造的小宽度比以前的工作更大的难题,并提高上界强USP尺寸$k \le 12$。虽然我们的工作只涉及小常数宽度的谜题,但我们发现的强USP意味着在$O(n^ω)$时间内以指数$ω\le 2.66$运行的矩阵乘法算法。虽然我们的算法没有击败最快的算法,但我们的工作提供了证据,也许是找到强USP家族的途径,这些家族意味着矩阵乘法算法比目前已知的算法更有效。

英文摘要:

Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs). We begin a systematic computer-aided search for these objects. We develop and implement constraint-based algorithms build on reductions to $\mathrm{SAT}$ and $\mathrm{IP}$ to verify that puzzles are strong USPs, and to search for large strong USPs. We produce tight bounds on the maximum size of a strong USP for width $k \le 5$, construct puzzles of small width that are larger than previous work, and improve the upper bounds on strong USP size for $k \le 12$. Although our work only deals with puzzles of small-constant width, the strong USPs we find imply matrix multiplication algorithms that run in $O(n^ω)$ time with exponent $ω\le 2.66$. While our algorithms do not beat the fastest algorithms, our work provides evidence and, perhaps, a path to finding families of strong USPs that imply matrix multiplication algorithms that are more efficient than those currently known.

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

↑