2000 character limit reached
FastGAE: Scalable Graph Autoencoders with Stochastic Subgraph Decoding (2002.01910v5)
Published 5 Feb 2020 in cs.LG, cs.SI, and stat.ML
Abstract: Graph autoencoders (AE) and variational autoencoders (VAE) are powerful node embedding methods, but suffer from scalability issues. In this paper, we introduce FastGAE, a general framework to scale graph AE and VAE to large graphs with millions of nodes and edges. Our strategy, based on an effective stochastic subgraph decoding scheme, significantly speeds up the training of graph AE and VAE while preserving or even improving performances. We demonstrate the effectiveness of FastGAE on various real-world graphs, outperforming the few existing approaches to scale graph AE and VAE by a wide margin.
- Guillaume Salha (9 papers)
- Romain Hennequin (47 papers)
- Jean-Baptiste Remy (2 papers)
- Manuel Moussallam (18 papers)
- Michalis Vazirgiannis (116 papers)