mlsanityData to 7 Oct 2026

On Manifold Hypothesis: Hypersurface Submanifold Embedding Using Osculating Hyperspheres

arXiv 2202.01619 ↗First posted 3 Feb 2022cs.LG math.AT math.DGcited by 1

Not on the map. Why?

Abstract (arXiv)

Consider a set of n data points in the Euclidean space ℝd. This set is called dataset in machine learning and data science. Manifold hypothesis states that the dataset lies on a low-dimensional submanifold with high probability. All dimensionality reduction and manifold learning methods have the assumption of manifold hypothesis. In this paper, we show that the dataset lies on an embedded hypersurface submanifold which is locally (d-1)-dimensional. Hence, we show that the manifold hypothesis holds at least for the embedding dimensionality d-1. Using an induction in a pyramid structure, we also extend the embedding dimensionality to lower embedding dimensionalities to show the validity of manifold hypothesis for embedding dimensionalities 1, 2, dots, d-1. For embedding the hypersurface, we first construct the d nearest neighbors graph for data. For every point, we fit an osculating hypersphere Sd-1 using its neighbors where this hypersphere is osculating to a hypothetical hypersurface. Then, using surgery theory, we apply surgery on the osculating hyperspheres to obtain n hyper-caps. We connect the hyper-caps to one another using partial hyper-cylinders. By connecting all parts, the embedded hypersurface is obtained as the disjoint union of these elements. We discuss the geometrical characteristics of the embedded hypersurface, such as having boundary, its topology, smoothness, boundedness, orientability, compactness, and injectivity. Some discussion are also provided for the linearity and structure of data. This paper is the intersection of several fields of science including machine learning, differential geometry, and algebraic topology.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 3 of its 21 references that are in the map. First posted on arXiv 3 Feb 2022.

Builds on

3 of 21 references.

References · 3

  1. 2019Generalizing from a Few Examples: A Survey on Few-Shot Learningcited by 462
  2. 2019Unsupervised and Supervised Principal Component Analysis: Tutorialcited by 12
  3. 2021Johnson-Lindenstrauss Lemma, Linear and Nonlinear Random Projections, Random Fourier Features, and Random Kitchen Sinks: Tutorial and Surveycited by 8

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.