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

内积的最优深度三电路

Optimal Depth-Three Circuits for Inner Product

Cornell University(康奈尔大学);University of California, San Diego(加州大学圣迭戈分校);Constructive Codes;University of Sheffield(谢菲尔德大学)

Mohit Gurumukhani, Daniel Kleber, Ramamohan Paturi, Christopher Rosin, Navid Talebanfard

AI总结:

本文提出了一种基于模ularity原则的构造方法,通过计算机搜索找到最优深度三电路,用于计算内积函数。

摘要:

我们证明,对于$2n$个变量的内积$\mathbf{IP}_n(x, y) = x_1y_1 \oplus \ldots \oplus x_ny_n$,可以使用深度为3、底输入扇入为2的电路计算,其大小为$\mathsf{poly}(n)\cdot (9/5)^n$,与Göös、Guan和Mosnoi(Inform. Comput.'24)的下界相匹配。我们的构造方法分为以下步骤:首先,我们提供了一个通用模板,用于构造任意函数$f$的最优深度三电路,底输入扇入为$k$。这分为两个步骤:首先,我们将$f^{-1}(1)$划分为其自同构群的轨道;其次,对于每个轨道,我们构造一个$k$-CNF,它(a)接受该轨道中最多的输入,(b)拒绝所有被$f$拒绝的输入。然后,我们将该模板应用于$\mathbf{IP}_n$和$k=2$。基于“模ularity原则”的直觉,即最优的2-CNF可以通过将变量不相交的较小2-CNF的拷贝进行合取来构造,我们使用计算机搜索来识别一组小的构建块2-CNF,其变量数最多为4。再次使用计算机搜索发现适当的构建块组合(不相交的合取)以得到最优的2-CNF,并使用解析组合学的技术进行分析。我们相信,本文中概述的方法可以应用于广泛的功能以确定其深度三复杂度。

英文摘要:

We show that Inner Product in $2n$ variables, $\mathbf{IP}_n(x, y) = x_1y_1 \oplus \ldots \oplus x_ny_n$, can be computed by depth-3 bottom fan-in 2 circuits of size $\mathsf{poly}(n)\cdot (9/5)^n$, matching the lower bound of Göös, Guan, and Mosnoi (Inform. Comput.'24). Our construction is obtained via the following steps. - We provide a general template for constructing optimal depth-3 circuits with bottom fan-in $k$ for an arbitrary function $f$. We do this in two steps. First, we partition $f^{-1}(1)$ into orbits of its automorphism group. Second, for each orbit, we construct one $k$-CNF that (a) accepts the largest number of inputs from that orbit and (b) rejects all inputs rejected by $f$. - We instantiate the template for $\mathbf{IP}_n$ and $k = 2$. Guided by the intuition (which we call modularity principle) that optimal 2-CNFs can be constructed by taking the conjunction of variable-disjoint copies of smaller $2$-CNFs, we use computer search to identify a small set of building block 2-CNFs over at most 4 variables. - We again use computer search to discover appropriate combinations (disjoint conjunctions) of building blocks to arrive at optimal 2-CNFs and analyze them using techniques from analytic combinatorics. We believe that the approach outlined in this paper can be applied to a wide range of functions to determine their depth-3 complexity.

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

↑