对称函数的谱范数
Spectral Norm of Symmetric Functions
摘要:
布尔函数$f:\{0,1\}^n \to \{-1,1\}$的谱范数是其傅立叶系数的绝对值之和。这个量在学习理论、电路复杂度和通信复杂度等领域提供了函数复杂度的有用上限和下限。本文给出了对称函数谱范数的一个组合刻划。我们表明,谱范数的对数是相同的数量级的$r(f)\log(n/r(f))$的$r(f) = \max\{r_0,r_1\}$,$r_0$和$r_1$是最小的整数小于$n/2$,使$f(x)$或$f(x) \cdot parity(x)$是恒定的所有$x$与$\sum x_i \in [r_0, n-r_1]$。我们提到了一些应用程序的决策树和对称函数的通信复杂性。
英文摘要:
The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning theory, circuit complexity, and communication complexity. In this paper, we give a combinatorial characterization for the spectral norm of symmetric functions. We show that the logarithm of the spectral norm is of the same order of magnitude as $r(f)\log(n/r(f))$ where $r(f) = \max\{r_0,r_1\}$, and $r_0$ and $r_1$ are the smallest integers less than $n/2$ such that $f(x)$ or $f(x) \cdot parity(x)$ is constant for all $x$ with $\sum x_i \in [r_0, n-r_1]$. We mention some applications to the decision tree and communication complexity of symmetric functions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。