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.
Learning from graph-structured data is an important task in machine learning and artificial intelligence, for which Graph Neural Networks (GNNs) have shown great promise. Motivated by recent advances in geometric representation learning, we propose a novel GNN architecture for learning representations on Riemannian manifolds with differentiable exponential and logarithmic maps. We develop a scalable algorithm for modeling the structural properties of graphs, comparing Euclidean and hyperbolic geometry. In our experiments, we show that hyperbolic GNNs can lead to substantial improvements on various benchmark datasets.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.12892")
get_code_for_paper("1910.12892")
have("1910.12892")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.12892.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.12892)
Connect an agent — have() is free.