Modelling Discrete States and Long-Term Dynamics in Functional Brain Networks
Bibliographic record
Abstract
Functional brain network dynamics underlie fundamental aspects of human cognition and behaviour, including memory, ageing, and a range of clinical disorders. It has been shown that ongoing brain network dynamics can be reliably inferred at fast, sub-second timescales from electrophysiological data using unsupervised machine learning. However, these methods often struggle with inherent trade-offs. For example, Hidden Markov Models (HMMs) have been used to infer categorical brain network states that provide good interpretability but do not model long-range temporal structure. Recently, deep learning approaches using recurrent neural networks (e.g., Dynamic Network Modes) have been proposed to model long-range temporal dependencies, but at the expense of interpretability. In this paper, we introduce Dynamic Network States (DyNeStE) to address this problem. This new model employs amortised Bayesian inference with recurrent neural networks to model long-range temporal structure and uses a Gumbel-Softmax distribution to enforce categorical states for greater interpretability. In both simulations and real resting-state magnetoencephalography data, DyNeStE was able to recover plausible dynamic brain network states and showed superior performance over the HMM in capturing long-range temporal dependencies in network dynamics. These dynamic networks were reproducible across independent data splits and build on established HMM-based findings. Together, these results highlight DyNeStE as an interpretable and temporally informative framework, capable of representing large-scale neural activity as discrete state transitions while capturing transient and long-range brain network dynamics.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".