Learning Discrete Structures for Graph Neural Networks
Luca Franceschi, Mathias Niepert, Massimiliano Pontil, Xiao He
Proceedings of the 36th International Conference on Machine Learning (ICML), pp. 1–11, 2019.
Abstract
Graph neural networks (GNNs) are a popular class of machine learning models whose major advantage is their ability to incorporate a sparse and discrete dependency structure between data points. Unfortunately, GNNs can only be used when such a graph-structure is available. In practice, however, real-world graphs are often noisy and incomplete or might not be available at all. With this work, we propose to jointly learn the graph structure and the parameters of graph convolutional networks (GCNs) by approximately solving a bilevel program that learns a discrete probability distribution on the edges of the graph. This allows one to apply GCNs not only in scenarios where the given graph is incomplete or corrupted but also in those where a graph is not available. We conduct a series of experiments that analyze the behavior of the proposed method and demonstrate that it outperforms related methods by a significant margin.Links
BibTeX
@inproceedings{franceschi19_icml,
title = {Learning Discrete Structures for Graph Neural Networks},
author = {Franceschi, Luca and Niepert, Mathias and Pontil, Massimiliano and He, Xiao},
year = {2019},
booktitle = {Proceedings of the 36th International Conference on Machine Learning (ICML)},
pages = {1--11},
url = {http://proceedings.mlr.press/v97/franceschi19a/franceschi19a.pdf}
}