Graph Learning Network: A Structure Learning Algorithm

Darwin Danilo Saire Pilco, Adín Ramírez Rivera

Abstract: Graph prediction methods that work closely with the structure of the data, e.g., graph generation, commonly ignore the content of its nodes. On the other hand, the solutions that consider the node’s information, e.g., classification, ignore the structure of the whole. And some methods exist in between, e.g., link prediction, but predict the structure piece-wise instead of considering the graph as a whole. We hypothesize that by jointly predicting the structure of the graph and its nodes’ features, we can improve both tasks. We propose the Graph Learning Network (GLN), a simple yet effective process to learn node embeddings and structure prediction functions. Our model uses graph convolutions to propose expected node features, and predict the best structure based on them. We repeat these steps sequentially to enhance the prediction and the embeddings. In contrast to existing generation methods that rely only on the structure of the data, we use the feature on the nodes to predict better relations, similar to what link prediction methods do. However, we propose an holistic approach to process the whole graph for our predictions. Our experiments show that our method predicts consistent structures across a set of problems, while creating meaningful node embeddings.

Keywords: graph prediction, graph structure learning, graph neural network

TL;DR: Methods for simultaneous prediction of nodes' feature embeddings and adjacency matrix, and how to learn this process.

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/arxiv:1905.12665/code)