mlsanityData to 7 Oct 2026

Towards One Model for Classical Dimensionality Reduction: A Probabilistic Perspective on UMAP and t-SNE

arXiv 2405.17412 ↗First posted 27 May 2024stat.ML cs.AI cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper shows that dimensionality reduction methods such as UMAP and t-SNE, can be approximately recast as MAP inference methods corresponding to a model introduced in Ravuri et al. (2023), that describes the graph Laplacian (an estimate of the data precision matrix) using a Wishart distribution, with a mean given by a non-linear covariance function evaluated on the latents. This interpretation offers deeper theoretical and semantic insights into such algorithms, and forging a connection to Gaussian process latent variable models by showing that well-known kernels can be used to describe covariances implied by graph Laplacians. We also introduce tools with which similar dimensionality reduction methods can be studied.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 7 of its 26 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

7 of 26 references.

References · 7

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
  2. 2023White-Box Transformers via Sparse Rate Reductioncited by 77
  3. 2021On UMAP's true loss functioncited by 32
  4. 2022From t-SNE to UMAP with contrastive learningcited by 28
  5. 2022Representation Uncertainty in Self-Supervised Learning as Variational Inferencecited by 22
  6. 2022A Probabilistic Graph Coupling View of Dimension Reductioncited by 13
  7. 2023Dimensionality Reduction as Probabilistic Inferencecited by 4

Built on by

Cited by year

Citing papers per year: 2025: 3.

3 papers.