Rethinking GNNs and Missing Features: Challenges, Evaluation and a Robust Solution
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 52 references that are in the map. First posted on arXiv 8 Jan 2026.
Builds on
26 of 52 references.
References · 26
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2017Neural Collaborative Filteringcited by 1,108
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018BRITS: Bidirectional Recurrent Imputation for Time Seriescited by 288
- 2019A Fair Comparison of Graph Neural Networks for Graph Classificationcited by 244
- 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
- 2020Handling Missing Data with Graph Representation Learningcited by 132
- 2021Filling the G_ap_s: Multivariate Time Series Imputation by Graph Neural Networkscited by 93
- 2024RelBench: A Benchmark for Deep Learning on Relational Databasescited by 90
- 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 62
- 2018Graphical Models for Processing Missing Datacited by 57
14 more
- 2025Position: Graph Learning Will Lose Relevance Due To Poor Benchmarkscited by 52
- 2020Graph Convolutional Networks for Graphs Containing Missing Featurescited by 46
- 2023Fair Attribute Completion on Graph with Missing Attributescited by 22
- 2024GraphLand: Evaluating Graph Machine Learning Models on Diverse Industrial Datacited by 20
- 2022The Missing Indicator Method: From Low to High Dimensionscited by 19
- 2025No Metric to Rule Them All: Toward Principled Evaluations of Graph-Learning Datasetscited by 16
- 2023Confidence-Based Feature Imputation for Graphs with Partially Known Featurescited by 13
- 2023Meta-Path Learning for Multi-relational Graph Neural Networkscited by 10
- 2025GraphBench: Next-generation graph learning benchmarkingcited by 8
- 2023Tractable Probabilistic Graph Representation Learning with Graph-Induced Sum-Product Networkscited by 7
- 2024A Self-Explainable Heterogeneous GNN for Relational Deep Learningcited by 7
- 2019Multi-hop Convolutions on Weighted Graphscited by 6
- 2025Bridging Theory and Practice in Link Representation with Graph Neural Networkscited by 4
- 2015Correcting for non-ignorable missingness in smoking trendscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Gated Graph Attention Networks with Learnable Temperature28 May 2026