mlsanityData to 7 Oct 2026

Layer-diverse Negative Sampling for Graph Neural Networks

arXiv 2403.11408 ↗First posted 18 Mar 2024cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Graph neural networks (GNNs) are a powerful solution for various structure learning applications due to their strong representation capabilities for graph data. However, traditional GNNs, relying on message-passing mechanisms that gather information exclusively from first-order neighbours (known as positive samples), can lead to issues such as over-smoothing and over-squashing. To mitigate these issues, we propose a layer-diverse negative sampling method for message-passing propagation. This method employs a sampling matrix within a determinantal point process, which transforms the candidate set into a space and selectively samples from this space to generate negative samples. To further enhance the diversity of the negative samples during each forward pass, we develop a space-squeezing method to achieve layer-wise diversity in multi-layer GNNs. Experiments on various real-world graph datasets demonstrate the effectiveness of our approach in improving the diversity of negative samples and overall learning performance. Moreover, adding negative samples dynamically changes the graph's topology, thus with the strong potential to improve the expressiveness of GNNs and reduce the risk of over-squashing.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 26 of its 36 references that are in the map. First posted on arXiv 18 Mar 2024.

Builds on

26 of 36 references.

References · 26

  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. 2018How Powerful are Graph Neural Networks?cited by 4,355
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2018Pitfalls of Graph Neural Network Evaluationcited by 994
  8. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
  9. 2021How Attentive are Graph Attention Networks?cited by 818
  10. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 679
  11. 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
  12. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
14 more
  1. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 544
  2. 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
  3. 2019PairNorm: Tackling Oversmoothing in GNNscited by 297
  4. 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 104
  5. 2022How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervisioncited by 102
  6. 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
  7. 2021How Framelets Enhance Graph Neural Networkscited by 46
  8. 2020Graph Convolutional Network for Recommendation with Low-pass Collaborative Filterscited by 32
  9. 2020Let's Agree to Degree: Comparing Graph Convolutional Networks in the Message-Passing Frameworkcited by 24
  10. 2023Towards Deep Attention in Graph Neural Networks: Problems and Remediescited by 24
  11. 2019Improving the Similarity Measure of Determinantal Point Processes for Extractive Multi-Document Summarizationcited by 22
  12. 2017Fluid Communities: A Competitive, Scalable and Diverse Community Detection Algorithmcited by 16
  13. 2022Learning from the Dark: Boosting Graph Convolutional Neural Networks with Diverse Negative Samplescited by 10
  14. 2022Graph Convolutional Neural Networks with Diverse Negative Samples via Decomposed Determinant Point Processescited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 2; 2026: 2.

7 papers.