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.
Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accomplished in two steps: matrix factorisation, followed by nonlinear dimension reduction. This combination is effective because the point cloud obtained in the first step lives close to a manifold in which latent distance is encoded as geodesic distance. Hence, a nonlinear dimension reduction tool, approximating geodesic distance, can recover the latent positions, up to a simple transformation. We give a detailed account of the case where spectral embedding is used, followed by Isomap, and provide encouraging experimental evidence for other combinations of techniques.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.01260")
get_code_for_paper("2106.01260")
have("2106.01260")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.01260.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.01260)
Connect an agent — have() is free.