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.
Sufficient condition for root reconstruction by parsimony on binary trees with general weights
我们考虑的问题推断的祖先状态的观察在一棵树的叶子,假设状态沿着树的两个状态对称马尔可夫过程的演变。我们建立了一个一般的分支率条件下,最大简约,一个共同的重建方法,只需要树的知识,成功比随机猜测均匀的树的深度。从而推广了(Zhang et al.,2010)和(Gascuel and Steel,2010)。我们的结果适用于确定性和独立同分布。边权重。
在本文中,我们考虑的重建问题的树的硬核模型。我们确定了当lambda <(ln 2-o(1))ln^2(k)/(2 lnln(k))时k-正则树上的非重建机制的新界限,改进了lambda< e-1. This is almost tight as reconstruction is known to hold when lambda>(e+o(1))ln^2(k)的先前最佳界限。本文讨论了在稀疏随机图中寻找大独立集与树上独立集抽样的马尔可夫链的混合时间的关系。