Bounded Graph Clustering with Graph Neural Networks

arXiv:2512.05623v2 Announce Type: replace Abstract: In community detection, many methods require the user to specify the number of clusters in advance since an exhaustive search over all possible values is computationally infeasible. While some classical algorithms can infer this number directly from the data, this is typically not the case for graph neural networks (GNNs): even when a desired number of clusters is specified, standard GNN-based methods often fail to return the exact number due to the way they are designed. In this work, we address this limitation by introducing a flexible and principled way to control the number of communities discovered by GNNs. Rather than assuming the true number of clusters is known, we propose a framework that allows the user to specify a plausible range and enforce these bounds during training. However, if the user wants an exact number of clusters, it may also be specified and reliably returned.

Learning to accelerate distributed ADMM using graph neural networks
SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation
Privacy-Preserving Transfer Learning for Community Detection using Locally Distributed Multiple Networks
Dual Mamba for Node-Specific Representation Learning: Tackling Over-Smoothing with Selective State Space Modeling
Beyond the Laplacian: Doubly Stochastic Matrices for Graph Neural Networks
Learning How Much to Think: Difficulty-Aware Dynamic MoEs for Graph Node Classification

Source: arXiv cs.LG | 2026-04-21

Related