Mitigating Structural Overfitting: A Distribution-Aware Rectification Framework for Missing Feature Imputation
Yifan Song, Fenglin Yu, Yihong Luo, Xingjian Tao, Siya Qiu, Kai Han, Jing Tang
摘要
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 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 realworld 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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper19
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li 等AAAI 2020 · 被引用 1,353 次
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan 等ICLR 2020 · 被引用 1,155 次
- GraphMAE: Self-Supervised Masked Graph AutoencodersZhenyu Hou, Xiao Liu, Yukuo Cen, Yuxiao Dong 等KDD 2022 · 被引用 533 次
- Symmetric Graph Convolutional Autoencoder for Unsupervised Graph Representation LearningJiwoong Park, Minsik Lee, Hyung Jin Chang, Kyuewang Lee 等ICCV 2019 · 被引用 280 次
相关 Paper
- Learning the Latent Structure: A Feature-Centric Approach to Graph Data AugmentationYu Song, Zhigang Hua, Yan Xie, Bingheng Li 等AAAI 2026
- GLAD: Bidirectional Structure-Attribute Alignment via Latent Graph Diffusion ModelsJiankai Zuo, Yu Zhang, Yang Zhang, Zihao Yao 等ICML 2026
- MIGDiff: Multi-attributes Imputations for Attribute-missing Graphs via Graph Denoising Diffusion ModelYe Liu, Yang Chen, Hongmin CaiAAAI 2026
- Simple yet Effective Diffusion-based Graph Data Augmentation via Complementary Diffusion TransferLonglong Lin, Youan Zhang, Zeli Wang, Xin LuoKDD 2026
- Propagate and Inject: Revisiting Propagation-Based Feature Imputation for Graphs with Partially Observed FeaturesDaeho Um, Sunoh Kim, Jiwoong Park, Jongin Lim 等ICML 2025
