U NSUPERVISED VISUALIZATION OF IMAGE DATASETS USING CONTRASTIVE LEARNING
A BSTRACT
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 selfsupervised 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.
I NTRODUCTION
As many research fields are producing ever larger and more complex datasets data visualization methods have become important in many scientific and practical applications (Becht et al., 2019;
Diaz-Papkovich et al., 2019; Kobak & Berens, 2019; Schmidt, 2018).
Such methods allow a concise summary of the entire dataset, displaying a high-dimensional dataset as a 2D embedding .
This low-dimensional representation is often convenient for data exploration, highlighting clusters and relationships between them.
In practice, most useful are neighbor embedding methods, such as t -SNE (van der Maaten & Hinton, 2008) and UMAP (McInnes et al., 2018), that aim to preserve nearest neighbors from the high-dimensional space when optimizing the layout in 2D.
[Figure]
Unfortunately, for image datasets, nearest neighbors computed using the Euclidean metric in pixel space are typically not worth preserving.
Although t -SNE works well on very simple image datasets such as MNIST (van der Maaten & Hinton, 2008, Figure 2a), the approach fails when considering more natural image datasets such as CIFAR-10/100 (Supp.
Fig.
A.1).
To create 2D embeddings for images, new visualization approaches are required, which use different notions of similarity.
Here, we provide such a method based on the contrastive learning framework.
Contrastive learning is currently the state-of-the-art approach to unsupervised learning in computer vision (Hadsell et al., 2006).
The contrastive learning method SimCLR (Chen et al., 2020) uses image transformations to create two views of each image and then optimizes a convolutional neural network so that the two views always stay close together in the resulting representation.
While this method performs very well in benchmarks — such as linear or k NN classification accuracy, — the computed representation is typically high-dimensional (e.g. 128-dimensional), hence not suitable for visualization.
We extend the SimCLR framework to directly optimize a 2D embedding.
Taking inspiration from t -SNE, we use the Euclidean distance and the Cauchy ( t -distribution) kernel to measure similarity in 2D. While using 2D instead of 128D output may not seem like a big step, we show that optimizing the resulting architecture is challenging.
We develop an efficient training strategy to overcome these challenges, and only then are able to achieve satisfactory visualizations.
We call the resulting method t -SimCNE (Fig. 1) and show that it yields meaningful and useful embeddings of CIFARand CIFAR-100 datasets (Krizhevsky, 2009).
Our code is available at github.com/berenslab/t-simcne (see iclr2023 branch).
R ELATED WORK
Neighbor embeddings (NE) have a rich history dating back to locally linear embedding (Roweis & Saul, 2000) and stochastic neighbor embedding (SNE; Hinton & Roweis, 2003).
They became widely used after the introduction of the Cauchy kernel into the SNE framework (van der Maaten & Hinton, 2008) and after efficient approximations became available (van der Maaten, 2014; Linderman et al., 2019).
A number of algorithms based on that framework, such as LargeVis (Tang et al., 2016), UMAP (McInnes et al., 2018), TriMap (Amid & Warmuth, 2019), etc., have been developed and got widespread adoption in recent years in a variety of application fields.
All of them are closely related to SNE (B ¨ ohm et al., 2022; Damrich et al., 2023) and rely on the k NN graph of the data.
NE algorithms have been used to visualize latent representations of neural networks trained in a supervised setting (e.g. Karpathy, 2014; Mnih et al., 2015).
This approach is, however, unsuitable for data exploration as it is supervised.
NE algorithms can also be applied to an unsupervised (also known as self-supervised) representation of a dataset obtained with SimCLR, or to a representation obtained with a neural network pre-trained on a generic image classification task such as ImageNet (e.g. Narayan et al., 2015). The downside is that these approaches would not yield a parametric mapping to 2D.
In this work, we are interested in an unsupervised but parametric mapping that allows embedding of out-of-sample points.
See Discussion for further considerations.
Conceptual similarity between SimCLR and t -SNE has been recently pointed out by Damrich et al.
The authors suggest interpreting k NN graph edges as data augmentations, and show that t -SNE can also be optimized using the InfoNCE loss (van den Oord et al., 2018) used by SimCLR, and/or using a parametric mapping.
Equivalently, one can think of SimCLR as a parametric SNE that samples edges from an unobservable k NN graph.
We were motivated by this connection when developing t -SimCNE.
Further motivation comes from a recently described phenomenon called dimensional collapse (Jing et al., 2022; Tian, 2022), which suggests that there is redundant information in the output of SimCLR.
Hence we reasoned that it should be possible to achieve a good representation even with drastically reduced output dimensionality.
Two closely related works appeared during preparation of this manuscript: Zang et al.
(2022) suggest an architecture similar to SimCLR for 2D embeddings, but use a more complicated setup to impose ‘local flatness’ and, judging from their figures, obtain qualitatively worse embeddings of CIFAR datasets than we do (we were unable to quantitatively benchmark their method).
Hu et al.
(2023) suggest to use the Cauchy kernel in the SimCLR framework (calling it t -SimCLR), but in terms of 2D visualization, obtain worse results than we do (Hu et al., 2023, Fig.
B.11 shows CIFAR-10, reported k NN accuracy 57% vs. our 89%).
C ONTRASTIVE LEARNING FOR VISUALIZATION 3. S IM CLR OVERVIEW
SimCLR relies on creating two views of each data sample using random data augmentations (Fig. 1).
For image data, this means that the image is randomly cropped, flipped, and so on.
The method feeds a mini-batch containing pairs of augmented images through a ResNet to obtain a representation of the images.
The parameters of the network are optimized such that the paired images are placed close to each other in the output space, while keeping all other images further apart.
In mathematical terms, the loss function used by SimCLR, known as InfoNCE loss (van den Oord et al., 2018), is defined as
[Equation]
Here, indices i and j correspond to two data augmentations of the same original image, and z denotes network output.
For batch size b , there are 2 b samples in the batch because each sample is augmented twice.
The similarity function function used by SimCLR is the cosine similarity: sim( x , y ) =
x ⊤ · y / (cid:0) ∥ x ∥ · ∥ y ∥ (cid:1) .
We follow Chen et al.
(2020) in using τ = 0 .
The SimCLR cost function is intimately related to the SNE loss.
Note that the cosine distance cosdist( x , y )
= 1 − sim( x , y ) is equal to the half of the squared Euclidean distance between unitnormalized x and y .
Let ˜a = a / ∥ a ∥ .
Then
[Equation]
which is precisely the expression used by SNE (a Gaussian kernel of the Euclidean distance) to measure similarity between embedding vectors (Hinton & Roweis, 2003).
As shown by Damrich et al.
, SNE can also be optimized using the InfoNCE loss and mini-batch training; in the
SNE setup, i and j are two points connected by a k NN graph edge.
The loss functions of both SimCLR and t -SNE give rise to an attractive force between similar points i and j , enforced by the InfoNCE numerator in Eq.
(1), and a repulsion between all points, enforced by the denominator.
Wang & Isola (2020) called this the alignment and the uniformity aspects of the loss.
In the neighbor embedding literature, this is referred to as attractive and repulsive forces acting on the embedding points (B¨ohm et al., 2022; Damrich & Hamprecht, 2021; Wang et al., 2021).
3. t -S IM CNE LOSS FUNCTION FOR 2D VISUALIZATION
To achieve our goal of adapting SimCLR to create 2D embeddings of images, we reduce the dimensionality of the linear output layer from 128 to 2 (Fig. 1).
This change, however, requires changing the similarity function as well, as using cosine similarity would effectively constrain the embedding to the unit circle S 1 , which is not suitable for data visualization.
Instead, we remove the normalization from the last expression in Eq.
(3), allowing the output z vectors to lie anywhere in R 2 .
In other words, we replace the cosine distance with the Euclidean distance, which is a natural choice for measuring distance between points in a 2D embedding.
While one could still use Gaussian kernel to transform Euclidean distance into a similarity as in Eq.
(3), we follow t -SNE’s example (van der Maaten & Hinton, 2008) and use the Cauchy ( t -distribution with one degree of freedom) kernel instead, as the heavy-tailed Cauchy kernel reduces the ‘crowding problem’ that SNE had with the Gaussian kernel (van der Maaten & Hinton, 2008).
We call the resulting method t -SimCNE.
[Table]
→ Euclidean
[Equation]
We denote the Euclidean distance between z i and
z j as d ij = ∥
z i − z j ∥ .
The corresponding Cauchy similarity is 1 / (1 + d 2 ij ) .
With that, we define the t -SimCNE loss as
[Equation]
We will refer to the SimCLR loss as ‘cosine’ loss and to the t -SimCNE loss as ‘Euclidean’ loss.
Note that the numerical loss values between them are not directly comparable, because the minimum of the Euclidean loss is zero, whereas the cosine loss, Eq.
(2), is bounded from below by
[Equation]
which is ∼ 3.65 for b = 1024 and τ = 0 .
3. I MPLEMENTATION , DATASETS , AND PERFORMANCE METRICS
We used our own PyTorch (Paszke et al., 2019, version 1.12.1) implementation of SimCLR.
As the backbone, we used a ResNet18 (He et al., 2016), which has 512-dimensional output.
We reduced the kernel size in the first convolutional layer of the ResNet18 from 7 × 7 to 3 × 3 as in Chen et al.
For the fully-connected projection head we used one hidden ReLU layer with 1024 units, and linear output layer with 128 units.
We optimized the network for 1000 epochs using SGD with momentum 0.9.
The initial learning rate was 0 .
03 · b/ 256 = 0 .
12 , with linear warm-up over ten epochs (fromto 0.12) and cosine annealing (Loshchilov & Hutter, 2017) down to 0 for the remaining epochs.
We used batch size b = 1024 and the same set of data augmentations as in Chen et al.
We used CIFAR-10 and CIFAR-100 datasets (Krizhevsky, 2009) for all our experiments.
Each dataset consists of n = 60 000 colored and labeled 32 × 32 images.
CIFAR-10 has 10 classes (Fig.
A.2), while CIFAR-100 has 100 classes grouped into 20 superclasses.
We used the dataset classes CIFAR10 and CIFAR100 provided by the torchvision package.
To quantitatively assess the embedding quality, we not only report loss values but also the test-set k NN accuracy in the projection head output space Z as our main performance metric.
Note that in the contrastive learning literature (e.g. Chen et al., 2020), representation quality is usually assessed
[Figure]
airplaneautomobilebirdcatdeer dogfroghorseshiptruck
[Figure]
via linear classification accuracy in the ResNet output space H .
In the Z space, we prefer to use the k NN classifier, as the 2D embedding can be considered good even if classes are separable but not linearly separable.
For k NN accuracy, we used the scikit-learn (Pedregosa et al., 2011) implementation with k
= 15 (any k ∈ [1 , 30] gave qualitatively the same results, Fig. A.3).
For the linear accuracy, we used the LogisticRegression class from scikit-learn, with the SAGA solver (Defazio et al., 2014) and no penalty.
For CIFAR-10 (CIFAR-100), our SimCLR implementation achieved 93% (67%) test-set linear accuracy in H (Tables 1 and A.1, line 1) which is state of the art for SimCLR with ResNet18 (e.g. Chen & He, 2021, Appendix D and da Costa et al., 2022, Table 1).
We heavily used Matplotlib 3.6.0 (Hunter, 2007), NumPy 1.23.1 (Harris et al., 2020), and openTSNE 0.6.2 (Poliˇcar et al., 2019), which, in turn, uses Annoy (Bernhardsson, 2013).
3. t -S IM CNE REQUIRES DIMENSIONALITY ANNEALING FOR OPTIMAL RESULTS
We used the setup described in the previous section to train t -SimCNE on the entire CIFARdataset.
However, we found that na¨ıve training of 2D t -SimCNE resulted in a suboptimal embedding layout (Fig. 2a) and achieved only 81% k NN accuracy (Table 1, line 4).
When we increased the number of training epochs from 1000 to 5000, the embedding improved (Fig. 2b), with k NN accuracy reaching 87% (Table 1, line 5).
However, 5000 epochs took a long time (almost three GPU days) so this approach is not very practical.
Moreover, we felt the embedding was still suboptimal, with many clusters seemingly unable to break apart from each other.
We noticed that in both cases above, the linear accuracy in H was markedly lower than with standard
SimCLR (85% and 89% vs. 93%, cf.
Table 1, lines 4, 5, and 1).
We reasoned that it may be beneficial to pretrain the model with 128D output, achieving high-quality representation in H , and then finetune the model with the 2D output.
This can be seen as ‘dimensionality annealing’.
Moving from 128D output to 2D requires changing the linear output layer in the projection head.
For this, we
[Figure]
initialized the new 2D output layer randomly, froze the entire network apart from this layer, and trained the last layer for 50 epochs (learning rate 0.12, no warm-up, no annealing).
This ensured that the new output layer was reasonably aligned with the rest of the projection head.
Afterwards, the entire model was unfrozen and trained for another 450 epochs (initial learning rate 0.12/1000, warm-up for 10 epochs, cosine annealing down to 0).
We experimented with two different options for 128D pre-training, either using standard SimCLR with the cosine loss, or using the Euclidean loss.
We found that using Euclidean similarity for pretraining resulted in the final t -SimCNE loss 2.7 (Table 1, line 7), vs. 3.2 when using the cosine similarity (Table 1, line 6).
Euclidean loss also resulted in visually more pleasing embedding with crisp and well-separated clusters (Fig. 2d vs. (Fig. 2c).
As the difference in the final loss was large, we believe that this training strategy is the optimal one (even though the final k NN accuracy was slightly lower compared to the cosine pretraining: 89% vs. 90%).
We confirmed this conclusion by applying t -SimCNE to CIFAR-100 (Fig. 3).
We found that without any pretraining, k NN accuracy on the superclass level was 50% (Fig. 3a); with SimCLR pretraining using cosine loss, it was 65% (Fig. 3b); and with Euclidean pretraining, it was 68% (Fig. 3c).
On the level of classes, the k NN accuracy was 33%, 47%, and 51%, respectively (Table A.1, lines 4–6).
Even though the cosine similarity led to a higher quality of the H representation for both CIFARand CIFAR-100 (93% vs. 90% on CIFAR-10; Table 1, lines 1 vs. 3) compared to the Euclidean similarity; and even though the spherical constraint has theoretically appealing properties (Wang & Isola, 2020), the Euclidean similarity worked better for t -SimCNE pretraining.
This may have to do with the norm distribution of the embedding vectors.
Standard SimCLR with cosine loss has no discernible structure in the embedding norms (Fig. 4b), which is not surprising as the z ∈ Rvectors are normalized when computing the cosine similarity.
But with Euclidean loss, the norms of z vectors strongly differ between classes (Fig. 4a).
This leads to a reasonable 2D embedding even before the linear fine-tuning (Fig.
A.4a and Fig.
A.5a), and fine-tuning is able to work more effectively (Fig.
A.4b,c and Fig.
A.5b,c).
Regarding dimensional collapse, it was less pronounced with Euclidean loss compared to the cosine loss (Fig. A.6).
3. A DDITIONAL EXPERIMENTS
We explored the effect of training budget on the resulting representations.
The training strategy described above totaled 1500 epochs and took almost 20 hours on our hardware.
Even when the training length was drastically reduced, pretrained models achieved a better performance than endto-end training in 2D. With the total budget of 500 epochs, the final k NN accuracy was 89% (Table 1, line 9); with 1000 epochs in total, it was 90% (Table 1, line 8) — better than end-to-end training for 5000 epochs.
Visually, all three budgets resulted in qualitatively similar embeddings (Fig.
A.7).
To test the stability of t -SimCNE, we repeated the training procedure three times with different random seeds.
We found that while the exact layout and cluster arrangement differed between runs, qualitatively the embeddings were very similar (Fig. A.8).
SimCLR itself could in principle be used for data visualization if the output dimensionality is set to 3, so that the embedding lies on the 2-sphere S 2 .
However, we found that this setup only resulted in k NN accuracy of 74% (Table 1, line 2) and the embedding itself looked poor (Fig.
A.9).
[Figure]
Sailboats
[Figure]
aerial
[Figure]
Grounded planes
Airborne planes
Ratites
Bird heads
Mounted horses
Dark horses
Bright horses
Horse heads
Deer heads
White dogs
Brown dogs
Black-and-white pets
Black pets
Frogs, white background
Croaking
[Figure]
E XPLORATORY ANALYSIS SHOWS THE POWER OF t -S IM CNE
The ultimate goal of t -SimCNE is to be a tool for exploratory data analysis.
In this section we demonstrate its power using the same CIFAR datasets as above.
4. t -S IM CNE REVEALS SUBCLASS STRUCTURE IN CIFAR-
We manually annotated the t -SimCNE embedding of CIFAR-10 for additional structure beyond the 10 originally defined classes (Fig. 5).
We found that the embedding exhibited rich cluster structure, with many of the original classes (colors) splitting into several distinct clusters, or ‘islands’.
We inspected the images within these clusters and found that they corresponded to meaningful semantic concepts.
For example, within the ‘ship’ class, sailboats and other boat types differed clearly, such that sailboats formed an isolated cluster.
Within the main ’ship’ cluster, aerial view and sea level photographs varied systematically in their position in the 2D embedding.
Similarly, the ‘birds’ class split into three well-separated islands: bird heads, ratites 1 , and small birds.
In the ‘horse’ class, horse heads and mounted horses formed separate clusters, and the remaining horse images were separated by color.
Importantly, this within-class structure was not possible to infer from the original class labels alone, and we did not expect to find it when we started the project.
Therefore, t -SimCNE helped us to discover additional latent structure in the dataset.
In addition to this fine-scale structure, t -SimCNE represented at least some of the between-class structure adequately.
Although neighbor embedding methods have been criticized as being notoriously unreliable in preserving global structure of the data (Wattenberg et al., 2016).
For example, the ‘automobile’ class was split into three main clusters: metallic cars, more colorful cars, and mostly bright red cars.
The latter formed a separate cluster in the upper part of the orange island, next to one of the ‘truck’ clusters, consisting of bright red firetrucks.
Additionally, a very distinct, stripe-like orange cluster on the left catches the eye (Fig. 5).
Its oddly elongated and suspiciously dense form suggests that it may be an artifact.
Indeed, when we inspected this cluster more closely, we found that it consisted of near-duplicate pictures of the same three cars, such that three pictures appeared multiple times with only minor variations.
A previous study focused specifically on near-duplicates in CIFAR datasets (Barz & Denzler, 2020) and identified
[Table]
y f l a t f i s h b
i
c y c l e m o t
o r c y c l e t r a c t
o r s t r e e t c a r b u s t r a i n t a n k p i
c k u p t
r u c k h
o u s e c a n b o tt l e c a s t l e t e l e v
i s i o n w a r d r o b e c l o c k l a m p t a b l e p l a t e c u p b e d c
o u c h
55 near-duplicates in the ‘automobile’ class (Barz & Denzler, 2020, Table 1).
With our exploratory analysis we found 163 almost identical images in the small orange island (Fig.
A.10).
Another study on labeling errors in standard computer vision datasets including CIFAR-10 missed the nearduplicates (Northcutt et al., 2021).
This suggests that t -SimCNE is more intuitive and more sensitive than other, more conventional, ways to explore image datasets, and can be useful for quality control in actual practice.
The t -SimCNE visualization also highlighted what parts of the dataset SimCLR-like models struggle with.
For example, the model seemed to be confused between dogs and cats as parts of these two classes were merged into one (upper-right corner: black-and-white pets, black pets).
It is less noticeable, but within the cluster of airborne planes there were some images of birds.
Those were pictures of birds flying in the sky, which exhibit a lot of visual similarity to airborne planes, the model’s confusion.
While overall the embedding exhibited a pronounced cluster structure, there were a few outlier points located amidst the white space, which did not seem to belong to any one cluster.
We investigated these images and found some obvious examples of outlier images.
For example, one image, labeled as ‘ship’, depicts a person riding a jet ski (Fig. A.11c).
Another image is labeled as ‘truck’, but we were unable to make out what was actually depicted (Fig. A.11f).
These examples would be hard to find within a dataset of 60 000 images, but they clearly stick out in the 2D t -SimCNE visualization.
4. t -S IM CNE ELUCIDATES INTER - CLASS RELATIONS IN CIFAR-
Similar observations apply to the t -SimCNE embedding of the CIFAR-100 dataset with its much more heterogeneous structure compared to CIFAR-10 (Fig. 6).
In terms of the large-scale organisation, different animal species were placed mostly on the right side of the embedding, while manmade objects could be found on the left side.
In terms of the fine-scale organization, the superclasses were separated very well in the embedding (Fig. 3c), as were many individual classes within a single superclass.
For example, in the superclass ‘flowers’, the embedding clearly distinguished between orchids, sunflowers, roses, tulips, and poppy.
Similarly, in the superclass ‘large natural outdoor scenes’, images of plain, sea, mountain, cloud, and forest were mostly non-overlapping.
On the other hand, in some other superclasses, individual classes were mixed together.
For example, in the superclass ‘people’ (the topmost cluster), all five classes (boy, man, girl, woman, and baby) were intermingled, suggesting that the model struggled in this region of the feature space.
Curiously, the same cluster also contained the ‘flatfish’ class.
We found that the ‘flatfish’ images often show fishermen holding their catch, explaining their appearance in the ‘people’ island (Fig. A.12).
There were further examples of classes that t -SimCNE positioned next to a seemingly wrong superclass.
The ‘forest’ class was separated from other members of the ‘large natural outdoor scenes’ superclass and placed next to the pine, oak, maple, and willow tree classes.
This makes sense, as forest is close to trees both semantically and in terms of the image statistics.
These examples suggest that the class and the superclass definitions in the CIFAR-100 dataset do not always form a reliable ontology capturing all aspects of an image.
D ISCUSSION
We developed a new self-supervised method, t -SimCNE, to visualize image datasets in 2D, and showed that it yields meaningful and interpretable visualizations of CIFAR-10 (Fig. 5) and CIFAR100 (Fig. 6) datasets ( k NN classification accuracy 89% and 51% respectively).
We are not aware of any other unsupervised parametric methods that could yield comparably good 2D embeddings:
• t -SNE embeddings in pixel space are typically very poor as the Euclidean metric is not meaningful for image data (Fig.
A.1).
Any other neighbor embedding method, be it UMAP (McInnes et al., 2018), LargeVis (Tang et al., 2016), TriMap (Amid & Warmuth, 2019), etc., or any of their parametric versions (van der Maaten, 2009; Cho et al., 2018;
Ding et al., 2018;
Szubert et al., 2019; Kalantidis et al., 2022; Sainburg et al., 2021; Damrich et al., 2023), would have the same issue.
• t -SNE embeddings of the trained SimCLR representation are reasonably good (Fig.
A.13), however (i) we found them qualitatively to be less interpretable than the t -SimCNE embeddings, as outliers, artifacts, and subclass structure were less noticeable; and (ii) they are not parametric, i.e. do not allow positioning out-of-sample images into an existing embedding, which is often relevant in applications.
• SimCLR with 3D output yields an embedding on 2-sphere S
but it was outperformed by t -SimCNE in terms of k NN accuracy and visual class separation, and also is cumbersome to visualize on a 2D plane as it requires a map projection (Fig. A.9).
• t -SNE embeddings of a trained ResNet-based classifier representation (Fig.
A.14) are not unsupervised and not useful for data exploration, as they do not show much structure within each of the pre-defined classes.
• Finally, using a readily available off-the-shelf ResNet-based classifier pretrained on ImageNet and visualizing its representation with t -SNE (or UMAP, TriMap, etc.)
is a very fast alternative approach to t -SimCNE. It is unsupervised in a sense that it does not use dataset labels (but is based on supervised ImageNet pretraining). While it is, again, not a parametric method, we found the resulting embeddings to have good k NN accuracy, especially for larger ResNets, such as ResNet-152 (Figs.
A.15 and A.16).
As it is much faster than t -SimCNE, this approach can make sense for initial exploration of the data, however we found that it is strongly outperformed by t -SimCNE in terms of visual class separation, as measured by the clustering-based ARI (Fig. A.17).
Optimizing our architecture with 2D output was challenging and required a carefully tuned training setup.
Our training scheme yielded good 2D embeddings but led to the worse representation in the
H space compared to standard SimCLR.
This suggests that it may be possible to further improve the training protocol and the fine-tuning schedule, which we leave for future work.
In the future it will be interesting to apply t -SimCNE to larger and more complex datasets, such as
ImageNet (Russakovsky et al., 2015) or its subsets, e.g. Tiny ImageNet.
It will also be interesting to apply it to real-life scientific data, e.g. in a biomedical domain.
Our hope is that methods like t -SimCNE will be able to aid scientific exploration and discovery. A CKNOWLEDGMENTS
We thank Wieland Brendel and Evgenia Rusak for discussions on the topic.
This research was funded by the Deutsche Forschungsgemeinschaft (DFG, Germany’s Research
Foundation) via the Excellence Cluster 2064 “Machine Learning: New Perspectives for Science” (390727645), by the German Ministry of Education and Research (T¨ubingen AI Center, 01IS18039A), and by the Cyber Valley Research Fund (D.30.28739).
The authors thank the International Max Planck Research School for Intelligent Systems (IMPRSIS) for supporting Jan Niklas B¨ohm. R EPRODUCIBILITY The code generating our figures is available at https://github.com/berenslab/ t-simcne/tree/iclr2023 . Note that the runs on a GPU are not deterministic, due to nondeterminism introduced by optimized GPU kernels.
Hence a perfect reproduction is impossible, but we confirmed that multiple runs yield very similar results. We always report the mean and standard deviation across several runs, and also show multiple visualizations in Fig. A.8. We implemented a user-friendly class TSimCNE following the sklearn-style API; a minimal working example is shown in the Github repository.
TSimCNE.fit() follows the setup described in this paper, save for one minor detail. We ran all experiments using dataset-level normalization of pixel values. After the experiments were completed, we realized that this normalization does not have any noticeable influence on the results, hence we omit it in the TSimCNE code.
Future development of t -SimCNE will happen in the main branch of the Github repository: https://github.com/ berenslab/t-simcne . A PPENDIX A S UPPLEMENTARY TABLES AND FIGURES [Table] [Figure]
[Figure]
dog frog horse ship truck
[Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure] [Figure]
[Figure] [Figure]
resentation obtained using ImageNet-pretrained ResNet networks. We used clustering to assess how strongly classes were separated from each other in 2D. (a) The adjusted Rand index (ARI; Hubert & Arabie, 1985) between the clusters and the class labels on CIFAR-10. The clusters were obtained with HDBSCAN (McInnes et al., 2017) using the parameter grid min cluster size ∈ { 5 , 15 , . . , 295 } × min samples ∈ { 5 , 15 , . .
. , 145 } with the constraint min samples ≤ min cluster size . The violin plots (Hintze & Nelson, 1998) show the distribution of the ARI values across different HDBSCAN parameter combinations, with the best value indicated above. The black dot denotes the ARI of the default HDBSCAN parameters ( min cluster size = min samples = 5 ). We used ResNet weights that are available in PyTorch
The visualizations of CIFAR t t SNE of pretrained representations. The cluster centroids corresponding to the best clustering ( terms of ARI) are shown