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

决策树、协议和傅立叶熵影响猜想

Decision Trees, Protocols, and the Fourier Entropy-Influence Conjecture

Andrew Wan, John Wright, Chenggang Wu

摘要:

给定$f:\{-1, 1\}^n \rightarrow \{-1, 1\}$,将$f$的\emph{spectral distribution}定义为$[n]$子集上的分布,其中集合$S$以概率$\widehat{f}(S)^2$进行采样。然后Friedgut和Kalai(1996)的傅立叶熵影响(FEI)猜想指出存在某个绝对常数$C$使得$\operatorname{H}[\widehat{f}^2] \leq C\cdot\operatorname{Inf}[f]$。这里,$\operatorname{H}[\widehat{f}^2]$表示$f$的谱分布的香农熵,并且$\operatorname{Inf}[f]$是$f$的总影响。这个猜想是布尔函数分析中的主要开放问题之一,解决它会产生一些有趣的结果。以前关于FEI猜想的结果主要是通过直接计算得到的。在本文中,我们研究了一个自然的解释的猜想,它指出,存在一个通信协议,给定的$[n]$的子集$S$分布为$\widehat{f}^2$,可以沟通的$S$的值使用最多$C\cdot\operatorname{Inf}[f]$位的期望。利用这种解释,我们可以得到以下结果:1.首先,如果$f$可通过读$k$决策树计算,则为$\operatorname{H}[\widehat{f}^2] \leq 9k\cdot \operatorname{Inf}[f]$。2.接下来,如果$f$具有$\operatorname{Inf}[f] \geq 1$并且可由具有预期深度$d$的决策树计算,则$\operatorname{H}[\widehat{f}^2] \leq 12d\cdot \operatorname{Inf}[f]$。3.最后,我们给出了O'Donnell和Tan(ICALP 2013)的主要定理的一个新的证明,即他们的FEI $^+$猜想构成。此外,我们还证明了对我们的决策树结果的自然改进足以证明FEI猜想的全部。我们相信,我们的方法给出了更有启发性的证明比以前的结果FEI猜想。

英文摘要:

Given $f:\{-1, 1\}^n \rightarrow \{-1, 1\}$, define the \emph{spectral distribution} of $f$ to be the distribution on subsets of $[n]$ in which the set $S$ is sampled with probability $\widehat{f}(S)^2$. Then the Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai (1996) states that there is some absolute constant $C$ such that $\operatorname{H}[\widehat{f}^2] \leq C\cdot\operatorname{Inf}[f]$. Here, $\operatorname{H}[\widehat{f}^2]$ denotes the Shannon entropy of $f$'s spectral distribution, and $\operatorname{Inf}[f]$ is the total influence of $f$. This conjecture is one of the major open problems in the analysis of Boolean functions, and settling it would have several interesting consequences. Previous results on the FEI conjecture have been largely through direct calculation. In this paper we study a natural interpretation of the conjecture, which states that there exists a communication protocol which, given subset $S$ of $[n]$ distributed as $\widehat{f}^2$, can communicate the value of $S$ using at most $C\cdot\operatorname{Inf}[f]$ bits in expectation. Using this interpretation, we are able show the following results: 1. First, if $f$ is computable by a read-$k$ decision tree, then $\operatorname{H}[\widehat{f}^2] \leq 9k\cdot \operatorname{Inf}[f]$. 2. Next, if $f$ has $\operatorname{Inf}[f] \geq 1$ and is computable by a decision tree with expected depth $d$, then $\operatorname{H}[\widehat{f}^2] \leq 12d\cdot \operatorname{Inf}[f]$. 3. Finally, we give a new proof of the main theorem of O'Donnell and Tan (ICALP 2013), i.e. that their FEI$^+$ conjecture composes. In addition, we show that natural improvements to our decision tree results would be sufficient to prove the FEI conjecture in its entirety. We believe that our methods give more illuminating proofs than previous results about the FEI conjecture.

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

↑