带顶点标号的随机块模型的有效推理
Efficient inference in stochastic block models with vertex labels
摘要:
我们研究了两个社区的随机块模型,其中顶点包含边信息的形式的顶点标签。这些顶点标签可以具有任意的标签分布,这取决于社区成员。我们分析了流行的信念传播算法的线性化版本。我们表明,该算法实现了最高的精度可能的网络参数的某个函数有一个唯一的固定点。每当该函数具有多个固定点时,置信传播算法可能不会最佳地执行。我们发现,增加顶点标签中的信息可能会减少不动点的数量,从而导致最优的信念传播。
英文摘要:
We study the stochastic block model with two communities where vertices contain side information in the form of a vertex label. These vertex labels may have arbitrary label distributions, depending on the community memberships. We analyze a linearized version of the popular belief propagation algorithm. We show that this algorithm achieves the highest accuracy possible whenever a certain function of the network parameters has a unique fixed point. Whenever this function has multiple fixed points, the belief propagation algorithm may not perform optimally. We show that increasing the information in the vertex labels may reduce the number of fixed points and hence lead to optimality of belief propagation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。