mlsanityData to 7 Oct 2026

Evaluating Representations with Readout Model Switching

arXiv 2302.09579 ↗First posted 19 Feb 2023cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Although much of the success of Deep Learning builds on learning good representations, a rigorous method to evaluate their quality is lacking. In this paper, we treat the evaluation of representations as a model selection problem and propose to use the Minimum Description Length (MDL) principle to devise an evaluation metric. Contrary to the established practice of limiting the capacity of the readout model, we design a hybrid discrete and continuous-valued model space for the readout models and employ a switching strategy to combine their predictions. The MDL score takes model complexity, as well as data efficiency into account. As a result, the most appropriate model for the specific task and representation will be chosen, making it a unified measure for comparison. The proposed metric can be efficiently computed with an online method and we present results for pre-trained vision encoders of various architectures (ResNet and ViT) and objective functions (supervised and self-supervised) on a range of downstream tasks. We compare our methods with accuracy-based approaches and show that the latter are inconsistent when multiple readout models are used. Finally, we discuss important properties revealed by our evaluations such as model scaling, preferred readout model, and data efficiency.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 21 of its 53 references that are in the map. First posted on arXiv 19 Feb 2023.

Builds on

21 of 53 references.

References · 21

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  5. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  6. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  7. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  8. 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
  9. 2014How transferable are features in deep neural networks?cited by 1,216
  10. 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 672
  11. 2019Designing and Interpreting Probes with Control Taskscited by 608
  12. 2020Information-Theoretic Probing with Minimum Description Lengthcited by 230
9 more
  1. 2019Learning and Evaluating General Linguistic Intelligencecited by 78
  2. 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
  3. 2022Pushing the limits of self-supervised ResNets: Can we outperform supervised learning without labels on ImageNet?cited by 67
  4. 2020Small Data, Big Decisions: Model Selection in the Small-Data Regimecited by 23
  5. 2020Evaluating representations by the complexity of learning low-loss predictorscited by 16
  6. 2022Sequential Learning Of Neural Networks for Prequential MDLcited by 13
  7. 2019Probing the State of the Art: A Critical Look at Visual Representation Evaluationcited by 6
  8. 2022Empirical Evaluation and Theoretical Analysis for Representation Learning: A Surveycited by 5
  9. 2013Universal Codes from Switching Strategiescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.