mlsanityData to 14 Oct 2026

Towards Sleep Scoring Generalization Through Self-Supervised Meta-Learning

arXiv 2207.13801 ↗First posted 27 Jul 2022cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

In this work we introduce a novel meta-learning method for sleep scoring based on self-supervised learning. Our approach aims at building models for sleep scoring that can generalize across different patients and recording facilities, but do not require a further adaptation step to the target data. Towards this goal, we build our method on top of the Model Agnostic Meta-Learning (MAML) framework by incorporating a self-supervised learning (SSL) stage, and call it S2MAML. We show that S2MAML can significantly outperform MAML. The gain in performance comes from the SSL stage, which we base on a general purpose pseudo-task that limits the overfitting to the subject-specific patterns present in the training dataset. We show that S2MAML outperforms standard supervised learning and MAML on the SC, ST, ISRUC, UCD and CAP datasets.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 7 of its 16 references that are in the map. First posted on arXiv 27 Jul 2022.

Builds on

7 of 16 references.

References · 7

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  3. 2020Uncovering the structure of clinical EEG signals with self-supervised learningcited by 109
  4. 2018SeqSleepNet: End-to-End Hierarchical Recurrent Neural Network for Sequence-to-Sequence Automatic Sleep Stagingcited by 91
  5. 2021DeepSleepNet-Lite: A Simplified Automatic Sleep Stage Scoring Model with Uncertainty Estimatescited by 26
  6. 2021Model-Agnostic Meta-Learning for EEG Motor Imagery Decoding in Brain-Computer-Interfacingcited by 4
  7. 2020Boosting Generalization in Bio-Signal Classification by Learning the Phase-Amplitude Couplingcited by 3

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 1.

2 papers.