mlsanityData to 14 Oct 2026

P-DROP: Poisson-Based Dropout for Graph Neural Networks

arXiv 2505.21783 ↗First posted 27 May 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Over-smoothing remains a major challenge in Graph Neural Networks (GNNs), where repeated message passing causes node representations to converge and lose discriminative power. To address this, we propose a novel node selection strategy based on Poisson processes, introducing stochastic but structure-aware updates. Specifically, we equip each node with an independent Poisson clock, enabling asynchronous and localized updates that preserve structural diversity. We explore two applications of this strategy: as a replacement for dropout-based regularization and as a dynamic subgraph training scheme. Experimental results on standard benchmarks (Cora, Citeseer, Pubmed) demonstrate that our Poisson-based method yields competitive or improved accuracy compared to traditional Dropout, DropEdge, and DropNode approaches, particularly in later training stages.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 10 references that are in the map. First posted on arXiv 27 May 2025.

Builds on

6 of 10 references.

References · 6

  1. 2017Graph Attention Networkscited by 8,923
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2019DropEdge: Towards Deep Graph Convolutional Networks on Node Classificationcited by 680
  4. 2015An Introduction to Convolutional Neural Networkscited by 514
  5. 2023A Survey on Oversmoothing in Graph Neural Networkscited by 247
  6. 2022DropMessage: Unifying Random Dropping for Graph Neural Networkscited by 29

Built on by

Not cited yet.