Rethinking GNNs and Missing Features: Challenges, Evaluation and a Robust Solution

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Ferrini, Francesco, Lachi, Veronica, Longa, Antonio, Lepri, Bruno, Akiyoshi, Matono, Passerini, Andrea, Liu, Xin, Jaeger, Manfred
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918507459903488
author Ferrini, Francesco
Lachi, Veronica
Longa, Antonio
Lepri, Bruno
Akiyoshi, Matono
Passerini, Andrea
Liu, Xin
Jaeger, Manfred
author_facet Ferrini, Francesco
Lachi, Veronica
Longa, Antonio
Lepri, Bruno
Akiyoshi, Matono
Passerini, Andrea
Liu, Xin
Jaeger, Manfred
contents Handling missing node features is a key challenge for deploying Graph Neural Networks (GNNs) in real-world domains such as healthcare and sensor networks. Existing studies mostly address relatively benign scenarios, namely benchmark datasets with (a) high-dimensional but sparse node features and (b) incomplete data generated under Missing Completely At Random (MCAR) mechanisms. For (a), we theoretically prove that high sparsity substantially limits the information loss caused by missingness, making all models appear robust and preventing a meaningful comparison of their performance. To overcome this limitation, we introduce one synthetic and three real-world datasets with dense, semantically meaningful features. For (b), we move beyond MCAR and design evaluation protocols with more realistic missingness mechanisms. Moreover, we provide a theoretical background to state explicit assumptions on the missingness process and analyze their implications for different methods. Building on this analysis, we propose GNNmim, a simple yet effective baseline for node classification with incomplete feature data. Experiments show that GNNmim is competitive with respect to specialized architectures across diverse datasets and missingness regimes.
format Preprint
id arxiv_https___arxiv_org_abs_2601_04855
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Rethinking GNNs and Missing Features: Challenges, Evaluation and a Robust Solution
Ferrini, Francesco
Lachi, Veronica
Longa, Antonio
Lepri, Bruno
Akiyoshi, Matono
Passerini, Andrea
Liu, Xin
Jaeger, Manfred
Machine Learning
Artificial Intelligence
Handling missing node features is a key challenge for deploying Graph Neural Networks (GNNs) in real-world domains such as healthcare and sensor networks. Existing studies mostly address relatively benign scenarios, namely benchmark datasets with (a) high-dimensional but sparse node features and (b) incomplete data generated under Missing Completely At Random (MCAR) mechanisms. For (a), we theoretically prove that high sparsity substantially limits the information loss caused by missingness, making all models appear robust and preventing a meaningful comparison of their performance. To overcome this limitation, we introduce one synthetic and three real-world datasets with dense, semantically meaningful features. For (b), we move beyond MCAR and design evaluation protocols with more realistic missingness mechanisms. Moreover, we provide a theoretical background to state explicit assumptions on the missingness process and analyze their implications for different methods. Building on this analysis, we propose GNNmim, a simple yet effective baseline for node classification with incomplete feature data. Experiments show that GNNmim is competitive with respect to specialized architectures across diverse datasets and missingness regimes.
title Rethinking GNNs and Missing Features: Challenges, Evaluation and a Robust Solution
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2601.04855