Search bioRxiv⌕ Search

Biology subjects

Adaszewski, S.

Publications and source records attributed to Adaszewski, S..

3 recordsLinked to original sources

Bi-cross-validation: a data-driven method to evaluate dynamic functional connectivity models in fMRI

Dynamic functional connectivity (dFC) models have become increasingly popular over the past decade for characterising time-varying interactions between brain regions. However, assessing and comparing dFC models remains challenging. Here, we introduce bi-cross-validation as a general framework for evaluating dFC models and selecting key hyperparameters, such as the number of states. By jointly partitioning the data across subjects and brain regions, bi-cross-validation enables out-of-sample evaluation without re-estimating latent states on the same data used for testing, thereby avoiding circularity. Using simulated data with known ground-truth dynamics, we show that bi-cross-validation favours models that accurately capture the underlying state structure. Applying the framework to real resting-state fMRI data, we demonstrate that bi-cross-validation naturally balances goodness-of-fit against model complexity, with performance improving and then declining as model complexity increases. Finally, we use bi-cross-validation to directly compare static and dynamic FC models, showing that dynamic models underperform static models at low spatial dimensionality, but outperform static models at sufficiently high dimensionality. Together, these results establish bi-cross-validation as a principled tool for dFC model selection, evaluation, and comparison.

neuroscience↗

Mixtures of large-scale dynamic functional brain network modes

Accurate temporal modelling of functional brain networks is essential in the quest for understanding how such networks facilitate cognition. Researchers are beginning to adopt time-varying analyses for electrophysiological data that capture highly dynamic processes on the order of milliseconds. Typically, these approaches, such as clustering of functional connectivity profiles and Hidden Markov Modelling (HMM), assume mutual exclusivity of networks over time. Whilst a powerful constraint, this assumption may be compromising the ability of these approaches to describe the data effectively. Here, we propose a new generative model for functional connectivity as a time-varying linear mixture of spatially distributed statistical "modes". The temporal evolution of this mixture is governed by a recurrent neural network, which enables the model to generate data with a rich temporal structure. We use a Bayesian framework known as amortised variational inference to learn model parameters from observed data. We call the approach DyNeMo (for Dynamic Network Modes), and show using simulations it outperforms the HMM when the assumption of mutual exclusivity is violated. In resting-state MEG, DyNeMo reveals a mixture of modes that activate on fast time scales of 100-150 ms, which is similar to state lifetimes found using an HMM. In task MEG data, DyNeMo finds modes with plausible, task-dependent evoked responses without any knowledge of the task timings. Overall, DyNeMo provides decompositions that are an approximate remapping of the HMMs while showing improvements in overall explanatory power. However, the magnitude of the improvements suggests that the HMMs assumption of mutual exclusivity can be reasonable in practice. Nonetheless, DyNeMo provides a flexible framework for implementing and assessing future modelling developments.

neuroscience↗

Convex Optimized Population Receptive Field (CO-pRF) Mapping

Population receptive field (pRF) mapping represents an invaluable non-invasive tool for the study of sensory organization and plasticity within the human brain. Despite the very appealing result that fMRI derived pRF measures agree well with measurements made from other fields of neuroscience, current techniques often require very computationally expensive non-linear optimization procedures to fit the models to the data which are also vulnerable to bias due local minima issues. In this work we present a general framework for pRF model estimation termed Convex Optimized Population Receptive Field (CO-pRF) mapping and show how the pRF fitting problem can be linearized in order to be solved by extremely fast and efficient algorithms. The framework is general and can be readily applied to a variety of pRF models and measurement schemes. We provide an example of the CO-pRF methodology as applied to a computational neuroimaging approach used to map sensory processes in human visual cortex - the CSS-pRF model. Via simulation and in-vivo fMRI results we demonstrate that the CO-pRF approach achieves robust model fitting even in the presence of noise or reduced data, providing parameter estimates closer to the global optimum across 93% of in-vivo responses as compared to a typical nonlinear optimization procedure. Furthermore the example CO-pRF application substantially reduced model fitting times by a factor of 50. We hope that the availability of such highly accelerated and reliable pRF estimation algorithms will facilitate the spread of pRF techniques to larger imaging cohorts and the future study of neurological disorders and plasticity within the human brain.

neuroscience↗