Low-dimensional embeddings of high-dimensional data
read the original abstract
Large collections of high-dimensional data have become nearly ubiquitous across many academic fields and application domains, ranging from biology to the humanities. Since working directly with high-dimensional data poses challenges, the demand for algorithms that create low-dimensional representations, or embeddings, for data visualization, exploration, and analysis is now greater than ever. In recent years, numerous embedding algorithms have been developed, and their usage has become widespread in research and industry. This surge of interest has resulted in a large and fragmented research field that faces technical challenges alongside fundamental debates, and it has left practitioners without clear guidance on how to effectively employ existing methods. Aiming to increase coherence and facilitate future work, in this review we provide a detailed and critical overview of recent developments, derive a list of best practices for creating and using low-dimensional embeddings, evaluate popular approaches on a variety of datasets, and discuss the remaining challenges and open problems in the field.
This paper has not been read by Pith yet.
Forward citations
Cited by 5 Pith papers
-
MEDAL: Manifold Embedding Distillation via Autoencoder Learning
MEDAL distills manifold embeddings into autoencoders to enable out-of-sample extension and held-out validation of dimension reduction methods.
-
A Spectral Framework for Multi-Scale Nonlinear Dimensionality Reduction
A spectral framework for nonlinear DR uses spectral bases plus cross-entropy optimization to create multi-scale embeddings that preserve both global manifold geometry and local neighborhoods while supporting graph-fre...
-
The Shape of Attraction in UMAP: Exploring the Embedding Forces in Dimensionality Reduction
Analysis of UMAP embedding forces shows repulsion controls cluster boundaries while attraction has dual effects, motivating a modification that improves consistency under random initialization.
-
Beyond Explained Variance: A Cautionary Tale of PCA
PCA suggested clustering in fossil teeth data on a nonlinear manifold, but t-SNE and persistent homology show a ring structure with no clustering, supported by a unit-circle generative model whose arcsine distance dis...
-
Beyond Explained Variance: A Cautionary Tale of PCA
PCA scatterplots misleadingly indicate clusters in Kuehneotherium teeth data, whereas t-SNE and persistent homology detect a ring-like one-dimensional manifold, backed by a generative model of uniform sampling from a ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.