Probabilistic Self-supervised Learning via Scoring Rules Minimization
Amirhossein Vahidi, Simon Scho{\ss}er, Lisa Wimmer, Yawei Li, Bernd, Bischl, Eyke H\"ullermeier, Mina Rezaei

TL;DR
ProSMIN introduces a probabilistic self-supervised learning framework that uses scoring rules minimization to improve representation quality, robustness, and calibration across various tasks and datasets.
Contribution
It presents a novel loss function based on proper scoring rules and a theoretical convergence analysis for probabilistic self-supervised learning.
Findings
Achieves superior accuracy on ImageNet variants
Improves calibration and robustness in downstream tasks
Demonstrates scalability on large-scale datasets
Abstract
In this paper, we propose a novel probabilistic self-supervised learning via Scoring Rule Minimization (ProSMIN), which leverages the power of probabilistic models to enhance representation quality and mitigate collapsing representations. Our proposed approach involves two neural networks; the online network and the target network, which collaborate and learn the diverse distribution of representations from each other through knowledge distillation. By presenting the input samples in two augmented formats, the online network is trained to predict the target network representation of the same sample under a different augmented view. The two networks are trained via our new loss function based on proper scoring rules. We provide a theoretical justification for ProSMIN's convergence, demonstrating the strict propriety of its modified scoring rule. This insight validates the method's…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDomain Adaptation and Few-Shot Learning · Advanced Neural Network Applications · COVID-19 diagnosis using AI
