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

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.
View on arXiv@article{yun2025_2505.21783, title={ P-DROP: Poisson-Based Dropout for Graph Neural Networks }, author={ Hyunsik Yun }, journal={arXiv preprint arXiv:2505.21783}, year={ 2025 } }