Tasting the cake: evaluating self-supervised generalization on out-of-distribution multimodal MRI data
Self-supervised learning has enabled significant improvements on natural image benchmarks. However, there is less work in the medical imaging domain in this area. The optimal models have not yet been determined among the various options. Moreover, little work has evaluated the current applicability limits of novel self-supervised methods. In this paper, we evaluate a range of current contrastive self-supervised methods on out-of-distribution generalization in order to evaluate their applicability to medical imaging. We show that self-supervised models are not as robust as expected based on their results in natural imaging benchmarks and can be outperformed by supervised learning with dropout. We also show that this behavior can be countered with extensive augmentation. Our results highlight the need for out-of-distribution generalization standards and benchmarks to adopt the self-supervised methods in the medical imaging community.
Code (1)
Tasks
Out-of-Distribution GeneralizationSelf-Supervised LearningSimilar Papers 제목 키워드 기반
The Cake that is Intelligence and Who Gets to Bake it: An AI Analogy and its Implications for Participation
In a widely popular analogy by Turing Award Laureate Yann LeCun, machine intelligence has been compared to cake - where unsupervised learning forms the base, supervised learning adds the icing, and reinforcement learning…
Cherry on the Cake: Fairness is NOT an Optimization Problem
In Fair AI literature, the practice of maliciously creating unfair models that nevertheless satisfy fairness constraints is known as "cherry-picking". A cherry-picking model is a model that makes mistakes on purpose, sel…
FairnessMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONApple Tasting: Combinatorial Dimensions and Minimax Rates
In online binary classification under \emph{apple tasting} feedback, the learner only observes the true label if it predicts ``1". First studied by \cite{helmbold2000apple}, we revisit this classical partial-feedback set…
Binary ClassificationDeterministic Apple Tasting
In binary ($0/1$) online classification with apple tasting feedback, the learner receives feedback only when predicting $1$. Besides some degenerate learning tasks, all previously known learning algorithms for this model…
Two-Action Apple Tasting with Switching Costs
We study the two-action apple-tasting problem with switching costs against an oblivious adversary. In an equivalent normalized formulation, at each round the learner chooses between a revealing action and a blind action:…