arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.06915math.PRcs.LGmath.STstat.TH
收藏

树与低次多项式的重构

Reconstruction on Trees and Low-Degree Polynomials

Stanford University(斯坦福大学);Massachusetts Institute of Technology(麻省理工学院)

Frederic Koehler, Elchanan Mossel

摘要:

马尔可夫过程和树上广播的研究与各个领域有着深刻的联系,包括统计物理、图形模型、系统发育重建、马尔可夫链蒙特卡罗和随机图中的社区检测。值得注意的是,著名的置信传播(BP)算法实现了贝叶斯最优性能的重建问题预测的马尔可夫过程的值在树的根从它的值在叶子。最近,低次多项式的分析已经成为预测计算到统计差距的有价值的工具。在这项工作中,我们研究了树的重建问题的低次多项式的性能。也许令人惊讶的是,我们表明,有简单的树模型与$N$叶和有界元,其中(1)非平凡重建的根值是可能的一个简单的多项式时间算法和噪声的鲁棒性,但没有任何多项式的次数$N^{c}$为$c > 0$一个常数只取决于元,(2)当树是未知的,并给出多个样本与相关的根分配,根值的非平凡重构可以使用简单的统计查询算法,但不能使用任何次数的多项式$N^c$。这些结果澄清了贝叶斯估计问题的低次多项式与多项式时间算法的一些局限性。他们还补充了Moitra,Mossel和Sandon最近的工作,他们研究了信念传播的电路复杂性。作为我们的主要结果的结果,我们表明,对于一些$c' > 0$只依赖于arity,$\exp(N^{c'})$许多样本需要RBF核回归获得非平凡的相关与真正的回归函数(BP)。我们提出了有关低次多项式和Kesten-Stigum阈值的开放性问题。

英文摘要:

The study of Markov processes and broadcasting on trees has deep connections to a variety of areas including statistical physics, graphical models, phylogenetic reconstruction, Markov Chain Monte Carlo, and community detection in random graphs. Notably, the celebrated Belief Propagation (BP) algorithm achieves Bayes-optimal performance for the reconstruction problem of predicting the value of the Markov process at the root of the tree from its values at the leaves. Recently, the analysis of low-degree polynomials has emerged as a valuable tool for predicting computational-to-statistical gaps. In this work, we investigate the performance of low-degree polynomials for the reconstruction problem on trees. Perhaps surprisingly, we show that there are simple tree models with $N$ leaves and bounded arity where (1) nontrivial reconstruction of the root value is possible with a simple polynomial time algorithm and with robustness to noise, but not with any polynomial of degree $N^{c}$ for $c > 0$ a constant depending only on the arity, and (2) when the tree is unknown and given multiple samples with correlated root assignments, nontrivial reconstruction of the root value is possible with a simple Statistical Query algorithm but not with any polynomial of degree $N^c$. These results clarify some of the limitations of low-degree polynomials vs. polynomial time algorithms for Bayesian estimation problems. They also complement recent work of Moitra, Mossel, and Sandon who studied the circuit complexity of Belief Propagation. As a consequence of our main result, we show that for some $c' > 0$ depending only on the arity, $\exp(N^{c'})$ many samples are needed for RBF kernel regression to obtain nontrivial correlation with the true regression function (BP). We pose related open questions about low-degree polynomials and the Kesten-Stigum threshold.

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

↑