Mixture of Message Passing Experts with Routing Entropy Regularization for Node Classification

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Chen, Xuanze, Zhou, Jiajun, Li, Yadong, Chen, Jinsong, Yu, Shanqing, Xuan, Qi
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912702713036800
author Chen, Xuanze
Zhou, Jiajun
Li, Yadong
Chen, Jinsong
Yu, Shanqing
Xuan, Qi
author_facet Chen, Xuanze
Zhou, Jiajun
Li, Yadong
Chen, Jinsong
Yu, Shanqing
Xuan, Qi
contents Graph neural networks (GNNs) have achieved significant progress in graph-based learning tasks, yet their performance often deteriorates when facing heterophilous structures where connected nodes differ substantially in features and labels. To address this limitation, we propose GNNMoE, a novel entropy-driven mixture of message-passing experts framework that enables node-level adaptive representation learning. GNNMoE decomposes message passing into propagation and transformation operations and integrates them through multiple expert networks guided by a hybrid routing mechanism. And a routing entropy regularization dynamically adjusts soft weighting and soft top-$k$ routing, allowing GNNMoE to flexibly adapt to diverse neighborhood contexts. Extensive experiments on twelve benchmark datasets demonstrate that GNNMoE consistently outperforms SOTA node classification methods, while maintaining scalability and interpretability. This work provides a unified and principled approach for achieving fine-grained, personalized node representation learning.
format Preprint
id arxiv_https___arxiv_org_abs_2502_08083
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Mixture of Message Passing Experts with Routing Entropy Regularization for Node Classification
Chen, Xuanze
Zhou, Jiajun
Li, Yadong
Chen, Jinsong
Yu, Shanqing
Xuan, Qi
Machine Learning
Social and Information Networks
Graph neural networks (GNNs) have achieved significant progress in graph-based learning tasks, yet their performance often deteriorates when facing heterophilous structures where connected nodes differ substantially in features and labels. To address this limitation, we propose GNNMoE, a novel entropy-driven mixture of message-passing experts framework that enables node-level adaptive representation learning. GNNMoE decomposes message passing into propagation and transformation operations and integrates them through multiple expert networks guided by a hybrid routing mechanism. And a routing entropy regularization dynamically adjusts soft weighting and soft top-$k$ routing, allowing GNNMoE to flexibly adapt to diverse neighborhood contexts. Extensive experiments on twelve benchmark datasets demonstrate that GNNMoE consistently outperforms SOTA node classification methods, while maintaining scalability and interpretability. This work provides a unified and principled approach for achieving fine-grained, personalized node representation learning.
title Mixture of Message Passing Experts with Routing Entropy Regularization for Node Classification
topic Machine Learning
Social and Information Networks
url https://arxiv.org/abs/2502.08083