mlsanityData to 7 Oct 2026

Interpreting the Curse of Dimensionality from Distance Concentration and Manifold Effect

arXiv 2401.00422 ↗First posted 31 Dec 2023cs.LG cs.DScited by 14

Not on the map. Why?

Abstract (arXiv)

The characteristics of data like distribution and heterogeneity, become more complex and counterintuitive as dimensionality increases. This phenomenon is known as curse of dimensionality, where common patterns and relationships (e.g., internal pattern and boundary pattern) that hold in low-dimensional space may be invalid in higher-dimensional space. It leads to a decreasing performance for the regression, classification, or clustering models or algorithms. Curse of dimensionality can be attributed to many causes. In this paper, we first summarize the potential challenges associated with manipulating high-dimensional data, and explains the possible causes for the failure of regression, classification, or clustering tasks. Subsequently, we delve into two major causes of the curse of dimensionality, distance concentration, and manifold effect, by performing theoretical and empirical analyses. The results demonstrate that, as the dimensionality increases, nearest neighbor search (NNS) using three classical distance measurements, Minkowski distance, Chebyshev distance, and cosine distance, becomes meaningless. Meanwhile, the data incorporates more redundant features, and the variance contribution of principal component analysis (PCA) is skewed towards a few dimensions.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 8 of its 30 references that are in the map. First posted on arXiv 31 Dec 2023.

Builds on

8 of 30 references.

References · 8

  1. 2021Learning in High Dimension Always Amounts to Extrapolationcited by 62
  2. 2019Overfitting Mechanism and Avoidance in Deep Neural Networkscited by 30
  3. 2017Supervised Dimensionality Reduction for Big Datacited by 13
  4. 2021The Curse Revisited: When are Distances Informative for the Ground Truth in Noisy High-Dimensional Data?cited by 3
  5. 2019Optimizing and accelerating space-time Ripley's K function based on Apache Spark for distributed spatiotemporal point pattern analysiscited by 2
  6. 2023MeanCut: A Greedy-Optimized Graph Clustering via Path-based Similarity and Degree Descent Criterioncited by 2
  7. 2022How I learned to stop worrying and love the curse of dimensionality: an appraisal of cluster validation in high-dimensional spacescited by 1
  8. 2023A Robust and Efficient Boundary Point Detection Method by Measuring Local Direction Dispersioncited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 5; 2026: 6.

14 papers.

Sort:

By area: