Bayesian estimation from few samples: community detection and related problems

09/30/2017
by   Samuel B. Hopkins, et al.
0

We propose an efficient meta-algorithm for Bayesian estimation problems that is based on low-degree polynomials, semidefinite programming, and tensor decomposition. The algorithm is inspired by recent lower bound constructions for sum-of-squares and related to the method of moments. Our focus is on sample complexity bounds that are as tight as possible (up to additive lower-order terms) and often achieve statistical thresholds or conjectured computational thresholds. Our algorithm recovers the best known bounds for community detection in the sparse stochastic block model, a widely-studied class of estimation problems for community detection in graphs. We obtain the first recovery guarantees for the mixed-membership stochastic block model (Airoldi et el.) in constant average degree graphs---up to what we conjecture to be the computational threshold for this model. We show that our algorithm exhibits a sharp computational threshold for the stochastic block model with multiple communities beyond the Kesten--Stigum bound---giving evidence that this task may require exponential time. The basic strategy of our algorithm is strikingly simple: we compute the best-possible low-degree approximation for the moments of the posterior distribution of the parameters and use a robust tensor decomposition algorithm to recover the parameters from these approximate posterior moments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2020

Contextual Stochastic Block Model: Sharp Thresholds and Contiguity

We study community detection in the contextual stochastic block model ar...
research
08/30/2023

Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials

Graphon estimation has been one of the most fundamental problems in netw...
research
11/05/2019

Local Statistics, Semidefinite Programming, and Community Detection

We propose a new hierarchy of semidefinite programming relaxations for i...
research
02/12/2013

A Tensor Approach to Learning Mixed Membership Community Models

Community detection is the task of detecting hidden communities from obs...
research
11/08/2021

Smooth tensor estimation with unknown permutations

We consider the problem of structured tensor denoising in the presence o...
research
05/23/2017

Community Detection with Graph Neural Networks

We study data-driven methods for community detection in graphs. This est...
research
11/16/2021

Robust recovery for stochastic block models

We develop an efficient algorithm for weak recovery in a robust version ...

Please sign up or login with your details

Forgot password? Click here to reset