Bahare Fatemi, Layla Asri, Seyed Kazemi
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.
Graph neural networks (GNNs) work well when the graph structure is provided. However, this structure may not always be available in real-world applications. One solution to this problem is to infer a task-specific latent structure and then apply a GNN to the inferred graph. Unfortunately, the space of possible graph structures grows super-exponentially with the number of nodes and so the taskspecific supervision may be insufficient for learning both the structure and the GNN parameters. In this work, we propose the Simultaneous Learning of Adjacency and GNN Parameters with Self-supervision, or SLAPS, a method that provides more supervision for inferring a graph structure through self-supervision. A comprehensive experimental study demonstrates that SLAPS scales to large graphs with hundreds of thousands of nodes and outperforms several models that have been proposed to learn a task-specific graph structure on established benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2102.05034")
get_code_for_paper("2102.05034")
have("2102.05034")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2102.05034.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2102.05034)
Connect an agent — have() is free.