TL;DR
This paper introduces the extbf{ extbackslash DART} framework to mitigate structural overfitting in missing feature imputation for graph learning, using global augmentation, semantic rectification, and distribution correction.
Contribution
It proposes a novel distribution-aware rectification framework with global augmentation and test-time distribution correction for improved missing feature imputation in graphs.
Findings
extbf{ extbackslash DART} outperforms state-of-the-art methods on six datasets.
The framework effectively bridges distribution gaps in inductive tasks.
Experiments on a new Sailing dataset demonstrate real-world applicability.
Abstract
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 \textbf{\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…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
