stat.MLJul 24, 2025

Recovering the Euclidean Geometry of High-Dimensional Data Under Heterogeneous Noise

Authors: Keyi Li, Yuval Kluger, Boris Landa

Organizations: Department of Applied & Computational Mathematics, Yale University · Department of Pathology, Yale University · Department of Electrical and Computer Engineering, Yale University

Abstract

Pairwise Euclidean distances provide a simple geometric representation of high-dimensional data and underlie many data analysis methods, including clustering, visualization, and manifold learning. However, in real-world applications, these distances can be severely corrupted by heterogeneous noise, where different data points are subject to different, and potentially large, noise levels. Such noise distorts the distances inhomogeneously, leading to a misrepresentation of the underlying data geometry. In this work, we ask whether the underlying clean Euclidean geometry can nevertheless be recovered from the corrupted pairwise distances. We answer this question affirmatively, showing that, perhaps surprisingly, such recovery is possible across a broad class of high-dimensional settings with underlying low-dimensional geometry, even when the noise magnitudes vary substantially across observations. We develop a principled approach for recovering the clean pairwise distances, without prior knowledge of either the clean data structure or the noise distribution, and establish probabilistic recovery guarantees. In particular, the recovery error converges to zero at polynomial rates as the feature dimension and dataset size increase simultaneously. Experiments on synthetic datasets demonstrate accurate recovery of the Euclidean geometry in challenging regimes and improved robustness of downstream methods that rely on pairwise distances. When applied to real single-cell RNA sequencing data, our method reliably recovers local neighborhood structure, enabling accurate nearest-neighbor identification used in many downstream analyses.

Figures & tables

Appendix figures & tables4 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Denoising distances beyond the volumetric barrier

    Apr 1, 2026Han Huang, Pakawut Jiradilok, Elchanan MosselManifold LearningLatent Space Geometry

  2. Recovering Geodesic Distances from Noisy Observations

    Nov 17, 2025Charles Fefferman, Jonathan Marty, Kevin RenInverse ProblemsLatent Space Geometry

  3. Riemannian Metric Matching for Scalable Geometric Modeling of Distributions

    Jun 12, 2026Jacob Bamberger, Adam Gosztolai, Pierre Vandergheynst +2Geometric Representation LearningMetric Learning