%0 Journal Article %1 hu2019strategies %A Hu, Weihua %A Liu, Bowen %A Gomes, Joseph %A Zitnik, Marinka %A Liang, Percy %A Pande, Vijay %A Leskovec, Jure %D 2019 %K deep-learning graphs %T Strategies for Pre-training Graph Neural Networks %U http://arxiv.org/abs/1905.12265 %X Many applications of machine learning require a model to make accurate pre-dictions on test examples that are distributionally different from training ones, while task-specific labels are scarce during training. An effective approach to this challenge is to pre-train a model on related tasks where data is abundant, and then fine-tune it on a downstream task of interest. While pre-training has been effective in many language and vision domains, it remains an open question how to effectively use pre-training on graph datasets. In this paper, we develop a new strategy and self-supervised methods for pre-training Graph Neural Networks (GNNs). The key to the success of our strategy is to pre-train an expressive GNN at the level of individual nodes as well as entire graphs so that the GNN can learn useful local and global representations simultaneously. We systematically study pre-training on multiple graph classification datasets. We find that naive strategies, which pre-train GNNs at the level of either entire graphs or individual nodes, give limited improvement and can even lead to negative transfer on many downstream tasks. In contrast, our strategy avoids negative transfer and improves generalization significantly across downstream tasks, leading up to 9.4% absolute improvements in ROC-AUC over non-pre-trained models and achieving state-of-the-art performance for molecular property prediction and protein function prediction.

@article{hu2019strategies, abstract = {Many applications of machine learning require a model to make accurate pre-dictions on test examples that are distributionally different from training ones, while task-specific labels are scarce during training. An effective approach to this challenge is to pre-train a model on related tasks where data is abundant, and then fine-tune it on a downstream task of interest. While pre-training has been effective in many language and vision domains, it remains an open question how to effectively use pre-training on graph datasets. In this paper, we develop a new strategy and self-supervised methods for pre-training Graph Neural Networks (GNNs). The key to the success of our strategy is to pre-train an expressive GNN at the level of individual nodes as well as entire graphs so that the GNN can learn useful local and global representations simultaneously. We systematically study pre-training on multiple graph classification datasets. We find that naive strategies, which pre-train GNNs at the level of either entire graphs or individual nodes, give limited improvement and can even lead to negative transfer on many downstream tasks. In contrast, our strategy avoids negative transfer and improves generalization significantly across downstream tasks, leading up to 9.4% absolute improvements in ROC-AUC over non-pre-trained models and achieving state-of-the-art performance for molecular property prediction and protein function prediction.}, added-at = {2020-03-02T12:19:09.000+0100}, author = {Hu, Weihua and Liu, Bowen and Gomes, Joseph and Zitnik, Marinka and Liang, Percy and Pande, Vijay and Leskovec, Jure}, biburl = {https://www.bibsonomy.org/bibtex/2446111dee68a95a0f5493a9f414c2f42/kirk86}, description = {[1905.12265] Strategies for Pre-training Graph Neural Networks}, interhash = {7a392e669f4f3dd282438efc9ec2fbe9}, intrahash = {446111dee68a95a0f5493a9f414c2f42}, keywords = {deep-learning graphs}, note = {cite arxiv:1905.12265Comment: Accepted as a spotlight to ICLR 2020}, timestamp = {2020-03-02T12:19:09.000+0100}, title = {Strategies for Pre-training Graph Neural Networks}, url = {http://arxiv.org/abs/1905.12265}, year = 2019 }