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

比蛮力更快地计算广义卷积

Computing Generalized Convolutions Faster Than Brute Force

Barış Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Węgrzycki

摘要:

在本文中,我们考虑卷积的一般概念。设$D$是一个有限域,$D^n$是$D$的$n$长度向量(元组)的集合。令$f : D \times D \to D$为函数,并令$\oplus_f$为$f$的坐标式应用。$f$ -两个函数$g,h : D^n \to \{-M,\ldots,M\}$的卷积对于每个$\textbf{v} \in D^n$都是$$(g \otimes_f h)(\textbf{v}) := \sum_{\substack{\textbf{v}_g,\textbf{v}_h \in D^n\\ \text{s.t. } \textbf{v}_g \oplus_f \textbf{v}_h}} g(\textbf{v}_g) \cdot h(\textbf{v}_h)$$。该问题推广了子集卷积、异或积、覆盖积、填充积等基本卷积,对于任意函数$f$和定义域$D$,可以在$\widetilde{O}(|D|^{2n}\mathrm{polylog}(M))$时间内通过穷举法计算$f$ -卷积。我们的主要结果是这个天真的算法的改进。当$D$具有偶数基数时,我们证明了对于常数$c := 3/4$,$f$ -卷积可以在$\widetilde{O}((c \cdot |D|^2)^{n}\mathrm{polylog}(M))$中精确计算。我们的主要观察是,一个\emph{cyclic partition}的功能$f : D \times D \to D$可以用来加快计算的$f$ -卷积,我们表明,一个适当的循环分区存在于每个$f$。此外,我们证明了$f$ -卷积的单个条目可以更有效地计算。在这个变体中,我们给出了两个函数$g,h : D^n \to \{-M,\ldots,M\}$和一个向量$\textbf{v} \in D^n$,$f$ -查询问题的任务是计算整数$(g \otimes_f h)(\textbf{v})$。这是著名的正交向量问题的推广。我们证明了$f$ -Query可以在$\widetilde{O}(|D|^{\fracω{2} n}\mathrm{polylog}(M))$时间内计算,其中$ω\in [2,2.372)$是目前最快的矩阵乘法算法的指数。

英文摘要:

In this paper, we consider a general notion of convolution. Let $D$ be a finite domain and let $D^n$ be the set of $n$-length vectors (tuples) of $D$. Let $f : D \times D \to D$ be a function and let $\oplus_f$ be a coordinate-wise application of $f$. The $f$-Convolution of two functions $g,h : D^n \to \{-M,\ldots,M\}$ is $$(g \otimes_f h)(\textbf{v}) := \sum_{\substack{\textbf{v}_g,\textbf{v}_h \in D^n\\ \text{s.t. } \textbf{v}_g \oplus_f \textbf{v}_h}} g(\textbf{v}_g) \cdot h(\textbf{v}_h)$$ for every $\textbf{v} \in D^n$. This problem generalizes many fundamental convolutions such as Subset Convolution, XOR Product, Covering Product or Packing Product, etc. For arbitrary function $f$ and domain $D$ we can compute $f$-Convolution via brute-force enumeration in $\widetilde{O}(|D|^{2n}\mathrm{polylog}(M))$ time. Our main result is an improvement over this naive algorithm. We show that $f$-Convolution can be computed exactly in $\widetilde{O}((c \cdot |D|^2)^{n}\mathrm{polylog}(M))$ for constant $c := 3/4$ when $D$ has even cardinality. Our main observation is that a \emph{cyclic partition} of a function $f : D \times D \to D$ can be used to speed up the computation of $f$-Convolution, and we show that an appropriate cyclic partition exists for every $f$. Furthermore, we demonstrate that a single entry of the $f$-Convolution can be computed more efficiently. In this variant, we are given two functions $g,h : D^n \to \{-M,\ldots,M\}$ alongside with a vector $\textbf{v} \in D^n$ and the task of the $f$-Query problem is to compute integer $(g \otimes_f h)(\textbf{v})$. This is a generalization of the well-known Orthogonal Vectors problem. We show that $f$-Query can be computed in $\widetilde{O}(|D|^{\fracω{2} n}\mathrm{polylog}(M))$ time, where $ω\in [2,2.372)$ is the exponent of currently fastest matrix multiplication algorithm.

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

↑