Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputation
Not on the map. Why?
Abstract (arXiv)
Incomplete node features are ubiquitous in real-world scenarios such as user profiling and cold-start recommendation, which severely hinders the practical deployment of graph learning systems (e.g., GNNs). Existing solutions typically rely on diffusion-based structural smoothing (e.g., feature propagation) to impute missing values. However, we find that these approaches suffer from structural overfitting, leading to three progressive challenges: 1) performance degradation on disjoint graphs, 2) loss of semantic diversity due to over-smoothing, and 3) feature distribution shift when generalizing to unseen graph structures (inductive tasks). To address these challenges, we introduce the DART framework. It begins by employing em Global Structural Augmentation (GSA), which establishes global correlations to bridge disjoint components and extend diffusion coverage. Building upon this, we design a semantic rectifier based on masked autoencoding. This module learns the latent feature manifold to recover natural semantic details. Crucially, we introduce a test-time distribution rectification mechanism that projects structurally biased features back onto the learned manifold during inference, effectively bridging the inductive distribution gap. Furthermore, considering that synthetic masking fails to reflect real-world sparsity, we present a new dataset Sailing collected from voyage records with naturally missing attributes. Extensive experiments on six public datasets and Sailing demonstrate that DART significantly outperforms state-of-the-art methods in both transductive and inductive settings. Our code and dataset are available at https://github.com/yfsong00/DART.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 50 references that are in the map. First posted on arXiv 6 Dec 2025.
Builds on
23 of 50 references.
References · 23
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
- 2022GraphMAE: Self-Supervised Masked Graph Autoencoderscited by 443
- 2020Social-STGCNN: A Social Spatio-Temporal Graph Convolutional Neural Network for Human Trajectory Predictioncited by 324
- 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
- 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
- 2020Handling Missing Data with Graph Representation Learningcited by 132
- 2019Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation Learningcited by 94
- 2019Inductive Matrix Completion Based on Graph Neural Networkscited by 85
11 more
- 2021On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Featurescited by 62
- 2019STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systemscited by 54
- 2020Graph Convolutional Networks for Graphs Containing Missing Featurescited by 46
- 2020Learning on Attribute-Missing Graphscited by 42
- 2022T2-GNN: Graph Neural Networks for Graphs with Incomplete Features and Structure via Teacher-Student Distillationcited by 32
- 2019Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRankcited by 25
- 2020Incomplete Graph Representation and Learning via Partial Graph Neural Networkscited by 16
- 2023LSGNN: Towards General Graph Neural Network in Node Classification by Local Similaritycited by 15
- 2023Confidence-Based Feature Imputation for Graphs with Partially Known Featurescited by 13
- 2025Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphscited by 9
- 2024Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classificationcited by 4
Built on by
Not cited yet.