LGDec 7, 2023

GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Experts

Stanford
arXiv:2312.04693v323 citationsh-index: 149Has CodeNIPS
Originality Incremental advance
AI Analysis

It addresses generalization challenges for graph data in machine learning, representing an incremental advance with a novel hybrid method.

The paper tackles the problem of building graph neural networks that generalize to complex distributional shifts in real-world graph data, achieving state-of-the-art results with improvements of 67% and 4.2% on WebKB and Twitch datasets from the GOOD benchmark.

Graph data are inherently complex and heterogeneous, leading to a high natural diversity of distributional shifts. However, it remains unclear how to build machine learning architectures that generalize to the complex distributional shifts naturally occurring in the real world. Here, we develop GraphMETRO, a Graph Neural Network architecture that models natural diversity and captures complex distributional shifts. GraphMETRO employs a Mixture-of-Experts (MoE) architecture with a gating model and multiple expert models, where each expert model targets a specific distributional shift to produce a referential representation w.r.t. a reference model, and the gating model identifies shift components. Additionally, we design a novel objective that aligns the representations from different expert models to ensure reliable optimization. GraphMETRO achieves state-of-the-art results on four datasets from the GOOD benchmark, which is comprised of complex and natural real-world distribution shifts, improving by 67% and 4.2% on the WebKB and Twitch datasets. Code and data are available at https://github.com/Wuyxin/GraphMETRO.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes