We lifted 6 functions out of this paper's own repositories and ran 5 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| tonyauyeung/local2gae2global | canonical | 5 of 6 |
| Function | Status | Where it lives |
|---|---|---|
| get_patch_size | Ran | tonyauyeung/local2gae2global/L2G2L/plot.py code served (permissive licence) · get_code("a5ba5294f0a75129") |
| get_roc_score | Ran | tonyauyeung/local2gae2global/L2G2L/utils.py code served (permissive licence) · get_code("6f43d13447924bf1") |
| loss_GAE | Ran | tonyauyeung/local2gae2global/L2G2L/functional.py code served (permissive licence) · get_code("8b9bd65d4eff6aa5") |
| loss_VGAE | Ran | tonyauyeung/local2gae2global/L2G2L/functional.py code served (permissive licence) · get_code("a8334ca6d8b7c9e9") |
| synthetic_data | Ran | tonyauyeung/local2gae2global/L2G2L/utils.py code served (permissive licence) · get_code("b147978709266742") |
| load_data | Not yet run | tonyauyeung/local2gae2global/L2G2L/utils.py code served (permissive licence) · get_code("84a2672294189c38") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
For analysing real-world networks, graph representation learning is a popular tool. These methods, such as a graph autoencoder (GAE), typically rely on low-dimensional representations, also called embeddings, which are obtained through minimising a loss function; these embeddings are used with a decoder for downstream tasks such as node classification and edge prediction. While GAEs tend to be fairly accurate, they suffer from scalability issues. For improved speed, a Local2Global approach, which combines graph patch embeddings based on eigenvector synchronisation, was shown to be fast and achieve good accuracy. Here we propose L2G2G, a Local2Global method which improves GAE accuracy without sacrificing scalability. This improvement is achieved by dynamically synchronising the latent node representations, while training the GAEs. It also benefits from the decoder computing an only local patch loss. Hence, aligning the local embeddings in each epoch utilises more information from the graph than a single post-training alignment does, while maintaining scalability. We illustrate on synthetic benchmarks, as well as real-world examples, that L2G2G achieves higher accuracy than the standard Local2Global approach and scales efficiently on the larger data sets. We find that for large and dense networks, it even outperforms the slow, but assumed more accurate, GAEs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.01614")
get_code_for_paper("2402.01614")
have("2402.01614")
Connect an agent — have() is free.