Abstract
Abstract
The stochastic block model (SBM) is widely studied as a benchmark for graph clustering aka community detection. In practice, graph data often come with node attributes that bear additional information about the communities. Previous works modeled such data by considering that the node attributes are generated from the node community memberships. In this work, motivated by a recent surge of works in signal processing using deep neural networks as priors, we propose to model the communities as being determined by the node attributes rather than the opposite. We define the corresponding model; we call it the neural-prior SBM. We propose an algorithm, stemming from statistical physics, based on a combination of belief propagation and approximate message passing. We analyze the performance of the algorithm as well as the Bayes-optimal performance. We identify detectability and exact recovery phase transitions, as well as an algorithmically hard region. The proposed model and algorithm can be used as a benchmark for both theory and algorithms. To illustrate this, we compare the optimal performances to the performance of simple graph neural networks.
Subject
Artificial Intelligence,Human-Computer Interaction,Software
Reference39 articles.
1. Community detection and stochastic block models: recent developments;Abbe,2017
2. Exact recovery in the stochastic block model;Abbe;IEEE Trans. Inf. Theory,2015
3. The spiked matrix model with generative priors;Aubin,2019
4. Optimal errors and phase transitions in high-dimensional generalized linear models;Barbier;Proc. Natl Acad. Sci.,2019
5. Covariate-assisted spectral clustering;Binkiewicz;Biometrika,2017