Evaluating Robustness and Uncertainty of Graph Models Under Structural Distributional Shifts
Gleb Bazhenov, Denis Kuznedelev, Andrey Malinin, Artem Babenko,, Liudmila Prokhorenkova

TL;DR
This paper introduces a method to evaluate the robustness of graph models under structural distributional shifts, revealing challenges for existing models and highlighting a trade-off between representation quality and distributional separation.
Contribution
It proposes a novel approach to induce structural distributional shifts in graph data and evaluates their impact on various graph models.
Findings
Structural shifts are challenging for current models.
Simple models often outperform complex ones under shifts.
There is a trade-off between representation quality and distributional separation.
Abstract
In reliable decision-making systems based on machine learning, models have to be robust to distributional shifts or provide the uncertainty of their predictions. In node-level problems of graph learning, distributional shifts can be especially complex since the samples are interdependent. To evaluate the performance of graph models, it is important to test them on diverse and meaningful distributional shifts. However, most graph benchmarks considering distributional shifts for node-level problems focus mainly on node features, while structural properties are also essential for graph problems. In this work, we propose a general approach for inducing diverse distributional shifts based on graph structure. We use this approach to create data splits according to several structural node properties: popularity, locality, and density. In our experiments, we thoroughly evaluate the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Data Quality and Management
