TL;DR
This paper introduces a noise-resilient unsupervised graph representation learning method called MQE, which estimates feature quality across multiple hops to improve robustness against noisy node features in real-world data.
Contribution
The paper proposes a novel multi-hop feature quality estimation approach that enhances unsupervised graph learning by effectively handling noisy node features.
Findings
MQE improves representation quality in noisy scenarios
The method outperforms existing UGRL models on real-world datasets
Feature quality estimation reduces noise impact on learned embeddings
Abstract
Unsupervised graph representation learning (UGRL) based on graph neural networks (GNNs), has received increasing attention owing to its efficacy in handling graph-structured data. However, existing UGRL methods ideally assume that the node features are noise-free, which makes them fail to distinguish between useful information and noise when applied to real data with noisy features, thus affecting the quality of learned representations. This urges us to take node noisy features into account in real-world UGRL. With empirical analysis, we reveal that feature propagation, the essential operation in GNNs, acts as a "double-edged sword" in handling noisy features - it can both denoise and diffuse noise, leading to varying feature quality across nodes, even within the same node at different hops. Building on this insight, we propose a novel UGRL method based on Multi-hop feature Quality…
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.
Taxonomy
MethodsSoftmax · Attention Is All You Need
