On the computational tractability of statistical estimation on amenable graphs

• 成果类型: Article
• 署名作者: El Alaoui, Ahmed; Montanari, Andrea
• 署名单位: Cornell University; Stanford University
• 刊物名称: PROBABILITY THEORY AND RELATED FIELDS
• ISSN/ISSBN: 0178-8051
• DOI: 10.1007/s00440-021-01092-y
• 发表日期: 2021
• 页码: 815-864
• 关键词: reconstruction; INFORMATION; trees; clique

摘要

We consider the problem of estimating a vector of discrete variables theta = (theta(1), ..., theta(n)), based on noisy observations Y-uv of the pairs (theta(u), theta(v)) on the edges of a graph G = ([n], E). This setting comprises a broad family of statistical estimation problems, including group synchronization on graphs, community detection, and low-rank matrix estimation. A large body of theoretical work has established sharp thresholds for weak and exact recovery, and sharp characterizations of the optimal reconstruction accuracy in such models, focusing however on the special case of Erdos-Renyitype random graphs. An important finding of this line of work is the ubiquity of an information-computation gap. Namely, for many models of interest, a large gap is found between the optimal accuracy achievable by any statistical method, and the optimal accuracy achieved by known polynomial-time algorithms. Moreover, it is expected in many situations that this gap is robust to small amounts of additional side information revealed about the theta(i)'s. How does the structure of the graph G affect this picture? Is the information-computation gap a general phenomenon or does it only apply to specific families of graphs? We prove that the picture is dramatically different for graph sequences converging to amenable graphs (including, for instance, d-dimensional grids). We consider a model in which an arbitrarily small fraction of the vertex labels is revealed, and show that a linear-time local algorithm can achieve reconstruction accuracy that is arbitrarily close to the information-theoretic optimum. We contrast this to the case of random graphs. Indeed, focusing on group synchronization on random regular graphs, we prove that local algorithms are unable to have non-trivial performance below the so-called Kesten-Stigum threshold, even when a small amount of side information is revealed.