paper-with-me

Papers

Modality as Heterogeneity: Node Splitting and Graph Rewiring for Multimodal Graph Learning

2026-01-20 · Yihan Zhang, Ercan E. Kuruoglu arxiv

Multimodal graphs are gaining increasing attention due to their rich representational power and wide applicability, yet they introduce substantial challenges arising from severe modality confusion. To address this issue, we propose NSG (Node Splitting Graph)-MoE, a multimodal graph learning framework that integrates a node-splitting and graph-rewiring mechanism with a structured Mixture-of-Experts (MoE) architecture. It explicitly decomposes each node into modality-specific components and assigns relation-aware experts to process heterogeneous message flows, thereby preserving structural information and multimodal semantics while mitigating the undesirable mixing effects commonly observed in general-purpose GNNs. Extensive experiments on three multimodal benchmarks demonstrate that NSG-MoE consistently surpasses strong baselines. Despite incorporating MoE -- which is typically computationally heavy -- our method achieves competitive training efficiency. Beyond empirical results, we provide a spectral analysis revealing that NSG performs adaptive filtering over modality-specific subspaces, thus explaining its disentangling behavior. Furthermore, an information-theoretic analysis shows that the architectural constraints imposed by NSG reduces mutual information between data and parameters and improving generalization capability.

📄 PDF Abstract BibTeX arXiv:2602.00067

Code (0)

등록된 구현이 없습니다.

Tasks

Graph Learning

Similar Papers 제목 키워드 기반

Performance Heterogeneity in Graph Neural Networks: Lessons for Architecture Design and Preprocessing

2025-03-01 · Lukas Fesser, Melanie Weber

Graph Neural Networks have emerged as the most popular architecture for graph-level learning, including graph classification and regression tasks, which frequently arise in areas such as biochemistry and drug discovery. …

Drug DiscoveryGraph Classification

Commute-Time-Optimised Graphs for GNNs

2024-07-09 · Igor Sterner, Shiye Su, Petar Veličković

We explore graph rewiring methods that optimise commute time. Recent graph rewiring approaches facilitate long-range interactions in sparse graphs, making such rewirings commute-time-optimal on average. However, when an …

Over-Squashing in GNNs and Causal Inference of Rewiring Strategies

2025-08-12 · Danial Saber, Amirali Salehi-Abari arxiv

Graph neural networks (GNNs) have exhibited state-of-the-art performance across wide-range of domains such as recommender systems, material design, and drug repurposing. Yet message-passing GNNs suffer from over-squashin…

Graph ClassificationNode ClassificationCausal Inference

It Takes a Graph to Know a Graph: Rewiring for Homophily with a Reference Graph

2025-05-18 · Harel Mendelman, Haggai Maron, Ronen Talmon

Graph Neural Networks (GNNs) excel at analyzing graph-structured data but struggle on heterophilic graphs, where connected nodes often belong to different classes. While this challenge is commonly addressed with speciali…

Node Classification

PANDA: Expanded Width-Aware Message Passing Beyond Rewiring

2024-06-06 · Jeongwhan Choi, Sumin Park, Hyowon Wi, Sung-Bae Cho 외

Recent research in the field of graph neural network (GNN) has identified a critical issue known as "over-squashing," resulting from the bottleneck phenomenon in graph structures, which impedes the propagation of long-ra…

Graph ClassificationGraph Neural NetworkGraph RegressionNode Classification