We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In this paper, we present a general framework to scale graph autoencoders (AE) and graph variational autoencoders (VAE). This framework leverages graph degeneracy concepts to train models only from a dense subset of nodes instead of using the entire graph. Together with a simple yet effective propagation mechanism, our approach significantly improves scalability and training speed while preserving performance. We evaluate and discuss our method on several variants of existing graph AE and VAE, providing the first application of these models to large graphs with up to millions of nodes and edges. We achieve empirically competitive results w.r.t. several popular scalable node embedding methods, which emphasizes the relevance of pursuing further research towards more scalable graph AE and VAE.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1902.08813")
get_code_for_paper("1902.08813")
have("1902.08813")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1902.08813.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1902.08813)
Connect an agent — have() is free.