Towards Robust EEG Decoding Based on Riemannian Self-Attention

• URL: http://arxiv.org/abs/2606.25456v1
• Date: Wed, 24 Jun 2026 06:31:20 GMT
• Title: Towards Robust EEG Decoding Based on Riemannian Self-Attention
• Abstract summary: Brain-Computer Interface (BCI) based on electroencephalography (EEG) has significant applications in assistive technologies, medical rehabilitation, and entertainment.<n>Recent EEG decoding methods based on Symmetric Positive Definite (SPD) learning have demonstrated superior performance.<n>These methods typically employ basic network architectures and do not explicitly capture local relationships between EEG signals.<n>This limitation is problematic for EEG signals due to their inherently low Signal-to-Noise Ratio (SNR)
• Score: 49.95065559566893
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Brain-Computer Interface (BCI) based on electroencephalography (EEG) enables direct interaction between the brain and external environments and has significant applications in assistive technologies, medical rehabilitation, and entertainment. Recently, EEG decoding methods based on Symmetric Positive Definite (SPD) learning have demonstrated superior performance. However, these methods typically employ basic network architectures and do not explicitly capture local relationships between EEG signals. This limitation is problematic for EEG signals due to their inherently low Signal-to-Noise Ratio (SNR). Moreover, most existing Riemannian manifold-based methods are restricted to specific metrics. The most widely used is the Affine-Invariant Metric (AIM). However, it has a quadratic dependency on the SPD matrices and cannot handle ill-conditioned SPD matrices, which hinders the effectiveness of networks. In contrast, the Bures-Wasserstein Metric (BWM) exhibits linear dependence on SPD matrices and demonstrates superior performance for ill conditioning. To overcome these challenges, we propose a Riemannian self-attention network based on the BWM. Additionally, the recently introduced power-deformed generalized Bures-Wasserstein metric reveals a nonlinear relationship between SPD matrices and matrix power deformation. This metric provides a more nuanced representation of the geometric structure of the SPD manifold. Consequently, we extend our model to a learnable version. For simplicity, we refer to it as GBWAtt. Experimental results on three EEG benchmarking datasets validate the robustness and effectiveness of our proposed method. The code is available at https://github.com/jissc/GBWAtt.

Related papers

• Rectifying Geometric Misalignment: Online Source-Free Adaptation for Class-Imbalanced EEG [7.275134628956466]
  In online BCI scenarios, the label distributions vary dynamically (label shift) causing standard alignment techniques to misalign the target data distributions.<n>We propose OSPDIM (Online SPD manifold information framework), a geometric-free online UDA framework designed to address label shifts.<n>OSPDIM estimates and corrects bias on-the-fly, unlike offline methods relying on global batch statistics.
  arXiv  Detail & Related papers  (2026-08-05T18:17:59Z)
• Learning to Normalize on the SPD Manifold under Bures-Wasserstein Geometry [11.846361701184254]
  Covariance matrices have proven highly effective across many scientific fields.<n>The primary challenge in representation learning is to respect this underlying geometric structure.<n>We propose a novel RBN algorithm based on the Bures-Wasserstein metric, incorporating a learnable metric parameter.
  arXiv  Detail & Related papers  (2025-04-01T11:12:58Z)
• Geodesic Optimization for Predictive Shift Adaptation on EEG data [53.58711912565724]
  Domain adaptation methods struggle when distribution shifts occur simultaneously in $X$ and $y$. This paper proposes a novel method termed Geodesic Optimization for Predictive Shift Adaptation (GOPSA) to address test-time multi-source DA. GOPSA has the potential to combine the advantages of mixed-effects modeling with machine learning for biomedical applications of EEG.
  arXiv  Detail & Related papers  (2024-07-04T12:15:42Z)
• Geometric Neural Network based on Phase Space for BCI-EEG decoding [2.8196015357423376]
  The integration of Deep Learning algorithms on brain signal analysis is still in its nascent stages. EEG is a widely adopted choice for designing BCI systems due to its non-invasive and cost-effective nature and excellent temporal resolution. We propose the Phase-SPDNet architecture and analyze its performance and the interpretability of the results.
  arXiv  Detail & Related papers  (2024-03-08T19:36:20Z)
• Riemannian Self-Attention Mechanism for SPD Networks [34.794770395408335]
  An SPD manifold self-attention mechanism (SMSA) is proposed in this paper. An SMSA-based geometric learning module (SMSA-GL) is designed for the sake of improving the discrimination of structured representations.
  arXiv  Detail & Related papers  (2023-11-28T12:34:46Z)
• Large-Scale OD Matrix Estimation with A Deep Learning Method [70.78575952309023]
  The proposed method integrates deep learning and numerical optimization algorithms to infer matrix structure and guide numerical optimization. We conducted tests to demonstrate the good generalization performance of our method on a large-scale synthetic dataset.
  arXiv  Detail & Related papers  (2023-10-09T14:30:06Z)
• Riemannian Multinomial Logistics Regression for SPD Neural Networks [60.11063972538648]
  We propose a new type of deep neural network for Symmetric Positive Definite (SPD) matrices. Our framework offers a novel intrinsic explanation for the most popular LogEig classifier in existing SPD networks. The effectiveness of our method is demonstrated in three applications: radar recognition, human action recognition, and electroencephalography (EEG) classification.
  arXiv  Detail & Related papers  (2023-05-18T20:12:22Z)
• mSPD-NN: A Geometrically Aware Neural Framework for Biomarker Discovery from Functional Connectomics Manifolds [8.37609145576126]
  We propose a geometrically aware neural framework for connectomes, i.e., the mSPD-NN. We demonstrate the efficacy of our mSPD-NN against common alternatives for SPD mean estimation. It uncovers stable biomarkers associated with subtle network differences among patients with ADHD-ASD comorbidities and healthy controls.
  arXiv  Detail & Related papers  (2023-03-27T08:30:11Z)
• Adaptive Log-Euclidean Metrics for SPD Matrix Learning [73.12655932115881]
  We propose Adaptive Log-Euclidean Metrics (ALEMs), which extend the widely used Log-Euclidean Metric (LEM) The experimental and theoretical results demonstrate the merit of the proposed metrics in improving the performance of SPD neural networks.
  arXiv  Detail & Related papers  (2023-03-26T18:31:52Z)
• Repulsive Mixture Models of Exponential Family PCA for Clustering [127.90219303669006]
  The mixture extension of exponential family principal component analysis ( EPCA) was designed to encode much more structural information about data distribution than the traditional EPCA. The traditional mixture of local EPCAs has the problem of model redundancy, i.e., overlaps among mixing components, which may cause ambiguity for data clustering. In this paper, a repulsiveness-encouraging prior is introduced among mixing components and a diversified EPCA mixture (DEPCAM) model is developed in the Bayesian framework.
  arXiv  Detail & Related papers  (2020-04-07T04:07:29Z)

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.