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

鲁棒化稀疏矩阵乘法

Robustifying Sparse Matrix Multiplication

ETH Zurich(苏黎世联邦理工学院);Max Planck Institute for Informatics(马克斯·普朗克信息学研究所);National and Kapodistrian University of Athens(雅典国立卡波蒂斯坦大学)

Karl Bringmann, Nick Fischer, Vasileios Nakos

AI总结:

本文提出一种黑盒归约方法,将鲁棒稀疏矩阵乘法转化为传统稀疏矩阵乘法,仅需多对数开销,从而显著改进计算前k大输出项的算法复杂度。

摘要:

在经典的稀疏矩阵乘法问题中,目标是计算两个 $n \times n$ 矩阵的乘积,当矩阵稀疏时,即输入矩阵的非零元个数 $m_{in}$ 和/或输出矩阵的非零元个数 $m_{out}$ 远小于 $n^2$。本文探讨了(近似)计算 $k$ 个最大输出项的广义问题,其近似误差仅依赖于较小的项——从稀疏恢复的角度看,这可以视为稀疏矩阵乘法的鲁棒变体。尽管对稀疏矩阵乘法已有大量研究,但几乎现有的算法都不具有这种鲁棒性。唯一的例外是 Pagh 的算法,时间复杂度为 $\widetilde O(m_{in} + nk)$ [ITCS'12],而其他算法能否类似地鲁棒化仍是开放问题。我们的主要贡献是一个黑盒归约,从鲁棒稀疏矩阵乘法到传统稀疏矩阵乘法,仅需多对数开销。具体来说,我们证明任何运行时间为 $T(n, m_{in}, m_{out})$ 的稀疏矩阵乘法算法都可以转化为运行时间为 $\widetilde O(T(n, m_{in}, k))$ 的鲁棒算法。该归约利用了稀疏恢复的广泛工具,并且有趣的是,还涉及解决一个背包类型的问题。通过采用 Abboud、Bringmann、Fischer 和 Künnemann [SODA'24] 的最新稀疏矩阵乘法算法,我们实现了显著改进的界限,例如 $O((m_{in} + k)^{1.346})$。值得注意的是,在 $k \geq m_{in}^{1.762}$ 的情况下,我们的归约最终得到一个几乎最优的 $k^{1+o(1)}$ 时间算法。

英文摘要:

In the seminal sparse matrix multiplication problem the goal is to compute the product of two $n \times n$ matrices when the matrices are sparse, i.e., when the number of nonzeros in the input matrices $m_{in}$ and/or the number of nonzeros in the output matrix $m_{out}$ are much smaller than $n^2$. In this paper, we explore the generalized problem of (approximately) computing the $k$ largest output entries, with an approximation error dependent solely on the smaller entries -- from the viewpoint of sparse recovery, this can be seen as a robust variant of sparse matrix multiplication. Despite the substantial research dedicated to sparse matrix multiplication, almost no existing algorithms are robust in this sense. The one exception is Pagh's algorithm in time $\widetilde O(m_{in} + nk)$ [ITCS'12], and it remained open whether other algorithms can be similarly made robust. Our principal contribution is a black-box reduction from robust sparse matrix multiplication to conventional sparse matrix multiplication with only polylogarithmic overhead. Specifically, we show that any sparse matrix multiplication algorithm with running time $T(n, m_{in}, m_{out})$ can be transformed into a robust algorithm running in time $\widetilde O(T(n, m_{in}, k))$. This reduction leverages an extensive toolkit from sparse recovery, and intriguingly, also involves solving a knapsack-type problem. By plugging in the state-of-the-art algorithm for sparse matrix multiplication by Abboud, Bringmann, Fischer, and Künnemann [SODA'24], we achieve significantly improved bounds such as $O((m_{in} + k)^{1.346})$. Notably, in the regime where $k \geq m_{in}^{1.762}$, our reduction culminates in an almost-optimal $k^{1+o(1)}$-time algorithm.

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

↑