mlsanityData to 7 Oct 2026

Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding

arXiv 2503.18010 ↗First posted 23 Mar 2025cs.CVcited by 7

Not on the map. Why?

Abstract (arXiv)

Dimensionality reduction is a fundamental task that aims to simplify complex data by reducing its feature dimensionality while preserving essential patterns, with core applications in data analysis and visualisation. To preserve the underlying data structure, multi-dimensional scaling (MDS) methods focus on preserving pairwise dissimilarities, such as distances. They optimise the embedding to have pairwise distances as close as possible to the data dissimilarities. However, the current standard is limited to embedding data in Riemannian manifolds. Motivated by the lack of asymmetry in the Riemannian metric of the embedding space, this paper extends the MDS problem to a natural asymmetric generalisation of Riemannian manifolds called Finsler manifolds. Inspired by Euclidean space, we define a canonical Finsler space for embedding asymmetric data. Due to its simplicity with respect to geodesics, data representation in this space is both intuitive and simple to analyse. We demonstrate that our generalisation benefits from the same theoretical convergence guarantees. We reveal the effectiveness of our Finsler embedding across various types of non-symmetric data, highlighting its value in applications such as data visualisation, dimensionality reduction, directed graph embedding, and link prediction.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 25 of its 125 references that are in the map. First posted on arXiv 23 Mar 2025.

Builds on

25 of 125 references.

References · 25

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
  3. 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
  4. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
  5. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  6. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
  7. 2019Multi-scale Attributed Node Embeddingcited by 543
  8. 2014word2vec Explained: deriving Mikolov et al.'s negative-sampling word-embedding methodcited by 109
  9. 2021MagNet: A Neural Network for Directed Graphscited by 104
  10. 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 88
  11. 2021Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approachcited by 23
  12. 2016Magnetic eigenmaps for community detection in directed networkscited by 22
13 more
  1. 2022Directed Graph Auto-Encoderscited by 22
  2. 2023HoloNets: Spectral Convolutions do extend to Directed Graphscited by 20
  3. 2023Hyperbolic Diffusion Embedding and Distance for Hierarchical Representation Learningcited by 18
  4. 2018Node Representation Learning for Directed Graphscited by 16
  5. 2024Wormhole Loss for Partial Shape Matchingcited by 12
  6. 2018Intrinsic Isometric Manifold Learning with Application to Localizationcited by 11
  7. 2023On Unsupervised Partial Shape Correspondencecited by 11
  8. 2020Generalized Nonlinear and Finsler Geometry for Roboticscited by 10
  9. 2024Finsler-Laplace-Beltrami Operators with Application to Shape Analysiscited by 10
  10. 2024DUPLEX: Dual GAT for Complex Embedding of Directed Graphscited by 7
  11. 2024Tree-Wasserstein Distance for High Dimensional Data with a Latent Feature Hierarchycited by 5
  12. 2019Low-dimensional statistical manifold embedding of directed graphscited by 4
  13. 2024Metric Convolutions: A Unifying Theory to Adaptive Image Convolutionscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 6.

7 papers.