Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 14
Encontrada(s) 1 página(s)

Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Extracting orthogonal subject- and condition-specific signatures from fMRI data using whole-brain effective connectivity

  • Pallarés, Vicente
  • Insabato, Andrea
  • Sanjuán, Ana
  • Kühn, Simone
  • Mantini, Dante
  • Deco, Gustavo
  • Gilson, Matthieu
The study of brain communication based on fMRI data is often limited because such measurements are a mixture of session-to-session variability with subject- and condition-related information. Disentangling these contributions is crucial for real-life applications, in particular when only a few recording sessions are available. The present study aims to define a reliable standard for the extraction of multiple signatures from fMRI data, while verifying that they do not mix information about the different modalities (e.g., subjects and conditions such as tasks performed by them). In particular, condition-specific signatures should not be contaminated by subjectrelated information, since they aim to generalize over subjects. Practically, signatures correspond to subnetworks of directed interactions between brain regions (typically 100 covering the whole brain) supporting the subject and condition identification for single fMRI sessions. The key for robust prediction is using effective connectivity instead of functional connectivity. Our method demonstrates excellent generalization capabilities for subject identification in two datasets, using only a few sessions per subject as reference. Using another dataset with resting state and movie viewing, we show that the two signatures related to subjects and tasks correspond to distinct subnetworks, which are thus topologically orthogonal. Our results set solid foundations for applications tailored to individual subjects, such as clinical diagnostic., This work was supported by the European Union's Horizon 2020 research and innovation programme/Human Brain Project (grant FP7-FET-ICT-604102 to MG and GD; H2020-720270 HBP SGA1 to GD) and the Marie Sklodowska-Curie Action (grant H2020-MSCA-656547 to MG). A.I. is supported by the Spanish Ministry of Economy and Competitiveness Flag-ERA APCIN project CHAMPMouse (PCIN-2015-127). GD also acknowledges funding from the ERC Advanced Grant DYSTRUCTURE (#295129), the Spanish Research Project PSI2016-75688-P and the Catalan Research Group Support 2017 SGR 1545. DM was supported by the KU Leuven Special Research Fund (grant C16/15/070). SK has been funded by a Heisenberg grant from the German Science Foundation (DFG KU 3322/1-1), the European Union (ERC-2016-StG-Self-Control-677804) and a Fellowship from the Jacobs Foundation (JRF 2016-2018). This work has in part been funded by the German Science Foundation (SFB 936/C7).
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Effective connectivity in depression

  • Rolls, Edmund T
  • Cheng, Wei
  • Gilson, Matthieu
  • Qiu, Jiang
  • Hu, Zicheng
  • Ruan, Hongtao
  • Li, Yu
  • Huang, Chu-Chung
  • Yang, Albert C
  • Tsai, Shih-Jen
  • Zhang, Xiaodong
  • Zhuang, Kaixiang
  • Lin, Ching-Po
  • Deco, Gustavo
  • Xie, Peng
  • Feng, Jianfeng
Background: Resting-state functional connectivity reflects correlations in the activity between brain areas, whereas effective connectivity between different brain areas measures directed influences of brain regions on each other. Using the latter approach, we compare effective connectivity results in patients with major depressive disorder (MDD) and control subjects. Methods: We used a new approach to the measurement of effective connectivity, in which each brain area has a simple dynamical model, and known anatomical connectivity is used to provide constraints. This helps the approach to measure the effective connectivity between the 94 brain areas parceled in the automated anatomical labeling (AAL2) atlas, using resting-state functional magnetic resonance imaging. Moreover, we show how the approach can be used to measure the differences in effective connectivity between different groups of individuals, using as an example effective connectivity in the healthy brain and in individuals with depression. The first brainwide resting-state effective-connectivity neuroimaging analysis of depression, with 350 healthy individuals and 336 patients with major depressive disorder, is described. Results: Key findings are that the medial orbitofrontal cortex, implicated in reward and subjective pleasure, has reduced effective connectivity from temporal lobe input areas in depression; that the lateral orbitofrontal cortex, implicated in nonreward, has increased activity (variance) in depression, with decreased effective connectivity to and from cortical areas contralateral to language-related areas; and that the hippocampus, implicated in memory, has increased activity (variance) in depression and increased effective connectivity from the temporal pole. Conclusions: Measurements of effective connectivity made using the new method provide a new approach to causal mechanisms in the brain in depression., JF is a Royal Society Wolfson Research Merit Award holder. JF is also partially supported by the National High Technology Research and Development Program of China (Grant No. 2015AA020507) and the key project of Shanghai Science & Technology Innovation Plan (Grant No. 15JC1400101). The research was partially supported by the National Centre for Mathematics and Interdisciplinary Sciences (NCMIS) of the Chinese Academy of Sciences, Key Program of National Natural Science Foundation of China (Grant No. 91230201), and the Shanghai Soft Science Research Program (Grant No. 15692106604). WC is supported by grants from the National Natural Sciences Foundation of China (Grant No. 81701773, 11771010, 11471081, 11101429, and 71661167002), sponsored by Shanghai Sailing Program (Grant No. 17YF1426200) and the Research Fund for the Doctoral Program of Higher Education of China (Grant No. 2017M610226). C-PL was supported in part by funding from Ministry of Science and Technology, Taiwan (Grant Nos. NSC100–2911-I-010–010, NSC101–2911-I-010–009, NSC100–2628-E−010–002-MY3, NSC102–2321-B-010–023, and NSC103–2911-I-010–501), National Health Research Institutes (Grant Nos. NHRI-EX103–10310EI and NHRI-EX106-10611EI), Ministry of Health and Welfare of Taiwan (Grant No. DOH102-TD-PB-111-NSC006), and Academia Sinica, Taipei, Taiwan. JQ was supported by the National Natural Science Foundation of China (Grant Nos. 31271087, 31470981, 31571137, 31500885), National Outstanding Young People Plan, the Program for the Top Young Talents by Chongqing, the Fundamental Research Funds for the Central Universities (Grant No. SWU1509383), Natural Science Foundation of Chongqing (Grant No. cstc2015jcyjA10106), and a general financial grant from the China Postdoctoral Science Foundation (Grant No. 2015M572423). PX is supported by the National Science Foundation of China (Grant No. NSFC 31271189). The effective connectivity algorithm work was supported by the Human Brain Project (Grant No. FP7-FET-ICT-604102 and H2020–720270 HBP SGA1 to GD) and the Marie Skłodowska-Curie Action (Grant No. H2020-MSCA-656547 to MG).
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Nonparametric test for connectivity detection in multivariate autoregressive networks and application to multiunit activity data

  • Gilson, Matthieu
  • Tauste Campo, Adrià, 1982-
  • Chen, X.
  • Thiele, Alexander
  • Deco, Gustavo
Directed connectivity inference has become a cornerstone in neuroscience to analyze multivariate data from neuroimaging and electrophysiological techniques. Here we propose a nonparametric significance method to test the nonzero values of multivariate autoregressive model to infer interactions in recurrent networks. We use random permutations or circular shifts of the original time series to generate the null-hypothesis distributions. The underlying network model is the same as used in multivariate Granger causality, but our test relies on the autoregressive coefficients instead of error residuals. By means of numerical simulation over multiple network configurations, we show that this method achieves a good control of false positives (type 1 error) and detects existing pairwise connections more accurately than using the standard parametric test for the ratio of error residuals. In practice, our method aims to detect temporal interactions in real neuronal networks with nodes possibly exhibiting redundant activity. As a proof of concept, we apply our method to multiunit activity (MUA) recorded from Utah electrode arrays in a monkey and examine detected interactions between 25 channels. We show that during stimulus presentation our method detects a large number of interactions that cannot be solely explained by the increase in the MUA level., MG acknowledges funding from the Marie Sklodowska-Curie Action (grant H2020-MSCA656547). MG and GD were supported by the Human Brain Project (grant FP7-FET-ICT-604102 and H2020-720270 HBP SGA1). GD and ATC were supported by the European Research Council Advanced Grant DYSTRUCTURE (Grant 295129). AT was supported by the UK Medical Research Council (grant MRC G0700976).
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Propagation of spiking moments in linear hawkes networks

  • Gilson, Matthieu
  • Pfister, Jean-Pascal
The present paper provides exact mathematical expressions for the high-order moments of spiking activity in a recurrently connected network of linear Hawkes processes. It extends previous studies that have explored the case of a (linear) Hawkes network driven by deterministic intensity functions to the case of a stimulation by external inputs (rate functions or spike trains) with arbitrary correlation structure. Our approach describes the spatio-temporal filtering induced by the afferent and recurrent connectivities (with arbitrary synaptic response kernels) using operators acting on the input moments. This algebraic viewpoint provides intuition about how the network ingredients shape the input-output mapping for moments, as well as cumulants. We also show using numerical simulation that our results hold for neurons with refractoriness implemented by self-inhibition, provided the corresponding negative feedback for each neuron only mildly alters its mean firing probability., The work of the first author was supported by the European Union's Horizon 2020 Research and Innovation program via the Marie Sk\lodowska-Curie Actions (H2020-MSCA-656547) and under grant agreement 785907 (HBP SGA2). The work of the second author was supported by the Swiss National Science Foundation (SNSF) grants PP00P3 150637 and PP00P3 179060.
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Capacity of the covariance perceptron

  • Dahmen, David
  • Gilson, Matthieu
  • Helias, Moritz
The classical perceptron is a simple neural network that performs a binary classification by a linear mapping between static inputs and outputs and application of a threshold. For small inputs, neural networks in a stationary state also perform an effectively linear input–output transformation, but of an entire time series. Choosing the temporal mean of the time series as the feature for classification, the linear transformation of the network with subsequent thresholding is equivalent to the classical perceptron. Here we show that choosing covariances of time series as the feature for classification maps the neural network to what we call a 'covariance perceptron'; a mapping between covariances that is bilinear in terms of weights. By extending Gardner's theory of connections to this bilinear problem, using a replica symmetric mean-field theory, we compute the pattern and information capacities of the covariance perceptron in the infinite-size limit. Closed-form expressions reveal superior pattern capacity in the binary classification task compared to the classical perceptron in the case of a high-dimensional input and low-dimensional output. For less convergent networks, the mean perceptron classifies a larger number of stimuli. However, since covariances span a much larger input and output space than means, the amount of stored information in the covariance perceptron exceeds the classical counterpart. For strongly convergent connectivity it is superior by a factor equal to the number of input neurons. Theoretical calculations are validated numerically for finite size systems using a gradient-based optimization of a soft-margin, as well as numerical solvers for the NP hard quadratically constrained quadratic programming problem, to which training can be mapped., This work was partially supported by the Marie Sklodowska-Curie Action (Grant H2020-MSCA-656547) of the European Commission, the Helmholtz young investigator's group VH-NG-1028, the European Union's Horizon 2020 research and innovation program under Grant agreement No. 785907 (Human Brain Project SGA2), the Exploratory Research Space (ERS) seed fund neuroIC002 (part of the DFG excellence initiative) of the RWTH university and the JARA Center for Doctoral studies within the graduate School for Simulation and Data Science (SSD).
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

The covariance perceptron: A new paradigm for classification and processing of time series in recurrent neuronal networks

  • Gilson, Matthieu
  • Dahmen, David
  • Moreno Bote, Rubén
  • Insabato, Andrea
  • Helias, Moritz
Learning in neuronal networks has developed in many directions, in particular to reproduce cognitive tasks like image recognition and speech processing. Implementations have been inspired by stereotypical neuronal responses like tuning curves in the visual system, where, for example, ON/OFF cells fire or not depending on the contrast in their receptive fields. Classical models of neuronal networks therefore map a set of input signals to a set of activity levels in the output of the network. Each category of inputs is thereby predominantly characterized by its mean. In the case of time series, fluctuations around this mean constitute noise in this view. For this paradigm, the high variability exhibited by the cortical activity may thus imply limitations or constraints, which have been discussed for many years. For example, the need for averaging neuronal activity over long periods or large groups of cells to assess a robust mean and to diminish the effect of noise correlations. To reconcile robust computations with variable neuronal activity, we here propose a conceptual change of perspective by employing variability of activity as the basis for stimulus-related information to be learned by neurons, rather than merely being the noise that corrupts the mean signal. In this new paradigm both afferent and recurrent weights in a network are tuned to shape the input-output mapping for covariances, the second-order statistics of the fluctuating activity. When including time lags, covariance patterns define a natural metric for time series that capture their propagating nature. We develop the theory for classification of time series based on their spatio-temporal covariances, which reflect dynamical properties. We demonstrate that recurrent connectivity is able to transform information contained in the temporal structure of the signal into spatial covariances. Finally, we use the MNIST database to show how the covariance perceptron can capture specific second-order statistical patterns generated by moving digits., This work was partially supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No.785907 (Human Brain Project SGA2). MG acknowledges funding from the Marie Sklodowska-Curie Action (Grant H2020-MSCA656547) of the European Commission. DD and MH acknowledge the Helmholtz young investigator’s group (VH-NG-1028), the Exploratory Research Space (ERS) seed fund neuroIC002 (EXS-SFneuroIC002) of the RWTH university and the JARA Center for Doctoral studies within the graduate School for Simulation and Data Science (SSD). AI acknowledges funding from the Marie Sklodowska-Curie Action (Grant H2020-MSCA841684) of the European Commission. RMB acknowledges funding from the Howard Hughes Medical Institute (HHMI, ref 55008742), MINECO (Spain; BFU2017-85936-P) and ICREA Academia (2016). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript
Repositorio Digital de la UPF
Publication Artículo científico (JournalArticle)

Framework based on communicability and flow to analyze complex network dynamics

  • Gilson, Matthieu
  • Kouvaris, Nikos
  • Deco, Gustavo
  • Zamora-López, Gorka
Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection., M.G. acknowledges funding from the Marie SkłodowskaCurie Action (Grant No. H2020-MSCA-656547) of the European Commission. G.Z.L., N.E.K., and G.D. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No. 720270 (HBP SGA1). G.D. also acknowledges funding from the European Research Council Advanced Grant DYSTRUCTURE (No. 295129) and the Spanish Research Project (No. PSI2013-42091-P). N.E.K. acknowledges support by the “MOVE-IN Louvain” fellowship cofunded by the Marie Skłodowska-Curie Action of the European Commission.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Nonparametric test for connectivity detection in multivariate autoregressive networks and application to multiunit activity data

  • Gilson, Matthieu
  • Tauste Campo, Adrià, 1982-
  • Chen, X.
  • Thiele, Alexander
  • Deco, Gustavo
Directed connectivity inference has become a cornerstone in neuroscience to analyze multivariate data from neuroimaging and electrophysiological techniques. Here we propose a nonparametric significance method to test the nonzero values of multivariate autoregressive model to infer interactions in recurrent networks. We use random permutations or circular shifts of the original time series to generate the null-hypothesis distributions. The underlying network model is the same as used in multivariate Granger causality, but our test relies on the autoregressive coefficients instead of error residuals. By means of numerical simulation over multiple network configurations, we show that this method achieves a good control of false positives (type 1 error) and detects existing pairwise connections more accurately than using the standard parametric test for the ratio of error residuals. In practice, our method aims to detect temporal interactions in real neuronal networks with nodes possibly exhibiting redundant activity. As a proof of concept, we apply our method to multiunit activity (MUA) recorded from Utah electrode arrays in a monkey and examine detected interactions between 25 channels. We show that during stimulus presentation our method detects a large number of interactions that cannot be solely explained by the increase in the MUA level., MG acknowledges funding from the Marie Sklodowska-Curie Action (grant H2020-MSCA656547). MG and GD were supported by the Human Brain Project (grant FP7-FET-ICT-604102 and H2020-720270 HBP SGA1). GD and ATC were supported by the European Research Council Advanced Grant DYSTRUCTURE (Grant 295129). AT was supported by the UK Medical Research Council (grant MRC G0700976).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Capacity of the covariance perceptron

  • Dahmen, David
  • Gilson, Matthieu
  • Helias, Moritz
The classical perceptron is a simple neural network that performs a binary classification by a linear mapping between static inputs and outputs and application of a threshold. For small inputs, neural networks in a stationary state also perform an effectively linear input–output transformation, but of an entire time series. Choosing the temporal mean of the time series as the feature for classification, the linear transformation of the network with subsequent thresholding is equivalent to the classical perceptron. Here we show that choosing covariances of time series as the feature for classification maps the neural network to what we call a 'covariance perceptron'; a mapping between covariances that is bilinear in terms of weights. By extending Gardner's theory of connections to this bilinear problem, using a replica symmetric mean-field theory, we compute the pattern and information capacities of the covariance perceptron in the infinite-size limit. Closed-form expressions reveal superior pattern capacity in the binary classification task compared to the classical perceptron in the case of a high-dimensional input and low-dimensional output. For less convergent networks, the mean perceptron classifies a larger number of stimuli. However, since covariances span a much larger input and output space than means, the amount of stored information in the covariance perceptron exceeds the classical counterpart. For strongly convergent connectivity it is superior by a factor equal to the number of input neurons. Theoretical calculations are validated numerically for finite size systems using a gradient-based optimization of a soft-margin, as well as numerical solvers for the NP hard quadratically constrained quadratic programming problem, to which training can be mapped., This work was partially supported by the Marie Sklodowska-Curie Action (Grant H2020-MSCA-656547) of the European Commission, the Helmholtz young investigator's group VH-NG-1028, the European Union's Horizon 2020 research and innovation program under Grant agreement No. 785907 (Human Brain Project SGA2), the Exploratory Research Space (ERS) seed fund neuroIC002 (part of the DFG excellence initiative) of the RWTH university and the JARA Center for Doctoral studies within the graduate School for Simulation and Data Science (SSD).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Effective connectivity in depression

  • Rolls, Edmund T
  • Cheng, Wei
  • Gilson, Matthieu
  • Qiu, Jiang
  • Hu, Zicheng
  • Ruan, Hongtao
  • Li, Yu
  • Huang, Chu-Chung
  • Yang, Albert C
  • Tsai, Shih-Jen
  • Zhang, Xiaodong
  • Zhuang, Kaixiang
  • Lin, Ching-Po
  • Deco, Gustavo
  • Xie, Peng
  • Feng, Jianfeng
Background: Resting-state functional connectivity reflects correlations in the activity between brain areas, whereas effective connectivity between different brain areas measures directed influences of brain regions on each other. Using the latter approach, we compare effective connectivity results in patients with major depressive disorder (MDD) and control subjects. Methods: We used a new approach to the measurement of effective connectivity, in which each brain area has a simple dynamical model, and known anatomical connectivity is used to provide constraints. This helps the approach to measure the effective connectivity between the 94 brain areas parceled in the automated anatomical labeling (AAL2) atlas, using resting-state functional magnetic resonance imaging. Moreover, we show how the approach can be used to measure the differences in effective connectivity between different groups of individuals, using as an example effective connectivity in the healthy brain and in individuals with depression. The first brainwide resting-state effective-connectivity neuroimaging analysis of depression, with 350 healthy individuals and 336 patients with major depressive disorder, is described. Results: Key findings are that the medial orbitofrontal cortex, implicated in reward and subjective pleasure, has reduced effective connectivity from temporal lobe input areas in depression; that the lateral orbitofrontal cortex, implicated in nonreward, has increased activity (variance) in depression, with decreased effective connectivity to and from cortical areas contralateral to language-related areas; and that the hippocampus, implicated in memory, has increased activity (variance) in depression and increased effective connectivity from the temporal pole. Conclusions: Measurements of effective connectivity made using the new method provide a new approach to causal mechanisms in the brain in depression., JF is a Royal Society Wolfson Research Merit Award holder. JF is also partially supported by the National High Technology Research and Development Program of China (Grant No. 2015AA020507) and the key project of Shanghai Science & Technology Innovation Plan (Grant No. 15JC1400101). The research was partially supported by the National Centre for Mathematics and Interdisciplinary Sciences (NCMIS) of the Chinese Academy of Sciences, Key Program of National Natural Science Foundation of China (Grant No. 91230201), and the Shanghai Soft Science Research Program (Grant No. 15692106604). WC is supported by grants from the National Natural Sciences Foundation of China (Grant No. 81701773, 11771010, 11471081, 11101429, and 71661167002), sponsored by Shanghai Sailing Program (Grant No. 17YF1426200) and the Research Fund for the Doctoral Program of Higher Education of China (Grant No. 2017M610226). C-PL was supported in part by funding from Ministry of Science and Technology, Taiwan (Grant Nos. NSC100–2911-I-010–010, NSC101–2911-I-010–009, NSC100–2628-E−010–002-MY3, NSC102–2321-B-010–023, and NSC103–2911-I-010–501), National Health Research Institutes (Grant Nos. NHRI-EX103–10310EI and NHRI-EX106-10611EI), Ministry of Health and Welfare of Taiwan (Grant No. DOH102-TD-PB-111-NSC006), and Academia Sinica, Taipei, Taiwan. JQ was supported by the National Natural Science Foundation of China (Grant Nos. 31271087, 31470981, 31571137, 31500885), National Outstanding Young People Plan, the Program for the Top Young Talents by Chongqing, the Fundamental Research Funds for the Central Universities (Grant No. SWU1509383), Natural Science Foundation of Chongqing (Grant No. cstc2015jcyjA10106), and a general financial grant from the China Postdoctoral Science Foundation (Grant No. 2015M572423). PX is supported by the National Science Foundation of China (Grant No. NSFC 31271189). The effective connectivity algorithm work was supported by the Human Brain Project (Grant No. FP7-FET-ICT-604102 and H2020–720270 HBP SGA1 to GD) and the Marie Skłodowska-Curie Action (Grant No. H2020-MSCA-656547 to MG).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Extracting orthogonal subject- and condition-specific signatures from fMRI data using whole-brain effective connectivity

  • Pallarés, Vicente
  • Insabato, Andrea
  • Sanjuán, Ana
  • Kühn, Simone
  • Mantini, Dante
  • Deco, Gustavo
  • Gilson, Matthieu
The study of brain communication based on fMRI data is often limited because such measurements are a mixture of session-to-session variability with subject- and condition-related information. Disentangling these contributions is crucial for real-life applications, in particular when only a few recording sessions are available. The present study aims to define a reliable standard for the extraction of multiple signatures from fMRI data, while verifying that they do not mix information about the different modalities (e.g., subjects and conditions such as tasks performed by them). In particular, condition-specific signatures should not be contaminated by subjectrelated information, since they aim to generalize over subjects. Practically, signatures correspond to subnetworks of directed interactions between brain regions (typically 100 covering the whole brain) supporting the subject and condition identification for single fMRI sessions. The key for robust prediction is using effective connectivity instead of functional connectivity. Our method demonstrates excellent generalization capabilities for subject identification in two datasets, using only a few sessions per subject as reference. Using another dataset with resting state and movie viewing, we show that the two signatures related to subjects and tasks correspond to distinct subnetworks, which are thus topologically orthogonal. Our results set solid foundations for applications tailored to individual subjects, such as clinical diagnostic., This work was supported by the European Union's Horizon 2020 research and innovation programme/Human Brain Project (grant FP7-FET-ICT-604102 to MG and GD; H2020-720270 HBP SGA1 to GD) and the Marie Sklodowska-Curie Action (grant H2020-MSCA-656547 to MG). A.I. is supported by the Spanish Ministry of Economy and Competitiveness Flag-ERA APCIN project CHAMPMouse (PCIN-2015-127). GD also acknowledges funding from the ERC Advanced Grant DYSTRUCTURE (#295129), the Spanish Research Project PSI2016-75688-P and the Catalan Research Group Support 2017 SGR 1545. DM was supported by the KU Leuven Special Research Fund (grant C16/15/070). SK has been funded by a Heisenberg grant from the German Science Foundation (DFG KU 3322/1-1), the European Union (ERC-2016-StG-Self-Control-677804) and a Fellowship from the Jacobs Foundation (JRF 2016-2018). This work has in part been funded by the German Science Foundation (SFB 936/C7).
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

The covariance perceptron: A new paradigm for classification and processing of time series in recurrent neuronal networks

  • Gilson, Matthieu
  • Dahmen, David
  • Moreno Bote, Rubén
  • Insabato, Andrea
  • Helias, Moritz
Learning in neuronal networks has developed in many directions, in particular to reproduce cognitive tasks like image recognition and speech processing. Implementations have been inspired by stereotypical neuronal responses like tuning curves in the visual system, where, for example, ON/OFF cells fire or not depending on the contrast in their receptive fields. Classical models of neuronal networks therefore map a set of input signals to a set of activity levels in the output of the network. Each category of inputs is thereby predominantly characterized by its mean. In the case of time series, fluctuations around this mean constitute noise in this view. For this paradigm, the high variability exhibited by the cortical activity may thus imply limitations or constraints, which have been discussed for many years. For example, the need for averaging neuronal activity over long periods or large groups of cells to assess a robust mean and to diminish the effect of noise correlations. To reconcile robust computations with variable neuronal activity, we here propose a conceptual change of perspective by employing variability of activity as the basis for stimulus-related information to be learned by neurons, rather than merely being the noise that corrupts the mean signal. In this new paradigm both afferent and recurrent weights in a network are tuned to shape the input-output mapping for covariances, the second-order statistics of the fluctuating activity. When including time lags, covariance patterns define a natural metric for time series that capture their propagating nature. We develop the theory for classification of time series based on their spatio-temporal covariances, which reflect dynamical properties. We demonstrate that recurrent connectivity is able to transform information contained in the temporal structure of the signal into spatial covariances. Finally, we use the MNIST database to show how the covariance perceptron can capture specific second-order statistical patterns generated by moving digits., This work was partially supported by the European Union’s Horizon 2020 research and innovation programme under grant agreement No.785907 (Human Brain Project SGA2). MG acknowledges funding from the Marie Sklodowska-Curie Action (Grant H2020-MSCA656547) of the European Commission. DD and MH acknowledge the Helmholtz young investigator’s group (VH-NG-1028), the Exploratory Research Space (ERS) seed fund neuroIC002 (EXS-SFneuroIC002) of the RWTH university and the JARA Center for Doctoral studies within the graduate School for Simulation and Data Science (SSD). AI acknowledges funding from the Marie Sklodowska-Curie Action (Grant H2020-MSCA841684) of the European Commission. RMB acknowledges funding from the Howard Hughes Medical Institute (HHMI, ref 55008742), MINECO (Spain; BFU2017-85936-P) and ICREA Academia (2016). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Propagation of spiking moments in linear hawkes networks

  • Gilson, Matthieu
  • Pfister, Jean-Pascal
The present paper provides exact mathematical expressions for the high-order moments of spiking activity in a recurrently connected network of linear Hawkes processes. It extends previous studies that have explored the case of a (linear) Hawkes network driven by deterministic intensity functions to the case of a stimulation by external inputs (rate functions or spike trains) with arbitrary correlation structure. Our approach describes the spatio-temporal filtering induced by the afferent and recurrent connectivities (with arbitrary synaptic response kernels) using operators acting on the input moments. This algebraic viewpoint provides intuition about how the network ingredients shape the input-output mapping for moments, as well as cumulants. We also show using numerical simulation that our results hold for neurons with refractoriness implemented by self-inhibition, provided the corresponding negative feedback for each neuron only mildly alters its mean firing probability., The work of the first author was supported by the European Union's Horizon 2020 Research and Innovation program via the Marie Sk\lodowska-Curie Actions (H2020-MSCA-656547) and under grant agreement 785907 (HBP SGA2). The work of the second author was supported by the Swiss National Science Foundation (SNSF) grants PP00P3 150637 and PP00P3 179060.
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Framework based on communicability and flow to analyze complex network dynamics

  • Gilson, Matthieu
  • Kouvaris, Nikos
  • Deco, Gustavo
  • Zamora-López, Gorka
Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection., M.G. acknowledges funding from the Marie SkłodowskaCurie Action (Grant No. H2020-MSCA-656547) of the European Commission. G.Z.L., N.E.K., and G.D. acknowledge funding from the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No. 720270 (HBP SGA1). G.D. also acknowledges funding from the European Research Council Advanced Grant DYSTRUCTURE (No. 295129) and the Spanish Research Project (No. PSI2013-42091-P). N.E.K. acknowledges support by the “MOVE-IN Louvain” fellowship cofunded by the Marie Skłodowska-Curie Action of the European Commission.