atlas

Research map / Label-efficient and robust learning / Self-supervised and contrastive

Self-supervised Representation Learning from Random Data Projectors

ICLR 2024 · Label-efficient and robust learning › Self-supervised and contrastive · approach: Data-efficient and robust self-supervision · 3 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes learning from randomness (LFR), a modality- and architecture-agnostic SSRL method that trains an encoder to reconstruct outputs of diverse random data projectors via batch-wise Barlow Twins loss, without augmentations or masking.

Problem

Self-supervised representation learning typically relies on data augmentations or masking that are hard to design for non-vision/NLP modalities and can conflict with application-specific constraints (e.g., medical images, time series, tabular data).

Approach

Learn representations by predicting outputs of randomly initialized, scaled-down network projectors from the encoder's embedding through simple predictors; diverse projectors are chosen from many candidates via a determinantal point process, and an EM-style alternating optimization with a batch-wise Barlow Twins divergence is used.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
learn representations by predicting random data projectionsLFR · HARaccuracy: 91.2{ $\pm$0.8} -> 93.1{ $\pm$0.5}Helped
learn representations by predicting random data projectionsLFR · Epilepsyaccuracy: 97.6{ $\pm$0.2} -> 97.9{ $\pm$0.2}Helped
learn representations by predicting random data projectionsLFR · MIMIC-IIICohen's Kappa: 44.9{ $\pm$0.5} -> 46.6{ $\pm$0.3}Helped
learn representations by predicting random data projectionsLFR · Incomeaccuracy: 85.0{ $\pm$0.1} -> 85.2{ $\pm$0.1}Helped
learn representations by predicting random data projectionsLFR · Theoremaccuracy: 50.7{ $\pm$0.7} -> 51.6{ $\pm$0.7}Helped
learn representations by predicting random data projectionsLFR · HEPMASSaccuracy: \textbf{90.7{ $\pm$0.0}} -> 90.1{ $\pm$0.2}Hurt
learn representations by predicting random data projectionsLFR · Kvasiraccuracy: 72.4{ $\pm$0.6} -> 74.9{ $\pm$0.6}Helped
replace Batch-wise Barlow Twins loss with InfoNCE loss (ablation)LFR · Kvasiraccuracy: 74.9 \pm 0.6 -> 72.6 \pm 0.4Hurt
encourage diversity in projectors during initialization and selection (ablation)LFR · KvasiraccuracyHelped
increase the number of random projectors up to 6 (ablation)LFR · Kvasirlinear probing accuracyHelped
increase the number of random projectors beyond 6 (ablation)LFR · Kvasirlinear probing accuracyHurt
vary the training batch size from 64 to 512 (ablation)LFR · Kvasirlinear accuracyNo clear effect

Surprising findings

Limitations

Experimental setup

Datasets: HAR Epilepsy MIMIC-III Income Theorem HEPMASS Kvasir CIFAR10 Fault Diagnosis

Benchmarks: HAR Epilepsy MIMIC-III Income Theorem HEPMASS Kvasir CIFAR10 Fault Diagnosis

Metrics: accuracy Cohen's Kappa linear probe accuracy

Baselines: Autoencoder DACL DIET SimSiam SimCLR TS-TCC SCARF STab Supervised Random Init

Builds on: Barlow Twins SimCLR SimSiam DIET TS-TCC

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy