PaperlayerView exact revision on arXiv

Source-linked AI summary

RankMe: Assessing the downstream performance of pretrained self-supervised representations by their rank

Quentin Garrido, Randall Balestriero, Laurent Najman, Yann Lecun

arXiv:2210.02885v3cs.LGcs.AIcs.CV

TL;DR

JE-SSL lacks reliable label-free ways to assess representations when reconstruction cues and labeled validation data are unavailable. The paper introduces RankMe, an untuned effective-rank criterion based on embedding singular values, and shows that it predicts downstream performance and supports hyperparameter selection with nearly no performance loss relative to label-guided selection. RankMe is therefore a practical tool for evaluating JE-SSL representations in label-scarce settings.

  • Problem

    JE-SSL deployment is difficult because it lacks reconstruction-based visual cues and often requires labels to judge representation quality and tune models.

    Source: §1 · pp. 1–2

  • Method

    RankMe assesses JE-SSL representations using the Shannon entropy of normalized embedding singular values, without training or tunable parameters.

    Source: §1 · p. 2, §3.1 · p. 3

  • Results

    RankMe consistently informs downstream performance across methods and architectures and retrieves or sometimes surpasses most performance from label-guided hyperparameter search.

    Source: §1 · p. 2

  • Takeaways & Limitations

    RankMe enables label-free model and hyperparameter selection for JE-SSL, including evaluation on different downstream datasets.

    Source: §1 · p. 2

    The empirical study focuses on linear classification, with only promising evidence for nonlinear classification, and excludes finetuning.

    Source: §3.2 · p. 4, §6 · p. 9

Abstract

from arXiv · show

Joint-Embedding Self Supervised Learning (JE-SSL) has seen a rapid development, with the emergence of many method variations but only few principled guidelines that would help practitioners to successfully deploy them. The main reason for that pitfall comes from JE-SSL's core principle of not employing any input reconstruction therefore lacking visual cues of unsuccessful training. Adding non informative loss values to that, it becomes difficult to deploy SSL on a new dataset for which no labels can help to judge the quality of the learned representation. In this study, we develop a simple unsupervised criterion that is indicative of the quality of the learned JE-SSL representations: their effective rank. Albeit simple and computationally friendly, this method -- coined RankMe -- allows one to assess the performance of JE-SSL representations, even on different downstream datasets, without requiring any labels. A further benefit of RankMe is that it does not have any training or hyper-parameters to tune. Through thorough empirical experiments involving hundreds of training episodes, we demonstrate how RankMe can be used for hyperparameter selection with nearly no reduction in final performance compared to the current selection method that involve a dataset's labels. We hope that RankMe will facilitate the deployment of JE-SSL towards domains that do not have the opportunity to rely on labels for representations' quality assessment.

1. Introduction

JE-SSL deployment is difficult without labels or visual reconstruction cues for judging representation quality. RankMe addresses this gap as a label-free, untuned criterion that assesses downstream performance and supports hyperparameter selection.

Motivation

  • JE-SSL hyperparameter and model selection commonly relies on labeled-dataset performance, limiting deployment on new unlabeled datasets.Without labels and visual cues from reconstruction, tuning remains challenging.Source: §1 · pp. 1–2

RankMe

  • RankMe estimates representation quality from the singular-value distribution of learned embeddings without training, labels, or tunable parameters.Its construction is motivated by the relationship between classifier input rank and training performance.Source: §1 · p. 2

Evidence

  • RankMe informs downstream performance across JE-SSL methods, architectures, and evaluation settings, including in-distribution and out-of-distribution datasets.The study evaluates methods including VICReg, SimCLR, DINO, and variants.Source: §1 · p. 2

Hyperparameter selection

  • RankMe retrieves and sometimes surpasses most performance found by manual label-guided hyperparameter search without using labels.The paper reports this capability on both in-domain and out-of-domain datasets.Source: §1 · p. 2

Evaluation

  • Experiments cover 11 datasets and 110 models across five methods, including linear and nonlinear probing without downstream labels or task samples.These experiments test whether RankMe distinguishes successful from sub-optimal JE-SSL training.Source: §1 · p. 2

2. Background

JE-SSL research includes contrastive and non-contrastive approaches whose representations can exhibit dimensional collapse. This study formalizes whether representation rank can identify successful training and quantify collapse-related performance differences.

JE-SSL families

  • JE-SSL methods comprise contrastive and non-contrastive families that differ in how they prevent representational collapse.Contrastive methods separate negative samples, whereas non-contrastive methods use other mechanisms.Source: §2 · p. 2

Representation spectrum

  • Prior work established dimensional collapse as a theoretical and empirical phenomenon in JE-SSL representations.Studies examined whitening, augmentations, partially collapsed encoders, and practical causes of collapse.Source: §2 · p. 2

Figure 1

  • Figure 1 relates encoder-output classification performance to projector-output RankMe values for in-distribution and out-of-distribution ImageNet evaluations.The figure also compares supervised linear-probe selection with unsupervised RankMe selection.Source: Figure 1 · p. 3

Open problem

  • Existing studies informally favor representations with less collapse, but had not formally tested whether this identifies successful models or quantified collapse.Formal quantification of collapse for improving representations is the stated goal of this study.Source: §2 · p. 3

3. RankMe Consistently Predicts Downstream performances From Representations

RankMe estimates representation quality from the embedding singular-value distribution and is evaluated as a label-free predictor of downstream performance. Across methods, datasets, architectures, and evaluation protocols, higher rank generally indicates better performance, but rank alone is not sufficient for comparing different approaches.

RankMe: A Simple Method and Its Implementation

  • RankMe is a smooth rank measure based on the normalized singular values of the source dataset’s embedding matrix.Unlike classical rank, it avoids choosing a hard nonzero threshold and also quantifies embedding whitening.Source: §3.1 · pp. 3–4
  • RankMe should compare runs of a given method because embedding rank is not the only factor affecting performance.The authors estimate RankMe accurately using 25,600 samples in practice.Source: §3.1 · p. 4

RankMe Predicts Linear Probing performance Even on Unseen Datasets

  • RankMe is compared with label-based linear evaluation and other unsupervised criteria, while finetuning is excluded because it can alter pretrained representations.The paper also notes that dimensional collapse is not the only factor determining performance, so cross-method comparisons should be avoided.Source: §3.2 · p. 4, §3.1 · p. 4

Experimental Methods and Datasets Considered

  • Across five JE-SSL methods and eleven datasets, RankMe distinguishes successful from sub-optimal training without labels or downstream task samples.The evaluation covers linear and nonlinear probing regimes.Source: §3.2 · p. 4

RankMe as a Prediction of Linear Classification Accuracy

  • For a given method, higher embedding rank generally improves performance on both the pretraining dataset and downstream datasets, although high rank is only a necessary condition.On StanfordCars, the best VICReg performance does not occur at the highest rank, while full-rank embeddings still perform well.Source: §3.2 · p. 5, Figure 2 · p. 5

RankMe Also Holds for Non-linear Probing

  • The rank-performance relationship persists with a three-layer MLP head and k-NN evaluation, indicating that RankMe extends beyond linear evaluation.Figure 3 reports the same conclusion before and after the projector and for k-NN on ImageNet.Source: §3.3 · p. 5, Figure 3 · p. 5

4. RankMe for Label-Free Cross-Validation

RankMe selects JE-SSL hyperparameters by choosing the model with the highest embedding rank, without labels or tuning. Across embedding, representation, OOD, iNat-18, and finetuning evaluations, it generally retrieves performance close to oracle-based selection.

Selection procedure

  • RankMe selects the hyperparameter value producing the highest rank, using the first value reaching a maximum when ordered values tie.The procedure is illustrated for loss and optimization hyperparameters, including temperature, learning rate, and weight decay.Source: §4 · p. 5, §4.1 · p. 6, Figure 4 · p. 6

Embedding evaluation

  • Across ImageNet embedding evaluations, RankMe retrieves most oracle-selected performance, with average gaps below half a point.On OOD datasets, RankMe sometimes improves performance and has similar average performance to ImageNet validation selection.Source: §4.2 · p. 6

Representation evaluation

  • For representations before the projector, RankMe trails the ImageNet oracle but remains within less than half a point on average while requiring no labels or tunable parameters.RankMe also outperforms α-ReQ in most settings and avoids similarly severe worst-case drops.Source: §4.2 · p. 6

Beyond ImageNet

  • On iNat-18 pretraining, RankMe matches the iNat-18 oracle for VICReg and slightly improves OOD performance, while SimCLR shows a small drop versus oracle selection.For VICReg, RankMe also beats the ImageNet oracle and α-ReQ by a significant margin.Source: §4.2 · p. 7, Table 2 · p. 7

Finetuning benchmarks

  • In finetuning-based benchmarks, RankMe retrieves most task-oracle performance, with small drops in semi-supervised ImageNet evaluation and matching or increased performance for object detection.These results suggest RankMe remains useful even though finetuning changes pretrained weights and may change representation rank.Source: §4.2 · p. 7, Table 3 · p. 7

Supporting analyses

  • RankMe’s selection behavior is supported by cross-dataset rank transfer and correlations between embedding and representation performance.Figure 5 reports rank transfer across source and target datasets and highly correlated train and test accuracy across datasets.Source: Figure 5 · p. 8, §4.2 · p. 8

5. RankMe: From Theory to Implementation

RankMe is theoretically motivated by the relationship between embedding rank and approximation or classification performance, then extended empirically to unseen target datasets. Its use depends on assumptions about probing, monotonicity, and rank transfer across distributions.

Theory

  • RankMe is constructed by relating embedding rank to approximation and classification performance.The theoretical development uses approximation bounds and Cover’s theorem to motivate rank as a performance indicator.Source: §5 · p. 8
  • Maximum training accuracy in linear regression or classification increases with embedding rank, plateauing for classification once rank exceeds the number of classes.Source: §5 · p. 8
  • A higher RankMe value predicts greater training performance only when comparing models from the same method, because rank is not the sole performance factor.Source: §5 · p. 8

Empirical assumptions

  • Extending RankMe to target performance requires verifying that probes do not overfit, embedding and representation performance are monotonically linked, and source and target ranks are related.Source: §5 · p. 8
  • Rank scales linearly across ImageNet and iNaturalist representations, with Pearson correlations above 0.99, whereas StanfordCars shows weaker scaling because of limited ImageNet overlap.Source: §5 · p. 9

6. Conclusion

The paper concludes that dimensional collapse provides a label-free metric for evaluating JE-SSL representations and selecting models. RankMe shows promise beyond linear classification, but broader validation remains future work.

  • Dimensional collapse can evaluate JE-SSL models from training data alone, without labels, additional training, or tunable parameters.Source: §6 · p. 9
  • RankMe provides promising results in nonlinear classification despite the paper’s primary focus on linear classification.Source: §6 · p. 9
  • RankMe is competitive with oracle-based hyperparameter selection, supporting its use where labels are scarce.Source: §6 · p. 9
  • The authors identify more varied scenarios as future work for establishing RankMe’s broader usefulness in designing self-supervised methods.Source: §6 · p. 9

Methods studied

  • The implementation study covers SimCLR, VICReg, VICReg-exp, and VICReg-ctr, with losses combining invariance, variance, and covariance-related components.Source: A. Background · p. 12

B. Visualizations on iNaturalist-18

On iNaturalist-18, RankMe reproduces the trends observed on ImageNet for SimCLR and VICReg. Because the representation dimension is 2048, RankMe values above that threshold are clipped.

C. Applicability to cluster based methods

The paper extends RankMe to DINO by analyzing collapse around its projector and clustering prototypes. RankMe can assess DINO performance and select hyperparameters using either embeddings or prototypes.

DINO structure

RankMe evaluation

D. Complete visualizations on all datasets

Additional visualizations largely reproduce the earlier relationship between representation rank and downstream performance across datasets. Higher rank generally supports better generalization, although Food101 shows nearly identical performance across methods.

E. Detailed results for α-ReQ

The appendix examines α-ReQ as an alternative rank-related criterion and finds weak direct alignment with downstream performance. Its power-law assumption fails for collapsed embeddings, whereas the entropic and classical rank estimators agree closely.

α-ReQ and performance

Power-law assumption

Rank estimators

G. Convergence of the rank estimators

Rank estimation converges quickly with increasing sample size, while the classical and entropic estimators produce highly similar qualitative conclusions. The rank relationship also transfers from source to target datasets.

Estimator convergence

Transfer across datasets

Rank and performance

  • Higher ImageNet rank leads to improved performance across methods and datasets, with an even clearer link for representations.Source: Figure S13 · p. 22

Estimator comparison

I.2. Evaluation

The evaluation uses specified downstream optimization settings and reports top-1 results for representations, embeddings, and post-projector rank across multiple experimental runs. Tables organize the corresponding hyperparameters and outcomes.

Evaluation setup

Reported metrics

Related papers

Loading 2210.02885v3…