Matrix factorisation and the interpretation of geodesic distanceDownload PDF

21 May 2021, 20:47 (edited 15 Jan 2022)NeurIPS 2021 PosterReaders: Everyone
  • Keywords: graph, covariance matrix, nonlinear dimension reduction, manifold, embedding, matrix factorisation, Isomap
  • TL;DR: Obtain 'true' node representations using matrix factorisation followed by manifold learning
  • Abstract: 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.
  • Supplementary Material: pdf
  • Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
  • Code: https://github.com/anniegray52/graphs
11 Replies

Loading