简介

     Graph Neural Networks (GNNs) have recently achieved significant success in processing non-Euclidean datasets, such as social and protein-protein interaction networks. However, these datasets often contain inherent uncertainties, such as missing edges between nodes that are closely related. Variational Graph Auto-Encoders (VGAE) and other Bayesian methods have been proposed to address the problem. Unfortunately, they can't handle graph data effectively. VGAE, for instance, the posterior is assumed to be Gaussian, which can not match the true posterior well. To overcome these limitations, a normalizing flows(NFs) based on variational GNN is proposed in this paper. Unlike VGAE, our approach no longer assumes that the posterior distribution is a standard Gaussian distribution, but instead utilizes NFs to learn more complex and flexible distributions. NFs transforms simple distributions into complex ones through a series of invertible transformations. The transformed distribution is more flexible and can match the true distribution better. Specifically, in order to obtain the reversible transformer, inspired by RealNVP, affine transformations on graphs are used to map a simple distribution to a complex one. The transformed distribution can infer more complex distributions like skewed. We conduct experiments in the link prediction task and our method performs excellently compared with other methods and even achieves state-of-the-art results on some datasets.

full paper