mlsanityData to 14 Oct 2026

T-SNE Is Not Optimized to Reveal Clusters in Data

arXiv 2110.02573 ↗First posted 6 Oct 2021cs.LG cs.HC stat.MLcited by 3

Not on the map. Why?

Abstract (arXiv)

Cluster visualization is an essential task for nonlinear dimensionality reduction as a data analysis tool. It is often believed that Student t-Distributed Stochastic Neighbor Embedding (t-SNE) can show clusters for well clusterable data, with a smaller Kullback-Leibler divergence corresponding to a better quality. There was even theoretical proof for the guarantee of this property. However, we point out that this is not necessarily the case -- t-SNE may leave clustering patterns hidden despite strong signals present in the data. Extensive empirical evidence is provided to support our claim. First, several real-world counter-examples are presented, where t-SNE fails even if the input neighborhoods are well clusterable. Tuning hyperparameters in t-SNE or using better optimization algorithms does not help solve this issue because a better t-SNE learning objective can correspond to a worse cluster embedding. Second, we check the assumptions in the clustering guarantee of t-SNE and find they are often violated for real-world data sets.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 4 of its 13 references that are in the map. First posted on arXiv 6 Oct 2021.

Builds on

4 of 13 references.

References · 4

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  2. 2017Clustering with t-SNE, provablycited by 51
  3. 2018An Analysis of the t-SNE Algorithm for Data Visualizationcited by 49
  4. 2021Stochastic Cluster Embeddingcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 1.

3 papers.