mlsanityData to 7 Oct 2026

Deep Riemannian Networks for End-to-End EEG Decoding

arXiv 2212.10426 ↗First posted 20 Dec 2022cs.LG eess.SP stat.MLcited by 11

Not on the map. Why?

Abstract (arXiv)

State-of-the-art performance in electroencephalography (EEG) decoding tasks is currently often achieved with either Deep-Learning (DL) or Riemannian-Geometry-based decoders (RBDs). Recently, there is growing interest in Deep Riemannian Networks (DRNs) possibly combining the advantages of both previous classes of methods. However, there are still a range of topics where additional insight is needed to pave the way for a more widespread application of DRNs in EEG. These include architecture design questions such as network size and end-to-end ability. How these factors affect model performance has not been explored. Additionally, it is not clear how the data within these networks is transformed, and whether this would correlate with traditional EEG decoding. Our study aims to lay the groundwork in the area of these topics through the analysis of DRNs for EEG with a wide range of hyperparameters. Networks were tested on five public EEG datasets and compared with state-of-the-art ConvNets. Here we propose EE(G)-SPDNet, and we show that this wide, end-to-end DRN can outperform the ConvNets, and in doing so use physiologically plausible frequency regions. We also show that the end-to-end approach learns more complex filters than traditional band-pass filters targeting the classical alpha, beta, and gamma frequency bands of the EEG, and that performance can benefit from channel specific filtering approaches. Additionally, architectural analysis revealed areas for further improvement due to the possible under utilisation of Riemannian specific information throughout the network. Our study thus shows how to design and train DRNs to infer task-related information from the raw EEG without the need of handcrafted filterbanks and highlights the potential of end-to-end DRNs such as EE(G)-SPDNet for high-performance EEG decoding.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 17 of its 59 references that are in the map. First posted on arXiv 20 Dec 2022.

Builds on

17 of 59 references.

References · 17

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  2. 2018A Tutorial on Bayesian Optimizationcited by 734
  3. 2016EEGNet: A Compact Convolutional Network for EEG-based Brain-Computer Interfacescited by 616
  4. 2018Riemannian Adaptive Optimization Methodscited by 187
  5. 2016A Riemannian Network for SPD Matrix Learningcited by 162
  6. 2020Geoopt: Riemannian Optimization in PyTorchcited by 109
  7. 2018MOABB: Trustworthy algorithm benchmarking for BCIscited by 80
  8. 2019Riemannian batch normalization for SPD neural networkscited by 72
  9. 2021FBCNet: A Multi-view Convolutional Neural Network for Brain-Computer Interfacecited by 54
  10. 2022SPD domain-specific batch normalization to crack interpretable unsupervised domain adaptation in EEGcited by 53
  11. 2018Covariance Pooling For Facial Expression Recognitioncited by 37
  12. 2022Tensor-CSPNet: A Novel Geometric Deep Learning Framework for Motor Imagery Classificationcited by 21
5 more
  1. 2018Interpretable Convolutional Filters with SincNetcited by 20
  2. 2020ManifoldNorm: Extending normalizations on Riemannian Manifoldscited by 8
  3. 2017Second-order Convolutional Neural Networkscited by 7
  4. 2020Neural Architecture Search of SPD Manifold Networkscited by 6
  5. 2018ManifoldNet: A Deep Network Framework for Manifold-valued Datacited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 1; 2026: 6.

11 papers.