mlsanityData to 7 Oct 2026

DEGNN: Dual Experts Graph Neural Network Handling Both Edge and Node Feature Noise

arXiv 2404.09207 ↗First posted 14 Apr 2024cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph Neural Networks (GNNs) have achieved notable success in various applications over graph data. However, recent research has revealed that real-world graphs often contain noise, and GNNs are susceptible to noise in the graph. To address this issue, several Graph Structure Learning (GSL) models have been introduced. While GSL models are tailored to enhance robustness against edge noise through edge reconstruction, a significant limitation surfaces: their high reliance on node features. This inherent dependence amplifies their susceptibility to noise within node features. Recognizing this vulnerability, we present DEGNN, a novel GNN model designed to adeptly mitigate noise in both edges and node features. The core idea of DEGNN is to design two separate experts: an edge expert and a node feature expert. These experts utilize self-supervised learning techniques to produce modified edges and node features. Leveraging these modified representations, DEGNN subsequently addresses downstream tasks, ensuring robustness against noise present in both edges and node features of real-world graphs. Notably, the modification process can be trained end-to-end, empowering DEGNN to adjust dynamically and achieves optimal edge and node representations for specific tasks. Comprehensive experiments demonstrate DEGNN's efficacy in managing noise, both in original real-world graphs and in graphs with synthetic noise.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 38 references that are in the map. First posted on arXiv 14 Apr 2024.

Builds on

23 of 38 references.

References · 23

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  2. 2017Graph Attention Networkscited by 8,854
  3. 2017Inductive Representation Learning on Large Graphscited by 6,284
  4. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  6. 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,571
  7. 2019MixMatch: A Holistic Approach to Semi-Supervised Learningcited by 1,390
  8. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  9. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  10. 2018Link Prediction Based on Graph Neural Networkscited by 829
  11. 2019Graph Neural Networks for Social Recommendationcited by 711
  12. 2020Deep Graph Contrastive Representation Learningcited by 535
11 more
  1. 2020Graph Structure Learning for Robust Graph Neural Networkscited by 368
  2. 2018Adversarial Attack on Graph Structured Datacited by 300
  3. 2021Graph Self-Supervised Learning: A Surveycited by 289
  4. 2019Learning Discrete Structures for Graph Neural Networkscited by 228
  5. 2020Data Augmentation for Graph Neural Networkscited by 200
  6. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  7. 2020Graph Information Bottleneckcited by 168
  8. 2017Encoding Sentences with Graph Convolutional Networks for Semantic Role Labelingcited by 137
  9. 2021Simplifying approach to Node Classification in Graph Neural Networkscited by 56
  10. 2022Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNNcited by 34
  11. 2022Robust Graph Neural Networks using Weighted Graph Laplaciancited by 4

Built on by

Not cited yet.