Reading the weights: a language model audits and repairs EEG decoders without data

EEG decoders can score well by exploiting signals other than the brain activity they claim to decode. Existing audits need data and forward passes. We ask whether a general-purpose language model, given only a trained decoder's weights and a description of its input, can say what the decoder relies on, predict how it behaves on another dataset, and repair it. Blind to data, the model identified the mechanism of eight real decoders (four EEGNets, a CBraMod and a LaBraM that read horizontal eye movements on PhysioNet, a mu-rhythm decoder, and a cue-evoked-potential decoder on BCI Competition IV 2a) and named 24 of 25 planted cues. Its verdicts predicted out-of-dataset behaviour: decoders it called eye-driven fell below chance on 52 unseen Cho2017 participants, the one it called mu-driven reached 59.7%. Editing weights directly with no training, it removed the eye shortcut from CBraMod (46.7% to 60.4% on Cho2017, 44 of 52 participants improved; an independent second agent reached 57.1%). On a sealed bench of eight cues designed by an independent model, with predictions hashed before scoring, a trivial weight statistic localised the planted signal as well as or better than the reader (20/21 vs 14/21); the reader's added value lay in naming the signal family (6/7) and a class rule. Ten publicly released decoders were audited the same way. Preprint v1, 3 November 2026. Code: https://github.com/YihengLi-1/eeg-motor-imagery-decoding

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-04
DOI
https://doi.org/10.5281/zenodo.23934403
Primary Topic
EEG and Brain-Computer Interfaces
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Reading the weights: a language model audits and repairs EEG decoders without data

Yiheng Li
Zenodo (CERN European Organization for Nuclear Research)
EEG and Brain-Computer Interfaces
preprint

Reading the weights: a language model audits and repairs EEG decoders without data

Yiheng Li
preprint en

Abstract

EEG decoders can score well by exploiting signals other than the brain activity they claim to decode. Existing audits need data and forward passes. We ask whether a general-purpose language model, given only a trained decoder's weights and a description of its input, can say what the decoder relies on, predict how it behaves on another dataset, and repair it. Blind to data, the model identified the mechanism of eight real decoders (four EEGNets, a CBraMod and a LaBraM that read horizontal eye movements on PhysioNet, a mu-rhythm decoder, and a cue-evoked-potential decoder on BCI Competition IV 2a) and named 24 of 25 planted cues. Its verdicts predicted out-of-dataset behaviour: decoders it called eye-driven fell below chance on 52 unseen Cho2017 participants, the one it called mu-driven reached 59.7%. Editing weights directly with no training, it removed the eye shortcut from CBraMod (46.7% to 60.4% on Cho2017, 44 of 52 participants improved; an independent second agent reached 57.1%). On a sealed bench of eight cues designed by an independent model, with predictions hashed before scoring, a trivial weight statistic localised the planted signal as well as or better than the reader (20/21 vs 14/21); the reader's added value lay in naming the signal family (6/7) and a class rule. Ten publicly released decoders were audited the same way. Preprint v1, 3 November 2026. Code: https://github.com/YihengLi-1/eeg-motor-imagery-decoding

Zenodo (CERN European Organization for Nuclear Research)
Arizona State University (US)
EEG and Brain-Computer Interfaces
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon