Marc Law, Jos Stam
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.
In machine learning, data is usually represented in a (flat) Euclidean space where distances between points are along straight lines. Researchers have recently considered more exotic (non-Euclidean) Riemannian manifolds such as hyperbolic space which is well suited for tree-like data. In this paper, we propose a representation living on a pseudo-Riemannian manifold of constant nonzero curvature. It is a generalization of hyperbolic and spherical geometries where the nondegenerate metric tensor need not be positive definite. We provide the necessary learning tools in this geometry and extend gradient-based optimization techniques. More specifically, we provide closed-form expressions for distances via geodesics and define a descent direction to minimize some objective function. Our novel framework is applied to graph representations.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.00211")
get_code_for_paper("2007.00211")
have("2007.00211")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.00211.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.00211)
Connect an agent — have() is free.