Entropic Optimal Transport Eigenmaps for Nonlinear Alignment and Joint Embedding of High-Dimensional Datasets
Not on the map. Why?
Abstract (arXiv)
Embedding high-dimensional data into a low-dimensional space is an indispensable component of data analysis. In numerous applications, it is necessary to align and jointly embed multiple datasets from different studies or experimental conditions. Such datasets may share underlying structures of interest but exhibit individual distortions, resulting in misaligned embeddings using traditional techniques. In this work, we propose Entropic Optimal Transport (EOT) eigenmaps, a principled approach for aligning and jointly embedding a pair of datasets with theoretical guarantees. Our approach leverages the leading singular vectors of the EOT plan matrix between two datasets to extract their shared underlying structure and align them in a common embedding space. We interpret our approach as an inter-data variant of the classical Laplacian eigenmaps and diffusion maps embeddings, showing that it enjoys many favorable analogous properties. We analyze a generative model in which two observed high-dimensional datasets share latent variables supported on a common low-dimensional manifold, while each dataset is subject to translation, geometric distortion, orthogonal nuisance structure, and noise. In a large-sample, high-dimensional regime, we prove that the EOT plan concentrates around a population kernel on an effective manifold determined by the geometric mean of the distortions, with invariance to translations, orthogonal nuisance structure, and noise. Subsequently, we relate our embedding to eigenfunctions of population-level operators encoding the density and geometry of the shared manifold. Finally, we showcase the performance of our approach for data integration and embedding through simulations and analyses of real-world biological data, demonstrating its advantages over alternative methods in challenging scenarios.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 31 of its 103 references that are in the map. First posted on arXiv 1 Jul 2024.
Builds on
31 of 103 references.
References · 31
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2018Unsupervised Alignment of Embeddings with Wasserstein Procrustescited by 96
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
- 2019Veridical Data Sciencecited by 65
- 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 34
- 2021Entropic Optimal Transport: Convergence of Potentialscited by 30
- 2020Spectral convergence of diffusion maps: improved error bounds and an alternative normalisationcited by 25
- 2021Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolationcited by 24
- 2017Manifold learning with bi-stochastic kernelscited by 19
- 2016Removal of Batch Effects using Distribution-Matching Residual Networkscited by 18
- 2020Convergence of Graph Laplacian with kNN Self-tuned Kernelscited by 17
19 more
- 2016Latent common manifold learning with alternating diffusion: analysis and applicationscited by 16
- 2020Doubly-Stochastic Normalization of the Gaussian Kernel is Robust to Heteroskedastic Noisecited by 16
- 2018MAGAN: Aligning Biological Manifoldscited by 15
- 2015Kernel Manifold Alignmentcited by 13
- 2023SNEkhorn: Dimension Reduction with Symmetric Entropic Affinitiescited by 12
- 2019Spectral Analysis Of Weighted Laplacians Arising In Data Clusteringcited by 11
- 2017Much Faster Algorithms for Matrix Scalingcited by 10
- 2019Geometric structure of graph Laplacian embeddingscited by 10
- 2022Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approachcited by 8
- 2022Diffusion Transport Alignmentcited by 7
- 2022Bi-stochastically normalized graph Laplacian: convergence to manifold Laplacian and robustness to outlier noisecited by 7
- 2022Robust Inference of Manifold Density and Geometry by Doubly Stochastic Scalingcited by 7
- 2023Is your data alignable? Principled and interpretable alignability testing and integration of single-cell datacited by 6
- 2018Harmonic Alignmentcited by 5
- 2022Unsupervised Manifold Alignment with Joint Multidimensional Scalingcited by 5
- 2022Manifold Alignment with Label Informationcited by 5
- 2024Kernel spectral joint embeddings for high-dimensional noisy datasets using duo-landmark integral operatorscited by 5
- 2022Beyond kNN: Adaptive, Sparse Neighborhood Graphs via Optimal Transportcited by 3
- 2024Transfer Operators from Batches of Unpaired Points via Entropic Transport Kernelscited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.
- 2025Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integrationcited by 4
- 2026Enhancing Spectral Embedding through Robust and Flexible Knowledge Transfer in Electronic Health Recordscited by 0
- 2026Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Densitycited by 0
- 2026Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Density17 Aug 2026
- 2026Enhancing Spectral Embedding through Robust and Flexible Knowledge Transfer in Electronic Health Records10 Jun 2026
- 2025Stacked SVD or SVD stacked? A Random Matrix Theory perspective on data integration29 Jul 2025