Manifold learning: what, how, and why

Marina Meilă, Hanyu Zhang
11/7/2023
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Manifold learning (ML), known also as non-linear dimension reduction, is a set of methods to find the low dimensional structure of data. Dimension reduction for large, high dimensional data is not merely a way to reduce the data; the new representations and descriptors obtained by ML reveal the geometric shape of high dimensional point clouds, and allow one to visualize, de-noise and interpret them. This survey presents the principles underlying ML, the representative methods, as well as their statistical foundations from a practicing statistician's perspective. It describes the trade-offs, and what theory tells us about the parameter and algorithmic choices we make in order to obtain reliable conclusions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{meil2023manifold,
  title  = {Manifold learning: what, how, and why},
  author = {Marina Meilă and Hanyu Zhang},
  year   = {2023},
  eprint = {2311.03757},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2311.03757v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2311.03757.svg)](https://codeofpaper.com/paper/2311.03757)

Discussion