Benchmarking motor imagery algorithms for pediatric users of brain-computer interfaces
Bibliographic record
Abstract
Brain-computer interfaces (BCIs) can enable opportunities for self-expression and life participation for children with severe neurological disabilities. Unfortunately, the development and evaluation of state-of-the-art algorithms has largely neglected pediatric users. This work tests 12 state-of-the-art algorithms for motor imagery classification on three datasets of typically developing pediatric users (n=94 ages 5-17). When all datasets were combined, there were no significant differences between most non-deep learning algorithms, with all having a mean AUC score of 0.64 or 0.65. All the non-deep learning algorithms significantly outperformed the deep learning algorithms, which can be partially attributed to a lack of hyperparameter tuning. The best of the deep learning algorithms was ShallowConvNet, with a mean AUC score of 0.57. Of the algorithms tested, only the filter bank common spatial pattern (FBCSP) and ShallowConvNet exhibited significant age effects. This general lack of age effects, combined with examples of children as young as 6 having AUC scores as high as 0.8, provides evidence that young children are capable of producing measurable motor imagery activations. The age effects that were present for some algorithms suggest that the changing EEG patterns associated with development could have a measurable impact on classification algorithm outcomes, and such algorithms should be evaluated to ensure that they are not performing disproportionately poorly for younger children. This work serves as a first step towards ensuring that the state-of-the-art improvements in BCI classification can be evaluated, and where necessary, adapted to meet the needs of pediatric users.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".