Differentiable Cluster Graph Neural Network
Graph Neural Networks often struggle with long-range information propagation and in the presence of heterophilous neighborhoods. We address both challenges with a unified framework that incorporates a clustering inductive bias into the message passing mechanism, using additional cluster-nodes. Central to our approach is the formulation of an optimal transport based implicit clustering objective function. However, the algorithm for solving the implicit objective function needs to be differentiable to enable end-to-end learning of the GNN. To facilitate this, we adopt an entropy regularized objective function and propose an iterative optimization process, alternating between solving for the cluster assignments and updating the node/cluster-node embeddings. Notably, our derived closed-form optimization steps are themselves simple yet elegant message passing steps operating seamlessly on a bipartite graph of nodes and cluster-nodes. Our clustering-based approach can effectively capture both local and global information, demonstrated by extensive experiments on both heterophilous and homophilous datasets.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGraph Neural NetworkInductive BiasSimilar Papers 제목 키워드 기반
Beyond Spectral Clustering: Probabilistic Cuts for Differentiable Graph Partitioning
Probabilistic relaxations of graph cuts offer a differentiable alternative to spectral clustering, enabling end-to-end and online learning without eigendecompositions, yet prior work centered on RatioCut and lacked gener…
Contrastive Learninggraph partitioningDifferentiable Tripartite Modularity for Clustering Heterogeneous Graphs
Clustering heterogeneous relational data remains a central challenge in graph learning, particularly when interactions involve more than two types of entities. While differentiable modularity objectives such as DMoN have…
Graph Neural NetworkCommunity DetectionGraph LearningHierarchical Graph Representation Learning with Differentiable Pooling
Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node classificatio…
General ClassificationGraph ClassificationGraph Neural NetworkGraph Representation Learning+3Spectral Clustering with Graph Neural Networks for Graph Pooling
Spectral clustering (SC) is a popular clustering technique to find strongly connected communities on a graph. SC can be used in Graph Neural Networks (GNNs) to implement pooling operations that aggregate nodes belonging …
ClusteringGraph ClassificationGraph ClusteringGraph Neural Network+1Differentiable Hierarchical Graph Grouping for Multi-Person Pose Estimation
Multi-person pose estimation is challenging because it localizes body keypoints for multiple persons simultaneously. Previous methods can be divided into two streams, i.e. top-down and bottom-up methods. The top-down met…
2D Human Pose EstimationClusteringGraph ClusteringGraph Neural Network+4