Backend
Recovering the Euclidean Geometry of High-Dimensional Data Under Heterogeneous Noise
arXiv stat.ML0 views
arXiv:2507.18520v3 Announce Type: replace 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.
Source:https://arxiv.org/abs/2507.18520PreviousWhy Finite Intelligence Works in an Infinite World: A Mathematical TheoryNextOn sparsity, extremal structure, and monotonicity properties of Wasserstein and Gromov-Wasserstein optimal transport plans
Related posts
Our token classifier gave us a 10/10 grade from four tasks we typed in ourselves
0dev.to AI

How Answering Machine Detection Works (Explained for Developers)
0dev.to AI
A Detailed Introduction to QuestMeet v3.1
0dev.to AI
The existence-trace installer: a dry run that works, and three ways to trip it
0dev.to AI

Long-Running AI Jobs: Webhooks You Can Trust
0dev.to AI
Build a Prompt-Injection Regression Gate for Amazon Bedrock with AWS SAM
0dev.to AWS