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.
This paper presents a new Graph Neural Network (GNN) type using feature-wise linear modulation (FiLM). Many standard GNN variants propagate information along the edges of a graph by computing "messages" based only on the representation of the source of each edge. In GNN-FiLM, the representation of the target node of an edge is additionally used to compute a transformation that can be applied to all incoming messages, allowing feature-wise modulation of the passed information. Results of experiments comparing different GNN architectures on three tasks from the literature are presented, based on re-implementations of baseline methods. Hyperparameters for all methods were found using extensive search, yielding somewhat surprising results: differences between baseline models are smaller than reported in the literature. Nonetheless, GNN-FiLM outperforms baseline methods on a regression task on molecular graphs and performs competitively on other tasks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1906.12192")
get_code_for_paper("1906.12192")
have("1906.12192")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1906.12192.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1906.12192)
Connect an agent — have() is free.