SPD domain-specific batch normalization to crack interpretable unsupervised domain adaptation in EEG

• URL: http://arxiv.org/abs/2206.01323v1
• Date: Thu, 2 Jun 2022 22:31:36 GMT
• Title: SPD domain-specific batch normalization to crack interpretable unsupervised domain adaptation in EEG
• Authors: Reinmar J Kobler, Jun-ichiro Hirayama, Qibin Zhao, Motoaki Kawanabe
• Abstract summary: Current EEG technology does not generalize well across domains without expensive supervised re-calibration. We propose a new building block for geometric deep learning, which we denote SPD domain-specific momentum batch normalization (SPDDSMBN) A SPDDSMBN layer can transform domain-specific SPD inputs into domain-invariant SPD outputs, and can be readily applied to multi-source/-target and online UDA scenarios.
• Score: 25.642435946325925
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Electroencephalography (EEG) provides access to neuronal dynamics non-invasively with millisecond resolution, rendering it a viable method in neuroscience and healthcare. However, its utility is limited as current EEG technology does not generalize well across domains (i.e., sessions and subjects) without expensive supervised re-calibration. Contemporary methods cast this transfer learning (TL) problem as a multi-source/-target unsupervised domain adaptation (UDA) problem and address it with deep learning or shallow, Riemannian geometry aware alignment methods. Both directions have, so far, failed to consistently close the performance gap to state-of-the-art domain-specific methods based on tangent space mapping (TSM) on the symmetric positive definite (SPD) manifold. Here, we propose a theory-based machine learning framework that enables, for the first time, learning domain-invariant TSM models in an end-to-end fashion. To achieve this, we propose a new building block for geometric deep learning, which we denote SPD domain-specific momentum batch normalization (SPDDSMBN). A SPDDSMBN layer can transform domain-specific SPD inputs into domain-invariant SPD outputs, and can be readily applied to multi-source/-target and online UDA scenarios. In extensive experiments with 6 diverse EEG brain-computer interface (BCI) datasets, we obtain state-of-the-art performance in inter-session and -subject TL with a simple, intrinsically interpretable network architecture, which we denote TSMNet.

Related papers

• SPDIM: Source-Free Unsupervised Conditional and Label Shift Adaptation in EEG [6.002670452103349]
  Non-stationary electroencephalography (EEG) introduces distribution shifts across domains (e.g., days and subjects) Without labeled calibration data for target domains, the problem is a source-free unsupervised domain adaptation (SFUDA) problem. We propose a geometric deep learning framework for SFUDA problems under specific distribution shifts, including label shifts.
  arXiv  Detail & Related papers  (2024-10-26T21:27:53Z)
• START: A Generalized State Space Model with Saliency-Driven Token-Aware Transformation [27.301312891532277]
  Domain Generalization (DG) aims to enable models to generalize to unseen target domains by learning from multiple source domains. We propose START, which achieves state-of-the-art (SOTA) performances and offers a competitive alternative to CNNs and ViTs. Our START can selectively perturb and suppress domain-specific features in salient tokens within the input-dependent matrices of SSMs, thus effectively reducing the discrepancy between different domains.
  arXiv  Detail & Related papers  (2024-10-21T13:50:32Z)
• Enhancing Domain Adaptation through Prompt Gradient Alignment [16.618313165111793]
  We develop a line of works based on prompt learning to learn both domain-invariant and specific features. We cast UDA as a multiple-objective optimization problem in which each objective is represented by a domain loss. Our method consistently surpasses other prompt-based baselines by a large margin on different UDA benchmarks.
  arXiv  Detail & Related papers  (2024-06-13T17:40:15Z)
• Unified Domain Adaptive Semantic Segmentation [96.74199626935294]
  Unsupervised Adaptive Domain Semantic (UDA-SS) aims to transfer the supervision from a labeled source domain to an unlabeled target domain. We propose a Quad-directional Mixup (QuadMix) method, characterized by tackling distinct point attributes and feature inconsistencies. Our method outperforms the state-of-the-art works by large margins on four challenging UDA-SS benchmarks.
  arXiv  Detail & Related papers  (2023-11-22T09:18:49Z)
• Towards Subject Agnostic Affective Emotion Recognition [8.142798657174332]
  EEG signals manifest subject instability in subject-agnostic affective Brain-computer interfaces (aBCIs) We propose a novel framework, meta-learning based augmented domain adaptation for subject-agnostic aBCIs. Our proposed approach is shown to be effective in experiments on a public aBICs dataset.
  arXiv  Detail & Related papers  (2023-10-20T23:44:34Z)
• Amplitude Spectrum Transformation for Open Compound Domain Adaptive Semantic Segmentation [62.68759523116924]
  Open compound domain adaptation (OCDA) has emerged as a practical adaptation setting. We propose a novel feature space Amplitude Spectrum Transformation (AST)
  arXiv  Detail & Related papers  (2022-02-09T05:40:34Z)
• Deep Optimal Transport for Domain Adaptation on SPD Manifolds [9.552869120136005]
  neuroimaging data possess the mathematical properties of symmetry and positive definiteness. Applying conventional domain adaptation methods is challenging because these mathematical properties can be disrupted. We introduce a novel geometric deep learning-based approach to manage discrepancies in both marginal and conditional distributions.
  arXiv  Detail & Related papers  (2022-01-15T03:13:02Z)
• Decompose to Adapt: Cross-domain Object Detection via Feature Disentanglement [79.2994130944482]
  We design a Domain Disentanglement Faster-RCNN (DDF) to eliminate the source-specific information in the features for detection task learning. Our DDF method facilitates the feature disentanglement at the global and local stages, with a Global Triplet Disentanglement (GTD) module and an Instance Similarity Disentanglement (ISD) module. By outperforming state-of-the-art methods on four benchmark UDA object detection tasks, our DDF method is demonstrated to be effective with wide applicability.
  arXiv  Detail & Related papers  (2022-01-06T05:43:01Z)
• Cluster, Split, Fuse, and Update: Meta-Learning for Open Compound Domain Adaptive Semantic Segmentation [102.42638795864178]
  We propose a principled meta-learning based approach to OCDA for semantic segmentation. We cluster target domain into multiple sub-target domains by image styles, extracted in an unsupervised manner. A meta-learner is thereafter deployed to learn to fuse sub-target domain-specific predictions, conditioned upon the style code. We learn to online update the model by model-agnostic meta-learning (MAML) algorithm, thus to further improve generalization.
  arXiv  Detail & Related papers  (2020-12-15T13:21:54Z)
• Deep Multi-Task Learning for Cooperative NOMA: System Design and Principles [52.79089414630366]
  We develop a novel deep cooperative NOMA scheme, drawing upon the recent advances in deep learning (DL) We develop a novel hybrid-cascaded deep neural network (DNN) architecture such that the entire system can be optimized in a holistic manner.
  arXiv  Detail & Related papers  (2020-07-27T12:38:37Z)
• Domain Conditioned Adaptation Network [90.63261870610211]
  We propose a Domain Conditioned Adaptation Network (DCAN) to excite distinct convolutional channels with a domain conditioned channel attention mechanism. This is the first work to explore the domain-wise convolutional channel activation for deep DA networks.
  arXiv  Detail & Related papers  (2020-05-14T04:23:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.