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) have been successfully applied in many structured data domains, with applications ranging from molecular property prediction to the analysis of social networks. Motivated by the broad applicability of GNNs, we propose the family of so-called RankGNNs, a combination of neural Learning to Rank (LtR) methods and GNNs. RankGNNs are trained with a set of pair-wise preferences between graphs, suggesting that one of them is preferred over the other. One practical application of this problem is drug screening, where an expert wants to find the most promising molecules in a large collection of drug candidates. We empirically demonstrate that our proposed pair-wise RankGNN approach either significantly outperforms or at least matches the ranking performance of the naive point-wise baseline approach, in which the LtR problem is solved via GNN-based graph regression.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2104.08869")
get_code_for_paper("2104.08869")
have("2104.08869")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2104.08869.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2104.08869)
Connect an agent — have() is free.