arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.20023cs.DScs.CCcs.CG
收藏

快速且简单的有界双宽度矩阵乘法

Fast and simple multiplication of bounded twin-width matrices

TU Dresden(德累斯顿工业大学);Czech Technical University in Prague(捷克理工大学)

László Kozma, Michal Opler

AI总结:

本文提出了一种快速且简单的有界双宽度矩阵乘法方法,可在~O(n²)时间内完成,适用于至少一个矩阵为0/1条目且具有有界双宽度的情况。

摘要:

矩阵乘法是几乎所有计算领域中的基本任务,包括机器学习和优化、计算机图形学、信号处理和图算法(静态和动态)。双宽度是矩阵(以及更一般结构)的自然复杂度度量,最近作为一种统一的概念出现,并具有重要的算法应用。虽然矩阵的双宽度在重新排列行和列时保持不变,但迄今为止大多数算法应用假设输入以某种规范顺序给出,从而产生有界双宽度收缩序列。一般来说,高效找到这样的序列——即使对于近似双宽度值——仍然是核心且神秘的开放问题。在本文中,我们证明一个二进制n×n矩阵的双宽度为d,可以在~O_d(n²)时间内预处理,使得其与任何向量的乘积可以在~O_d(n)时间内计算。值得注意的是,输入矩阵的双宽度不需要已知,也不假定其行和列的特定顺序。如果存在规范顺序,即输入矩阵是d-双宽度有序的,那么预处理和矩阵-向量乘积的运行时间可以进一步减少到O(n²+dn)和O(dn)。因此,我们可以以~O(n²)的时间乘以两个n×n矩阵,当至少一个矩阵由0/1条目组成且具有有界双宽度时。结果也扩展到具有对抗性破坏的有界双宽度矩阵的情况。我们的算法比先前涉及一阶模型检查且要求两个输入矩阵都是d-双宽度有序的方法要快得多且简单。

英文摘要:

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity measure of matrices (and more general structures) that has recently emerged as a unifying concept with important algorithmic applications. While the twin-width of a matrix is invariant to re-ordering rows and columns, most of its algorithmic applications to date assume that the input is given in a certain canonical ordering that yields a bounded twin-width contraction sequence. In general, efficiently finding such a sequence -- even for an approximate twin-width value -- remains a central and elusive open question. In this paper we show that a binary $n \times n$ matrix of twin-width $d$ can be preprocessed in $\widetilde{\mathcal{O}}_d(n^2)$ time, so that its product with any vector can be computed in $\widetilde{\mathcal{O}}_d(n)$ time. Notably, the twin-width of the input matrix need not be known and no particular ordering of its rows and columns is assumed. If a canonical ordering is available, i.e., if the input matrix is $d$-twin-ordered, then the runtime of preprocessing and matrix-vector products can be further reduced to $\mathcal{O}(n^2+dn)$ and $\mathcal{O}(dn)$. Consequently, we can multiply two $n \times n$ matrices in $\widetilde{\mathcal{O}}(n^2)$ time, when at least one of the matrices consists of 0/1 entries and has bounded twin-width. The results also extend to the case of bounded twin-width matrices with adversarial corruption. Our algorithms are significantly faster and simpler than earlier methods that involved first-order model checking and required both input matrices to be $d$-twin-ordered.

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

↑