Scaling Laws for EEG Decoding: How Much Data Is Enough?
Abstract
Deep learning has become a cornerstone of EEG-based brain decoding, with a growing number of architectures proposed every day. However, how the performance of these different models scales with data volume is not clear. Although this relationship has been characterized in other fields under the name of scaling laws, it remains poorly understood in the EEG domain. The present study addresses this gap by investigating how scan time and subject diversity affect the performance of different architectures. We evaluated five models across four EEG datasets. Training data volume was controlled by varying both subject count and trial volume under cross-subject validation. We then fitted power-law relationships to characterize the resulting behavior. Our findings reveal that as total data volume increases, the distinction between trial and subject scaling becomes largely irrelevant. Furthermore, we show that power-law relationships are both model and dataset-specific, yet they provide a robust descriptive framework for EEG decoding performance. Extrapolation to larger subject pools yields RMSE values below 0.1 in most cases. Our work contributes to the literature by providing a descriptive framework for data scaling in EEG and by demonstrating data-efficient experimental design in EEG research.
Related
- Taylor's Law, Smith's Law, and Diversity Power Laws: A Novel Triple Power Law Methodology for Scaling Diversity and Heterogeneity
- Scaling recipes for single-cell RNA sequencing foundation models: when do scaling laws hold?
- Scaling laws link conserved gene-abundance distributions to adaptive expression in diatom communities worldwide
- Scaling subjects in cross-modal alignment: video decoding with EEG foundation model
- Assessing innovation in gerontology: promote disruption, leave well enough alone, or unclear?
BibTeX
@misc{oliveira2026scaling,
title = {{Scaling Laws for EEG Decoding: How Much Data Is Enough?}},
author = {José Maurício Nunes de Oliveira and Bruna J. Lopes and Léo Burgund and Raphael Y. Camargo and Bruno Aristimunha},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.35056},
eprint = {2609.35056},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.35056},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Scaling Laws for EEG Decoding: How Much Data Is Enough?
AU - José Maurício Nunes de Oliveira
AU - Bruna J. Lopes
AU - Léo Burgund
AU - Raphael Y. Camargo
AU - Bruno Aristimunha
PY - 2026
DA - 2026/09/28
PB - arXiv
DO - 10.48550/arxiv.2609.35056
UR - https://arxiv.org/abs/2609.35056
AB - Deep learning has become a cornerstone of EEG-based brain decoding, with a growing number of architectures proposed every day. However, how the performance of these different models scales with data volume is not clear. Although this relationship has been characterized in other fields under the name of scaling laws, it remains poorly understood in the EEG domain. The present study addresses this gap by investigating how scan time and subject diversity affect the performance of different architectures. We evaluated five models across four EEG datasets. Training data volume was controlled by varying both subject count and trial volume under cross-subject validation. We then fitted power-law relationships to characterize the resulting behavior. Our findings reveal that as total data volume increases, the distinction between trial and subject scaling becomes largely irrelevant. Furthermore, we show that power-law relationships are both model and dataset-specific, yet they provide a robust descriptive framework for EEG decoding performance. Extrapolation to larger subject pools yields RMSE values below 0.1 in most cases. Our work contributes to the literature by providing a descriptive framework for data scaling in EEG and by demonstrating data-efficient experimental design in EEG research.
ER -