mlsanityData to 14 Oct 2026

Unsupervised visualization of image datasets using contrastive learning

arXiv 2210.09879 ↗First posted 18 Oct 2022cs.LG cs.CV cs.HCcited by 16

Not on the map. Why?

Abstract (arXiv)

Visualization methods based on the nearest neighbor graph, such as t-SNE or UMAP, are widely used for visualizing high-dimensional data. Yet, these approaches only produce meaningful results if the nearest neighbors themselves are meaningful. For images represented in pixel space this is not the case, as distances in pixel space are often not capturing our sense of similarity and therefore neighbors are not semantically close. This problem can be circumvented by self-supervised approaches based on contrastive learning, such as SimCLR, relying on data augmentation to generate implicit neighbors, but these methods do not produce two-dimensional embeddings suitable for visualization. Here, we present a new method, called t-SimCNE, for unsupervised visualization of image data. T-SimCNE combines ideas from contrastive learning and neighbor embeddings, and trains a parametric mapping from the high-dimensional pixel space into two dimensions. We show that the resulting 2D embeddings achieve classification accuracy comparable to the state-of-the-art high-dimensional SimCLR representations, thus faithfully capturing semantic relationships. Using t-SimCNE, we obtain informative visualizations of the CIFAR-10 and CIFAR-100 datasets, showing rich cluster structure and highlighting artifacts and outliers.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 26 of its 52 references that are in the map. First posted on arXiv 18 Oct 2022.

Builds on

26 of 52 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  5. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  6. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
  7. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,898
  8. 2020Exploring Simple Siamese Representation Learningcited by 2,866
  9. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
  10. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
  11. 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 395
  12. 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
14 more
  1. 2020Understanding How Dimension Reduction Tools Work: An Empirical Approach to Deciphering t-SNE, UMAP, TriMAP, and PaCMAP for Data Visualizationcited by 173
  2. 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
  3. 2020Parametric UMAP embeddings for representation and semi-supervised learningcited by 104
  4. 2016Visualizing Large-scale and High-dimensional Datacited by 79
  5. 2017Efficient Algorithms for t-distributed Stochastic Neighborhood Embeddingcited by 75
  6. 2019Do We Train on Test Data? Purging CIFAR of Near-Duplicatescited by 62
  7. 2019TriMap: Large-scale Dimensionality Reduction Using Tripletscited by 60
  8. 2020Attraction-Repulsion Spectrum in Neighbor Embeddingscited by 41
  9. 2022Understanding Deep Contrastive Learning via Coordinate-wise Optimizationcited by 35
  10. 2021On UMAP's true loss functioncited by 32
  11. 2022Your Contrastive Learning Is Secretly Doing Stochastic Neighbor Embeddingcited by 28
  12. 2022From t-SNE to UMAP with contrastive learningcited by 28
  13. 2022DLME: Deep Local-flatness Manifold Embeddingcited by 16
  14. 2021TLDR: Twin Learning for Dimensionality Reductioncited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 5; 2025: 3; 2026: 6.

16 papers.

Sort: