Inference for Similarity and Alignability between Noisy High-Dimensional Datasets
Not on the map. Why?
Abstract (arXiv)
The rapid growth of high-dimensional datasets across a wide range of scientific domains has created an urgent need for new statistical methods to compare distributions with underlying low-dimensional structure. Assessing similarity between high-dimensional datasets whose observations concentrate near low-dimensional manifolds is particularly challenging due to the nontrivial effects of noise in high dimensions. We propose a principled framework for statistical inference on the similarity and alignability of high-dimensional datasets with low-dimensional smooth signals under heterogeneous noise. The key idea is to link the spectral properties of the observed data matrices to the geometry of their underlying signal distributions. Under a manifold signal-plus-noise model, we build on the principal variances associated to the underlying signals and develop a scale- and rotation-invariant dissimilarity measure between two datasets that may differ in sample size and noise structure. We further construct an estimator of the dissimilarity and a statistical test of dataset alignability, namely, whether the dissimilarity vanishes. The proposed methodology and its theoretical guarantees under high-dimensional asymptotic settings draw on recent advances in random matrix theory (RMT). The proposed framework accommodates heterogeneous noise across datasets and provides a fast, theoretically grounded approach to comparing high-dimensional datasets with low-dimensional structures. Through extensive simulations and analyses of multiple single-cell datasets, we demonstrate that the proposed method substantially outperforms existing approaches.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 58 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
14 of 58 references.
References · 14
- 2023Manifold learning: what, how, and whycited by 68
- 2020Unsupervised Domain Adaptation via Discriminative Manifold Propagationcited by 33
- 2013A new graph-based two-sample test for multivariate and object datacited by 24
- 2021Inference for Heteroskedastic PCA with Missing Datacited by 21
- 2017On the Optimality of Kernel-Embedding Based Goodness-of-Fit Testscited by 19
- 2020ScreeNOT: Exact MSE-Optimal Singular Value Thresholding in Correlated Noisecited by 15
- 2013Gaussian Graphical Model Estimation with False Discovery Rate Controlcited by 9
- 2022Learning Low-Dimensional Nonlinear Structures from High-Dimensional Noisy Data: An Integral Operator Approachcited by 8
- 2019Matrix denoising for weighted loss functions and heterogeneous signalscited by 6
- 2023Is your data alignable? Principled and interpretable alignability testing and integration of single-cell datacited by 6
- 2016A weighted edge-count two-sample test for multivariate and object datacited by 5
- 2021How do kernel-based sensor fusion algorithms behave under high dimensional noise?cited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.