William Wei Wang

A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks

Oversmoothing is a central challenge of building more powerful Graph Neural Networks (GNNs). While previous works have only demonstrated that oversmoothing is inevitable when the number of graph convolutions tends to infinity, in this paper, we precisely characterize the mechanism behind the phenome…