Fast Graph Learning with Unique Optimal Solutions

Abstract

We consider two popular Graph Representation Learning (GRL) methods: message passing for node classification and network embedding for link prediction. For each, we pick a popular model that we: (i) linearize and (ii) and switch its training objective to Frobenius norm error minimization. These simplifications can cast the training into finding the optimal parameters in closed-form. We program in TensorFlow a functional form of Truncated Singular Value Decomposition (SVD), such that, we could decompose a dense matrix $\mathbf{M}$, without explicitly computing $\mathbf{M}$. We achieve competitive performance on popular GRL tasks while providing orders of magnitude speedup. We open-source our code at http://github.com/samihaija/tf-fsvd

References in corpus (11)

• Distributed Representations of Words and Phrases and their Compositionality
• Inductive Representation Learning on Large Graphs
• Fast Graph Representation Learning with PyTorch Geometric
• Simplifying Graph Convolutional Networks
• Open Graph Benchmark: Datasets for Machine Learning on Graphs
• Simple and Deep Graph Convolutional Networks
• Link Prediction Based on Graph Neural Networks
• SIGN: Scalable Inception Graph Neural Networks
• Watch Your Step: Learning Node Embeddings via Graph Attention
• Fast, Warped Graph Embedding: Unifying Framework and One-Click Algorithm
• Global Attention Improves Graph Networks Generalization