Ricardo Pio Monti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ricardo Pio Monti has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Christoforos Anagnostopoulos
Department of Mathematics, Imperial College London, London SW7 2AZ, UK
9 shared publications - Robert Leech
King’s College London, London, United Kingdom
9 shared publications - Romy Lorenz
Max Planck Institute for Biological Cybernetics
8 shared publications Giovanni Montana
Warwick Manufacturing Group University of Wawrick Coventry UK
7 shared publications- Ines Ribeiro Violante
School of Biomedical Engineering and Imaging Sciences, King's College London, London, UK
3 shared publications - Peter John Hellyer
Centre for Neuroimaging Sciences, Institute of Psychiatry, Psychology C Neuroscience (IoPPN), King’s College London, London, UK
3 shared publications
Latest Publications
- Open Access
Neuroimaging: into the Multiverse
A bstract: For most neuroimaging questions the huge range of possible analytic choices leads to the possibility that conclusions from any single analytic approach may be misleading. Examples of possible choices include the motion regression approach used and smoothing and threshold factors applied during the processing pipeline. Although it is possible to perform a multiverse analysis that evaluates all possible analytic choices, this can be computationally challenging and repeated sequential analyses on the same data can compromise inferential and predictive power. Here, we establish how active learning on a low-dimensional space that captures the inter-relationships between analysis approaches can be used to efficiently approximate the whole multiverse of analyses. This approach balances the benefits of a multiverse analysis without the accompanying cost to statistical power, computational power and the integrity of inferences. We illustrate this approach with a functional MRI dataset of functional connectivity across adolescence, demonstrating how a multiverse of graph theoretic and simple pre-processing steps can be efficiently navigated using active learning. Our study shows how this approach can identify the subset of analysis techniques (i.e., pipelines) which are best able to predict participants’ ages, as well as allowing the performance of different approaches to be quantified.
Open AccessNeuroimaging: into the Multiverse
A bstract: For most neuroimaging questions the huge range of possible analytic choices leads to the possibility that conclusions from any single analytic approach may be misleading. Examples of possible choices include the motion regression approach used and smoothing and threshold factors applied during the processing pipeline. Although it is possible to perform a multiverse analysis that evaluates all possible analytic choices, this can be computationally challenging and repeated sequential analyses on the same data can compromise inferential and predictive power. Here, we establish how active learning on a low-dimensional space that captures the inter-relationships between analysis approaches can be used to efficiently approximate the whole multiverse of analyses. This approach balances the benefits of a multiverse analysis without the accompanying cost to statistical power, computational power and the integrity of inferences. We illustrate this approach with a functional MRI dataset of functional connectivity across adolescence, demonstrating how a multiverse of graph theoretic and simple pre-processing steps can be efficiently navigated using active learning. Our study shows how this approach can identify the subset of analysis techniques (i.e., pipelines) which are best able to predict participants’ ages, as well as allowing the performance of different approaches to be quantified.
- Open Access
- 10 June 2020
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (6) , e0232296
Interpretable brain age prediction using linear latent variable models of functional connectivity
Neuroimaging-driven prediction of brain age, defined as the predicted biological age of a subject using only brain imaging data, is an exciting avenue of research. In this work we seek to build models of brain age based on functional connectivity while prioritizing model interpretability and understanding. This way, the models serve to both provide accurate estimates of brain age as well as allow us to investigate changes in functional connectivity which occur during the ageing process. The methods proposed in this work consist of a two-step procedure: first, linear latent variable models, such as PCA and its extensions, are employed to learn reproducible functional connectivity networks present across a cohort of subjects. The activity within each network is subsequently employed as a feature in a linear regression model to predict brain age. The proposed framework is employed on the data from the CamCAN repository and the inferred brain age models are further demonstrated to generalize using data from two open-access repositories: the Human Connectome Project and the ATR Wide-Age-Range.
- 10 June 2020
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 15 (6) , e0232296
Open AccessInterpretable brain age prediction using linear latent variable models of functional connectivity
Neuroimaging-driven prediction of brain age, defined as the predicted biological age of a subject using only brain imaging data, is an exciting avenue of research. In this work we seek to build models of brain age based on functional connectivity while prioritizing model interpretability and understanding. This way, the models serve to both provide accurate estimates of brain age as well as allow us to investigate changes in functional connectivity which occur during the ageing process. The methods proposed in this work consist of a two-step procedure: first, linear latent variable models, such as PCA and its extensions, are employed to learn reproducible functional connectivity networks present across a cohort of subjects. The activity within each network is subsequently employed as a feature in a linear regression model to predict brain age. The proposed framework is employed on the data from the CamCAN repository and the inferred brain age models are further demonstrated to generalize using data from two open-access repositories: the Human Connectome Project and the ATR Wide-Age-Range.
- 27 September 2018
- Published by Springer Nature
- p. 447-456
Avoiding Degradation in Deep Feed-Forward Networks by Phasing Out Skip-Connections
- 27 September 2018
- Published by Springer Nature
- p. 447-456
Avoiding Degradation in Deep Feed-Forward Networks by Phasing Out Skip-Connections
- 16 July 2018
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 11 (5) , 237-247
Adaptive regularization for Lasso models in the context of nonstationary data streams
Large‐scale, streaming data sets are ubiquitous in modern machine learning. Streaming algorithms must be scalable, amenable to incremental training, and robust to the presence of nonstationarity. In this work we consider the problem of learningℓ1regularized linear models in the context of streaming data. In particular, the focus of this work revolves around how to select the regularization parameter when data arrives sequentially and the underlying distribution is nonstationary (implying the choice of optimal regularization parameter is itself time‐varying). We propose a framework through which to infer an adaptive regularization parameter. Our approach employs anℓ1penalty constraint where the corresponding sparsity parameter is iteratively updated via stochastic gradient descent. This serves to reformulate the choice of regularization parameter in a principled framework for online learning. The proposed method is derived for linear regression and subsequently extended to generalized linear models. We validate our approach using simulated and real data sets, concluding with an application to a neuroimaging data set.
- 16 July 2018
- Published by Wiley in Statistical Analysis and Data Mining: An ASA Data Science Journal
- Vol. 11 (5) , 237-247
Adaptive regularization for Lasso models in the context of nonstationary data streams
Large‐scale, streaming data sets are ubiquitous in modern machine learning. Streaming algorithms must be scalable, amenable to incremental training, and robust to the presence of nonstationarity. In this work we consider the problem of learningℓ1regularized linear models in the context of streaming data. In particular, the focus of this work revolves around how to select the regularization parameter when data arrives sequentially and the underlying distribution is nonstationary (implying the choice of optimal regularization parameter is itself time‐varying). We propose a framework through which to infer an adaptive regularization parameter. Our approach employs anℓ1penalty constraint where the corresponding sparsity parameter is iteratively updated via stochastic gradient descent. This serves to reformulate the choice of regularization parameter in a principled framework for online learning. The proposed method is derived for linear regression and subsequently extended to generalized linear models. We validate our approach using simulated and real data sets, concluding with an application to a neuroimaging data set.
- 1 December 2017
- Published by Institute of Mathematical Statistics in The Annals of Applied Statistics
- Vol. 11 (4) , 2142-2164
Learning population and subject-specific brain connectivity networks via mixed neighborhood selection
In neuroimaging data analysis, Gaussian graphical models are often used to model statistical dependencies across spatially remote brain regions known as functional connectivity. Typically, data is collected across a cohort of subjects and the scientific objectives consist of estimating population and subject-specific connectivity networks. A third objective that is often overlooked involves quantifying inter-subject variability, and thus identifying regions or subnetworks that demonstrate heterogeneity across subjects. Such information is crucial to thoroughly understand the human connectome. We propose Mixed Neighborhood Selection to simultaneously address the three aforementioned objectives. By recasting covariance selection as a neighborhood selection problem, we are able to efficiently learn the topology of each node. We introduce an additional mixed effect component to neighborhood selection to simultaneously estimate a graphical model for the population of subjects as well as for each individual subject. The proposed method is validated empirically through a series of simulations and applied to resting state data for healthy subjects taken from the ABIDE consortium.
- 1 December 2017
- Published by Institute of Mathematical Statistics in The Annals of Applied Statistics
- Vol. 11 (4) , 2142-2164
Learning population and subject-specific brain connectivity networks via mixed neighborhood selection
In neuroimaging data analysis, Gaussian graphical models are often used to model statistical dependencies across spatially remote brain regions known as functional connectivity. Typically, data is collected across a cohort of subjects and the scientific objectives consist of estimating population and subject-specific connectivity networks. A third objective that is often overlooked involves quantifying inter-subject variability, and thus identifying regions or subnetworks that demonstrate heterogeneity across subjects. Such information is crucial to thoroughly understand the human connectome. We propose Mixed Neighborhood Selection to simultaneously address the three aforementioned objectives. By recasting covariance selection as a neighborhood selection problem, we are able to efficiently learn the topology of each node. We introduce an additional mixed effect component to neighborhood selection to simultaneously estimate a graphical model for the population of subjects as well as for each individual subject. The proposed method is validated empirically through a series of simulations and applied to resting state data for healthy subjects taken from the ABIDE consortium.
- Open Access
Assessing tACS-induced phosphene perception using closed-loop Bayesian optimization
Transcranial alternating current stimulation (tACS) can evoke illusory flash-like visual percepts known as phosphenes . The perception of phosphenes represents a major experimental challenge when studying tACS-induced effects on cognitive performance. Besides growing concerns that retinal phosphenes themselves could potentially have neuromodulatory effects, the perception of phosphenes may also modify the alertness of participants. Past research has shown that stimulation intensity, frequency and electrode montage affect phosphene perception. However, to date, the effect of an additional tACS parameter on phosphene perception has been completely overlooked: the relative phase difference between stimulation electrodes. This is a crucial and timely topic given the confounding nature of phosphene perception and the increasing number of studies reporting changes in cognitive function following tACS phase manipulations. However, studying phosphene perception for different frequencies and phases simultaneously is not tractable using standard approaches, as the physiologically plausible range of parameters results in a combinatorial explosion of experimental conditions, yielding impracticable experiment durations. To overcome this limitation, here we applied a Bayesian optimization approach to efficiently sample an exhaustive tACS parameter space. Moreover, unlike conventional methodology, which involves subjects judging the perceived phosphene intensity on a rating scale, our study leveraged the strength of human perception by having the optimization driven based on a subject’s relative judgement. Applying Bayesian optimization for two different montages, we found that phosphene perception was affected by differences in the relative phase between cortical electrodes. The results were replicated in a second study involving new participants and validated using computational modelling. In summary, our results have important implications for the experimental design and conclusions drawn from future tACS studies investigating the effects of phase on cognition.
Open AccessAssessing tACS-induced phosphene perception using closed-loop Bayesian optimization
Transcranial alternating current stimulation (tACS) can evoke illusory flash-like visual percepts known as phosphenes . The perception of phosphenes represents a major experimental challenge when studying tACS-induced effects on cognitive performance. Besides growing concerns that retinal phosphenes themselves could potentially have neuromodulatory effects, the perception of phosphenes may also modify the alertness of participants. Past research has shown that stimulation intensity, frequency and electrode montage affect phosphene perception. However, to date, the effect of an additional tACS parameter on phosphene perception has been completely overlooked: the relative phase difference between stimulation electrodes. This is a crucial and timely topic given the confounding nature of phosphene perception and the increasing number of studies reporting changes in cognitive function following tACS phase manipulations. However, studying phosphene perception for different frequencies and phases simultaneously is not tractable using standard approaches, as the physiologically plausible range of parameters results in a combinatorial explosion of experimental conditions, yielding impracticable experiment durations. To overcome this limitation, here we applied a Bayesian optimization approach to efficiently sample an exhaustive tACS parameter space. Moreover, unlike conventional methodology, which involves subjects judging the perceived phosphene intensity on a rating scale, our study leveraged the strength of human perception by having the optimization driven based on a subject’s relative judgement. Applying Bayesian optimization for two different montages, we found that phosphene perception was affected by differences in the relative phase between cortical electrodes. The results were replicated in a second study involving new participants and validated using computational modelling. In summary, our results have important implications for the experimental design and conclusions drawn from future tACS studies investigating the effects of phase on cognition.
- Open Access
- 20 March 2017
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 11, 14
Decoding Time-Varying Functional Connectivity Networks via Linear Graph Embedding Methods
An exciting avenue of neuroscientific research involves quantifying the time-varying properties of functional connectivity networks. As a result, many methods have been proposed to estimate the dynamic properties of such networks. However, one of the challenges associated with such methods involves the interpretation and visualization of high-dimensional, dynamic networks. In this work, we employ graph embedding algorithms to provide low-dimensional vector representations of networks, thus facilitating traditional objectives such as visualization, interpretation and classification. We focus on linear graph embedding methods based on principal component analysis and regularized linear discriminant analysis. The proposed graph embedding methods are validated through a series of simulations and applied to fMRI data from the Human Connectome Project.
- 20 March 2017
- Published by Frontiers Media SA in Frontiers in Computational Neuroscience
- Vol. 11, 14
Open AccessDecoding Time-Varying Functional Connectivity Networks via Linear Graph Embedding Methods
An exciting avenue of neuroscientific research involves quantifying the time-varying properties of functional connectivity networks. As a result, many methods have been proposed to estimate the dynamic properties of such networks. However, one of the challenges associated with such methods involves the interpretation and visualization of high-dimensional, dynamic networks. In this work, we employ graph embedding algorithms to provide low-dimensional vector representations of networks, thus facilitating traditional objectives such as visualization, interpretation and classification. We focus on linear graph embedding methods based on principal component analysis and regularized linear discriminant analysis. The proposed graph embedding methods are validated through a series of simulations and applied to fMRI data from the Human Connectome Project.
- Open Access
- 7 September 2016
- Published by Wiley in Human Brain Mapping
- Vol. 38 (1) , 202-220
Real‐time estimation of dynamic functional connectivity networks
Two novel and exciting avenues of neuroscientific research involve the study of task‐driven dynamic reconfigurations of functional connectivity networks and the study of functional connectivity in real‐time. While the former is a well‐established field within neuroscience and has received considerable attention in recent years, the latter remains in its infancy. To date, the vast majority of real‐time fMRI studies have focused on a single brain region at a time. This is due in part to the many challenges faced when estimating dynamic functional connectivity networks in real‐time. In this work, we propose a novel methodology with which to accurately track changes in time‐varying functional connectivity networks in real‐time. The proposed method is shown to perform competitively when compared to state‐of‐the‐art offline algorithms using both synthetic as well as real‐time fMRI data. The proposed method is applied to motor task data from the Human Connectome Project as well as to data obtained from a visuospatial attention task. We demonstrate that the algorithm is able to accurately estimate task‐related changes in network structure in real‐time.Hum Brain Mapp 38:202–220, 2017. ©2016 Wiley Periodicals, Inc.
- 7 September 2016
- Published by Wiley in Human Brain Mapping
- Vol. 38 (1) , 202-220
Open AccessReal‐time estimation of dynamic functional connectivity networks
Two novel and exciting avenues of neuroscientific research involve the study of task‐driven dynamic reconfigurations of functional connectivity networks and the study of functional connectivity in real‐time. While the former is a well‐established field within neuroscience and has received considerable attention in recent years, the latter remains in its infancy. To date, the vast majority of real‐time fMRI studies have focused on a single brain region at a time. This is due in part to the many challenges faced when estimating dynamic functional connectivity networks in real‐time. In this work, we propose a novel methodology with which to accurately track changes in time‐varying functional connectivity networks in real‐time. The proposed method is shown to perform competitively when compared to state‐of‐the‐art offline algorithms using both synthetic as well as real‐time fMRI data. The proposed method is applied to motor task data from the Human Connectome Project as well as to data obtained from a visuospatial attention task. We demonstrate that the algorithm is able to accurately estimate task‐related changes in network structure in real‐time.Hum Brain Mapp 38:202–220, 2017. ©2016 Wiley Periodicals, Inc.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Classifying HCP task-fMRI networks using heat kernels
Network theory provides a principled abstraction of the human brain: reducing a complex system into a simpler representation from which to investigate brain organisation. Recent advancement in the neuroimaging field are towards representing brain connectivity as a dynamic process in order to gain a deeper understanding of the interplay between functional modules for efficient information transport. In this work, we employ heat kernels to model the process of energy diffusion in functional networks. We extract node-based, multi-scale features which describe the propagation of heat over 'time' which not only inform the importance of a node in the graph, but also incorporate local and global information of the underlying geometry of the network. As a proof-of-concept, we test the efficacy of two heat kernel features for discriminating between motor and working memory functional networks from the Human Connectome Project. For comparison, we also classified task networks using traditional network metrics which similarly provide rankings of node importance. In addition, a variant of the Smooth Incremental Graphical Lasso Estimation algorithm was used to estimate non-sparse, precision matrices to account for non-stationarity in the time series. We illustrate differences in heat kernel features between tasks, and also between regions of the brain. Using a random forest classifier, we showed heat kernel metrics to capture intrinsic properties of functional networks that serve well as features for task classification.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Classifying HCP task-fMRI networks using heat kernels
Network theory provides a principled abstraction of the human brain: reducing a complex system into a simpler representation from which to investigate brain organisation. Recent advancement in the neuroimaging field are towards representing brain connectivity as a dynamic process in order to gain a deeper understanding of the interplay between functional modules for efficient information transport. In this work, we employ heat kernels to model the process of energy diffusion in functional networks. We extract node-based, multi-scale features which describe the propagation of heat over 'time' which not only inform the importance of a node in the graph, but also incorporate local and global information of the underlying geometry of the network. As a proof-of-concept, we test the efficacy of two heat kernel features for discriminating between motor and working memory functional networks from the Human Connectome Project. For comparison, we also classified task networks using traditional network metrics which similarly provide rankings of node importance. In addition, a variant of the Smooth Incremental Graphical Lasso Estimation algorithm was used to estimate non-sparse, precision matrices to account for non-stationarity in the time series. We illustrate differences in heat kernel features between tasks, and also between regions of the brain. Using a random forest classifier, we showed heat kernel metrics to capture intrinsic properties of functional networks that serve well as features for task classification.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Text-mining the neurosynth corpus using deep boltzmann machines
Large-scale automated meta-analysis of neuroimaging data has recently established itself as an important tool in advancing our understanding of human brain function. This research has been pioneered by NeuroSynth, a database collecting both brain activation coordinates and associated text across a large cohort of neuroimaging research papers. One of the fundamental aspects of such meta-analysis is text-mining. To date, word counts and more sophisticated methods such as Latent Dirichlet Allocation have been proposed. In this work we present an unsupervised study of the NeuroSynth text corpus using Deep Boltzmann Machines (DBMs). The use of DBMs yields several advantages over the aforementioned methods, principal among which is the fact that it yields both word and document embeddings in a high-dimensional vector space. Such embeddings serve to facilitate the use of traditional machine learning techniques on the text corpus. The proposed DBM model is shown to learn embeddings with a clear semantic structure.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Text-mining the neurosynth corpus using deep boltzmann machines
Large-scale automated meta-analysis of neuroimaging data has recently established itself as an important tool in advancing our understanding of human brain function. This research has been pioneered by NeuroSynth, a database collecting both brain activation coordinates and associated text across a large cohort of neuroimaging research papers. One of the fundamental aspects of such meta-analysis is text-mining. To date, word counts and more sophisticated methods such as Latent Dirichlet Allocation have been proposed. In this work we present an unsupervised study of the NeuroSynth text corpus using Deep Boltzmann Machines (DBMs). The use of DBMs yields several advantages over the aforementioned methods, principal among which is the fact that it yields both word and document embeddings in a high-dimensional vector space. Such embeddings serve to facilitate the use of traditional machine learning techniques on the text corpus. The proposed DBM model is shown to learn embeddings with a clear semantic structure.