Mixture Models for Domain-Adaptive Brain Decoding
Bibliographic record
Abstract
Abstract A grand challenge in brain decoding is to develop algorithms that generalize across multiple subjects and tasks. Here, we developed a new computational framework to minimize negative transfer for domain-adaptive brain decoding by reframing source selection as a mixture model parameter estimation problem, allowing each source subject to contribute through a continuous mixture weight rather than being outright included or excluded. To compute these weights, we developed a novel convex optimization algorithm based on the Generalized Method of Moments. By using model performance metrics as the generalized moment functions in our GMM optimization, our algorithm also provides theoretical guarantees that the mixture weights are an optimal approximation of the importance weights that underlie domain adaptation theory. When tested on a large-scale brain decoding dataset (n=105 subjects), our new mixture model weighting framework achieved state-of-the-art performance—increasing accuracy up to 2.5% over baseline fine-tuning, double the performance gain compared to previous research in supervised source selection. Notably, these improvements were achieved using significantly less training data (i.e., 62% smaller effective sample sizes), suggesting that our performance gains stem from reduced negative transfer. Collectively, this research advances toward a more principled and generalizable brain decoding framework, laying the mathematical foundation for scalable brain-computer interfaces and other applications in computational neuroscience.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".