pith. sign in

arxiv: 1811.02798 · v1 · pith:SBJFDU6Nnew · submitted 2018-11-07 · 💻 cs.LG · stat.ML

Multi-Task Graph Autoencoders

classification 💻 cs.LG stat.ML
keywords graphlearningnoderepresentationavailableclassificationlinkmodel
0
0 comments X
read the original abstract

We examine two fundamental tasks associated with graph representation learning: link prediction and node classification. We present a new autoencoder architecture capable of learning a joint representation of local graph structure and available node features for the simultaneous multi-task learning of unsupervised link prediction and semi-supervised node classification. Our simple, yet effective and versatile model is efficiently trained end-to-end in a single stage, whereas previous related deep graph embedding methods require multiple training steps that are difficult to optimize. We provide an empirical evaluation of our model on five benchmark relational, graph-structured datasets and demonstrate significant improvement over three strong baselines for graph representation learning. Reference code and data are available at https://github.com/vuptran/graph-representation-learning

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graph Star Net for Generalized Multi-Task Learning

    cs.SI 2019-06 unverdicted novelty 6.0

    GraphStar is a new GNN that adds star nodes and relay attention to achieve non-local representations for node, graph, and link tasks, claiming 2-5% gains over prior SOTA on benchmarks.