CVLGMay 13, 2025

Robust Emotion Recognition via Bi-Level Self-Supervised Continual Learning

arXiv:2505.10575v24 citationsh-index: 15
Originality Incremental advance
AI Analysis

This addresses robust emotion recognition for affective computing applications, but it is incremental as it builds on existing continual learning and domain adaptation techniques.

The paper tackles the problem of emotion recognition from physiological signals like EEG, which suffers from cross-subject variability and noisy labels, by proposing a bi-level self-supervised continual learning framework that outperforms existing methods on two EEG tasks.

Emotion recognition through physiological signals such as electroencephalogram (EEG) has become an essential aspect of affective computing and provides an objective way to capture human emotions. However, physiological data characterized by cross-subject variability and noisy labels hinder the performance of emotion recognition models. Existing domain adaptation and continual learning methods struggle to address these issues, especially under realistic conditions where data is continuously streamed and unlabeled. To overcome these limitations, we propose a novel bi-level self-supervised continual learning framework, SSOCL, based on a dynamic memory buffer. This bi-level architecture iteratively refines the dynamic buffer and pseudo-label assignments to effectively retain representative samples, enabling generalization from continuous, unlabeled physiological data streams for emotion recognition. The assigned pseudo-labels are subsequently leveraged for accurate emotion prediction. Key components of the framework, including a fast adaptation module and a cluster-mapping module, enable robust learning and effective handling of evolving data streams. Experimental validation on two mainstream EEG tasks demonstrates the framework's ability to adapt to continuous data streams while maintaining strong generalization across subjects, outperforming existing approaches.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes