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.
Deep learning on graphs has become a popular research topic with many applications. However, past work has concentrated on learning graph embedding tasks, which is in contrast with advances in generative models for images and text. Is it possible to transfer this progress to the domain of graphs? We propose to sidestep hurdles associated with linearization of such discrete structures by having a decoder output a probabilistic fully-connected graph of a predefined maximum size directly at once. Our method is formulated as a variational autoencoder. We evaluate on the challenging task of molecule generation.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1802.03480")
get_code_for_paper("1802.03480")
have("1802.03480")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1802.03480.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1802.03480)
Connect an agent — have() is free.