Navigating Perplexity: A linear relationship with the data set size in t-SNE embeddings
Not on the map. Why?
Abstract (arXiv)
Widely used pipelines for analyzing high-dimensional data utilize two-dimensional visualizations. These are created, for instance, via t-distributed stochastic neighbor embedding (t-SNE). A crucial element of the t-SNE embedding procedure is the perplexity hyperparameter. That is because the embedding structure varies when perplexity is changed. A suitable perplexity choice depends on the data set and the intended usage for the embedding. Therefore, perplexity is often chosen based on heuristics, intuition, and prior experience. This paper uncovers a linear relationship between perplexity and the data set size. Namely, we show that embeddings remain structurally consistent across data set samples when perplexity is adjusted accordingly. Qualitative and quantitative experimental results support these findings. This informs the visualization process, guiding the user when choosing a perplexity value. Finally, we outline several applications for the visualization of high-dimensional data via t-SNE based on this linear relationship.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 8 of its 30 references that are in the map. First posted on arXiv 29 Aug 2023.
Builds on
8 of 30 references.
References · 8
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2017Efficient Algorithms for t-distributed Stochastic Neighborhood Embeddingcited by 75
- 2020Attraction-Repulsion Spectrum in Neighbor Embeddingscited by 41
- 2022From t-SNE to UMAP with contrastive learningcited by 28
- 2021Revisiting Dimensionality Reduction Techniques for Visual Cluster Analysis: An Empirical Studycited by 27
- 2015Approximated and User Steerable tSNE for Progressive Visual Analyticscited by 19
- 2017Automatic Selection of t-SNE Perplexitycited by 13
- 2020Perplexity-free Parametric t-SNEcited by 3
Built on by
Citing papers per year: 2023: 1.
1 paper.