mlsanityData to 14 Oct 2026

Unsupervised Manifold Alignment with Joint Multidimensional Scaling

arXiv 2207.02968 ↗First posted 6 Jul 2022stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

We introduce Joint Multidimensional Scaling, a novel approach for unsupervised manifold alignment, which maps datasets from two different domains, without any known correspondences between data instances across the datasets, to a common low-dimensional Euclidean space. Our approach integrates Multidimensional Scaling (MDS) and Wasserstein Procrustes analysis into a joint optimization problem to simultaneously generate isometric embeddings of data and learn correspondences between instances from two different datasets, while only requiring intra-dataset pairwise dissimilarities as input. This unique characteristic makes our approach applicable to datasets without access to the input features, such as solving the inexact graph matching problem. We propose an alternating optimization scheme to solve the problem that can fully benefit from the optimization techniques for MDS and Wasserstein Procrustes. We demonstrate the effectiveness of our approach in several applications, including joint visualization of two datasets, unsupervised heterogeneous domain adaptation, graph matching, and protein structure alignment. The implementation of our work is available at https://github.com/BorgwardtLab/JointMDS

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 14 of its 52 references that are in the map. First posted on arXiv 6 Jul 2022.

Builds on

14 of 52 references.

References · 14

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2019Gromov-Wasserstein Learning for Graph Matching and Node Embeddingcited by 126
  3. 2019Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matchingcited by 103
  4. 2018Unsupervised Alignment of Embeddings with Wasserstein Procrustescited by 97
  5. 2019Sliced Gromov-Wassersteincited by 66
  6. 2020CO-Optimal Transportcited by 42
  7. 2018Towards Optimal Transport with Global Invariancescited by 33
  8. 2017DIMAL: Deep Isometric Manifold Learning Using Sparse Geodesic Samplingcited by 16
  9. 2018MAGAN: Aligning Biological Manifoldscited by 15
  10. 2019KerGM: Kernelized Graph Matchingcited by 13
  11. 2021LDLE: Low Distortion Local Eigenmapscited by 11
  12. 2021Stochastic Iterative Graph Matchingcited by 10
2 more
  1. 2016Stochastic Multidimensional Scalingcited by 6
  2. 2017Subspace Least Squares Multidimensional Scalingcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 2; 2026: 1.

5 papers.