Accelerated learning of a noninvasive human brain-computer interface via manifold geometry
Bibliographic record
Abstract
Brain-computer interfaces (BCIs) promise to restore and enhance a wide range of human capabilities. However, a barrier to the adoption of BCIs is how long it can take users to learn to control them. We hypothesized that human BCI learning could be accelerated by leveraging the naturally occurring geometric structure of brain activity, or its intrinsic manifold, extracted using a data-diffusion process. We trained participants on a noninvasive BCI that allowed them to gain real-time control of an avatar in a virtual reality game by modulating functional magnetic resonance imaging (fMRI) activity in brain regions that support spatial navigation. We then perturbed the mapping between fMRI activity patterns and the movement of the avatar to test our manifold hypothesis. When the new mapping respected the intrinsic manifold, participants succeeded in regaining control of the BCI by aligning their brain activity within the manifold. When the new mapping did not respect the intrinsic manifold, participants could not learn to control the avatar again. These findings show that the manifold geometry of brain activity constrains human learning of a complex cognitive task in higher-order brain regions. Manifold geometry may be a critical ingredient for unlocking the potential of future human neurotechnologies.
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.000 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".