riemannian-self-attention-eeg-decoding

name	riemannian-self-attention-eeg-decoding
description	Bures-Wasserstein metric-based Riemannian self-attention network for robust EEG decoding
category	ai_collection
tags	["eeg-decoding","riemannian-geometry","self-attention","symmetric-positive-definite","brain-computer-interface","KDD-2026"]

GBWAtt: Riemannian Self-Attention for Robust EEG Decoding

Overview

GBWAtt introduces a Riemannian self-attention network based on the Bures-Wasserstein Metric (BWM) for EEG signal decoding. The method addresses key limitations of existing SPD learning approaches: basic network architectures that fail to capture local relationships, and reliance on metrics (like Affine-Invariant Metric) that suffer from quadratic complexity and ill-conditioning problems.

Publication: KDD 2026
arXiv: 2606.25456
Code: https://github.com/jissc/GBWAtt
Authors: Shaocheng Jin, Tao Zhou, Rui Wang, Ziheng Chen, Xiaoqing Luo, Xiaojun Wu, Josef Kittler

Core Innovation

Bures-Wasserstein Metric for SPD Matrices

Traditional Riemannian methods use the Affine-Invariant Metric (AIM) which has:

• Quadratic dependency on SPD matrices
• Ill-conditioning problems with poorly conditioned covariance matrices
• Computational overhead in high dimensions

BWM provides:

• Linear dependence on SPD matrices
• Better conditioning properties
• Efficient computation for large-scale EEG data

Power-Deformed Generalized BWM

The model extends to a learnable version using power-deformed generalized BWM:

• Introduces nonlinear relationship between SPD matrices via matrix power deformation
• Provides more nuanced representation of geometric structure on SPD manifold
• Learnable parameters adapt to data characteristics during training

Technical Approach

1. SPD Matrix Representation

• EEG signals represented as Symmetric Positive Definite (SPD) covariance matrices
• Captures second-order statistics and cross-channel relationships
• Naturally handles the non-Euclidean geometry of covariance space

2. Riemannian Self-Attention

• Attention mechanism operates on SPD manifold
• Uses BWM for distance/similarity computation between SPD matrices
• Captures local relationships between EEG signal components
• Preserves geometric structure during feature aggregation

3. Learnable Metric Adaptation

• Power deformation parameter is learned from data
• Adapts to specific EEG characteristics (task, subject, noise level)
• Balances between BWM (linear) and AIM (quadratic) behaviors

Key Results

Performance on EEG Benchmarks

• Validated on three EEG benchmarking datasets
• Demonstrates superior robustness and effectiveness
• Outperforms existing Riemannian manifold-based methods
• Code publicly available for reproducibility

Advantages Demonstrated

• Robustness: Handles ill-conditioned SPD matrices better than AIM-based methods
• Efficiency: Linear complexity enables scaling to high-dimensional EEG
• Local structure: Self-attention captures local relationships missed by basic architectures

Applications

Brain-Computer Interfaces

• Motor imagery decoding: Classify imagined movements from EEG
• Event-related potentials: Detect P300, SSVEP, and other ERP components
• Emotion recognition: Decode affective states from EEG patterns
• Clinical applications: Seizure detection, sleep staging, cognitive assessment

Assistive Technologies

• Prosthetic control via motor imagery
• Communication systems for locked-in patients
• Adaptive interfaces for accessibility

Methodological Insights

Why Riemannian Geometry for EEG?

• EEG covariance matrices naturally live on SPD manifold
• Euclidean operations (averaging, interpolation) are invalid on curved spaces
• Riemannian methods respect the intrinsic geometry
• Better statistical properties for small sample sizes

Why BWM over AIM?

• AIM requires matrix logarithm/expensive operations
• BWM uses Wasserstein geometry (optimal transport)
• More stable numerical behavior
• Linear scaling enables real-time BCI applications

Implementation Considerations

Computational Requirements

• SPD matrix computation: O(channels² × timepoints)
• BWM attention: Linear in number of SPD matrices
• Power deformation: Eigenvalue decomposition (one-time cost)

Training Recommendations

• Initialize power deformation parameter near identity
• Use Riemannian batch normalization for stable training
• Consider data augmentation on SPD manifold (tangent space perturbations)

Integration with Existing Pipelines

• Can replace standard attention layers in EEG transformers
• Compatible with existing SPD preprocessing (covariance estimation)
• Works with common EEG toolboxes (MNE, PyTorch, TensorFlow)

Related Methods

Riemannian EEG Decoding

• Riemannian SVM/Tangent Space LDA
• Riemannian PotNet, Riemannian ResNet
• SPDNet, ManifoldNet

Self-Attention for EEG

• EEG Conformer, EEG Transformer
• Attention-based CSP methods
• Multi-head attention for BCI

Limitations

• Requires accurate covariance estimation (sensitive to trial length)
• Assumes stationarity within analysis windows
• Power deformation adds hyperparameters to tune
• Not yet validated on real-time BCI systems (offline benchmarks only)

Future Directions

• Real-time implementation for online BCI
• Extension to non-stationary EEG via adaptive Riemannian tracking
• Integration with large-scale foundation models for EEG
• Cross-subject transfer learning on SPD manifold

Citation

@inproceedings{jin2026gbwatt,
  title={Towards Robust EEG Decoding Based on Riemannian Self-Attention},
  author={Jin, Shaocheng and Zhou, Tao and Wang, Rui and Chen, Ziheng and Luo, Xiaoqing and Wu, Xiaojun and Kittler, Josef},
  booktitle={Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining},
  year={2026},
  note={arXiv:2606.25456}
}

Usage Guidance

When applying this skill:

• Use BWM-based attention when dealing with ill-conditioned EEG covariance matrices
• Consider power-deformed version for tasks requiring adaptive geometry
• Validate on multiple EEG benchmarks before deployment
• Check for stationarity assumptions in your application domain