Low-dimensional embeddings of high-dimensional data
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Aug 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 5.
8 papers.
- 2025t-SNE Exaggerates Clusters, Provablycited by 3
- 2026TopoPrune: Robust Data Pruning via Unified Latent Space Topologycited by 1
- 2025Cluster and then Embed: A Modular Approach for Visualizationcited by 0
- 2025Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalizationcited by 0
- 2026Data Kernel Perspective Space Performance Guarantees for Synthetic Data from Transformer Modelscited by 0
- 2026A Spectral Decomposition Framework for Multiscale Nonlinear Dimensionality Reductioncited by 0
- 2026MEDAL: Manifold Embedding Distillation via Autoencoder Learningcited by 0
- 2026How smoothing the affinity matrix affects neighborhood preservation in t-SNEcited by 0
- 2026How smoothing the affinity matrix affects neighborhood preservation in t-SNE17 Aug 2026
- 2026MEDAL: Manifold Embedding Distillation via Autoencoder Learning22 May 2026
- 2026A Spectral Decomposition Framework for Multiscale Nonlinear Dimensionality Reduction2 Apr 2026
- 2026Data Kernel Perspective Space Performance Guarantees for Synthetic Data from Transformer Models4 Feb 2026
- 2026TopoPrune: Robust Data Pruning via Unified Latent Space Topology2 Feb 2026
- 2025t-SNE Exaggerates Clusters, Provably9 Oct 2025
- 2025Robust Tangent Space Estimation via Laplacian Eigenvector Gradient Orthogonalization2 Oct 2025
- 2025Cluster and then Embed: A Modular Approach for Visualization27 Aug 2025