GP CaKe: Effective brain connectivity with causal kernels

05/16/2017 ∙ by Luca Ambrogioni, et al. ∙ Radboud Universiteit 0

A fundamental goal in network neuroscience is to understand how activity in one region drives activity elsewhere, a process referred to as effective connectivity. Here we propose to model this causal interaction using integro-differential equations and causal kernels that allow for a rich analysis of effective connectivity. The approach combines the tractability and flexibility of autoregressive modeling with the biophysical interpretability of dynamic causal modeling. The causal kernels are learned nonparametrically using Gaussian process regression, yielding an efficient framework for causal inference. We construct a novel class of causal covariance functions that enforce the desired properties of the causal kernels, an approach which we call GP CaKe. By construction, the model and its hyperparameters have biophysical meaning and are therefore easily interpretable. We demonstrate the efficacy of GP CaKe on a number of simulations and give an example of a realistic application on magnetoencephalography (MEG) data.



There are no comments yet.


page 6

Code Repositories


Bayesian Effective Connectivity

view repo
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

In recent years, substantial effort was dedicated to the study of the network properties of neural systems, ranging from individual neurons to macroscopic brain areas. It has become commonplace to describe the brain as a network that may be further understood by considering either its anatomical (static) scaffolding, the functional dynamics that reside on top of that or the causal influence that the network nodes exert on one another 

[1, 2, 3]. The latter is known as effective connectivity

and has inspired a surge of data analysis methods that can be used to estimate the information flow between neural sources from their electrical or haemodynamic activity

[2, 4]. In electrophysiology, the most popular connectivity methods are variations on the autoregressive (AR) framework  [5]. Specifically, Granger causality (GC) and related methods, such as partial directed coherence and directed transfer function, have been successfully applied to many kinds of neuroscientific data [6, 7]. These methods can be either parametric or non-parametric, but are not based on a specific biophysical model [8, 9]. Consequently, the connectivity estimates obtained from these methods are only statistical in nature and cannot be directly interpreted in terms of biophysical interactions [10]

. This contrasts with the framework of dynamic causal modeling (DCM), which allows for Bayesian inference (using Bayes factors) with respect to biophysical models of interacting neuronal populations

[11]. These models are usually formulated in terms of either deterministic or stochastic differential equations, in which the effective connectivity between neuronal populations depends on a series of scalar parameters that specify the strength of the interactions and the conduction delays [12]. DCMs are usually less flexible than AR models since they depend on an appropriate parametrization of the effective connectivity kernel, which in turn depends on detailed prior biophysical knowledge or Bayesian model comparison.

In this paper, we introduce a new method that is aimed to bridge the gap between biophysically inspired models, such as DCM, and statistical models, such as AR, using the powerful tools of Bayesian nonparametrics [13]. We model the interacting neuronal populations with a system of stochastic integro-differential equations. In particular, the intrinsic dynamic of each population is modeled using a linear differential operator while the effective connectivity between populations is modeled using causal integral operators. The differential operators can account for a wide range of dynamic behaviors, such as stochastic relaxation and stochastic oscillations. While this class of models cannot account for non-linearities, it has the advantage of being analytically tractable. Using the framework of Gaussian process (GP) regression, we can obtain the posterior distribution of the effective connectivity kernel without specifying a predetermined parametric form. We call this new effective connectivity method Gaussian process Causal Kernels (GP CaKe). The GP CaKe method can be seen as a nonparametric extension of linear DCM for which the exact posterior distribution can be obtained in closed-form without resorting to variational approximations. In this way, the method combines the flexibility and statistical simplicity of AR modeling with the biophysical interpretability of a linear DCM.

The paper is structured as follows. In Section 2 we describe the model for the activity of neuronal populations and their driving interactions. In Section 3 we construct a Bayesian hierarchical model that allows us to learn the causal interaction functions. Next, in Section 3.2, we show that these causal kernels may be learned analytically using Gaussian process regression. Subsequently in Section 4, we validate GP CaKe using a number of simulations and demonstrate its usefulness on MEG data in Section 5. Finally, we discuss the wide array of possible extensions and applications of the model in Section 6.

2 Neuronal dynamics

We model the activity of a neuronal population using the stochastic differential equation


where is the total synaptic input coming from other neuronal populations and

is Gaussian white noise with mean

and variance

. The differential operator specifies the internal dynamic of the neuronal population. For example, oscillatory dynamic can be modeled using the damped harmonic operator  , where is the peak angular frequency and is the damping coefficient.

In Eq. 1, the term accounts for the effective connectivity between neuronal populations. Assuming that the interactions are linear and stationary over time, the most general form for is given by a sum of convolutions:


where the function is the causal kernel, modeling the effective connectivity from population to population , and indicates the convolution operator. The causal kernel gives a complete characterization of the linear effective connectivity between the two neuronal populations, accounting for the excitatory or inhibitory nature of the connection, the time delay, and the strength of the interaction. Importantly, in order to preserve the causality of the system, we assume that is identically equal to zero for negative lags ().

Inserting Eq. 2 into Eq. 1, we obtain the following system of stochastic integro-differential equations:


which fully characterizes the stochastic dynamic of a functional network consisting of neuronal populations.

3 The Bayesian model

We can frame the estimation of the effective connectivity between neuronal populations as a nonparametric Bayesian regression problem. In order to do this, we assign a GP prior distribution to the kernel functions for every presynaptic population and postsynaptic population . A stochastic function is said to follow a GP distribution when all its marginal distributions are distributed as a multivariate Gaussian [14]

. Since these marginals are determined by their mean vector and covariance matrix, the GP is fully specified by a mean and a covariance function, respectively

and . Using the results of the previous subsection we can summarize the problem of Bayesian nonparametric effective connectivity estimation in the following way:


where expressions such as mean that the stochastic process follows a GP distribution with mean function and covariance function .

Our aim is to obtain the posterior distributions of the effective connectivity kernels given a set of samples from all the neuronal processes. As a consequence of the time shift invariance, the system of integro-differential equations becomes a system of decoupled linear algebraic equations in the frequency domain. It is therefore convenient to rewrite the regression problem in the frequency domain:


where is a complex-valued polynomial since the application of a differential operator in the time domain is equivalent to multiplication with a polynomial in the frequency domain. In the previous expression,

denotes a circularly-symmetric complex normal distribution with mean

and variance , while denotes a circularly-symmetric complex valued GP with mean function and Hermitian covariance function [15]. Importantly, the complex valued Hermitian covariance function can be obtained from

by taking the Fourier transform of both its arguments:


3.1 Causal covariance functions

In order to be applicable for causal inference, the prior covariance function must reflect three basic assumptions about the connectivity kernel: I) temporal localization, II) causality and III) smoothness. Since we perform the GP analysis in the frequency domain, we will work with , i.e. the double Fourier transform of the covariance function.

First, the connectivity kernel should be localized in time, as the range of plausible delays in axonal communication between neuronal populations is bounded. In order to enforce this constraint, we need a covariance function that vanishes when either or becomes much larger than a time constant . In the frequency domain, this temporal localization can be implemented by inducing correlations between the Fourier coefficients of neighboring frequencies. In fact, local correlations in the time domain are associated with a Fourier transform that vanishes for high values of . From Fourier duality, this implies that local correlations in the frequency domain are associated with a function that vanishes for high values of . We model these spectral correlations using a squared exponential covariance function:


where . Since we expect the connectivity to be highest after a minimal conduction delay , we introduced a time shift factor in the exponent that translates the peak of the variance from to , which follows from the Fourier shift theorem. As this covariance function depends solely on the difference between frequencies , it can be written (with a slight abuse of notation) as .

Second, we want the connectivity kernel to be causal, meaning that information cannot propagate back from the future. In order to enforce causality, we introduce a new family of covariance functions that vanish when the lag is negative. In the frequency domain, a causal covariance function can be obtained by adding an imaginary part to Eq. 7 that is equal to its Hilbert transform [16]. Causal covariance functions are the Fourier dual of quadrature covariance functions, which define GP distributions over the space of analytic functions, i.e. functions whose Fourier coefficients are zero for all negative frequencies [15]. The causal covariance function is given by the following formula:


Finally, as communication between neuronal populations is mediated by smooth biological processes such as synaptic release of neurotransmitters and dendritic propagation of potentials, we want the connectivity kernel to be a smooth function of the time lag. Smoothness in the time domain can be imposed by discounting high frequencies. Here, we use the following discounting function:


This discounting function induces a process that is smooth (infinitely differentiable) and with time scale equal to [14]. Our final covariance function is given by


Unfortunately, the temporal smoothing breaks the strict causality of the covariance function because it introduces leakage from the positive lags to the negative lags. Nevertheless, the covariance function closely approximates a causal covariance function when is not much bigger than .

3.2 Gaussian process regression

In order to explain how to obtain the posterior distribution of the causal kernel, we need to review some basic results of nonparametric Bayesian regression and GP regression in particular. Nonparametric Bayesian statistics deals with inference problems where the prior distribution has infinitely many degrees of freedom

[13]. We focus on the following nonparametric regression problem, where the aim is to reconstruct a series of real-valued functions from a finite number of noisy mixed observations:


where is the -th entry of the data vector , is an unknown latent function and

is a random variable that models the observation noise with diagonal covariance matrix

. The mixing functions

are assumed to be known and determine how the latent functions generate the data. In nonparametric Bayesian regression, we specify prior probability distributions over the whole (infinitely dimensional) space of functions

. Specifically, in the GP regression framework this distribution is chosen to be a zero-mean GP. In order to infer the value of the function at an arbitrary set of target points , we organize these values in the vector with entries . The posterior expected value of , that we will denote as , is given by


where the covariance matrix is defined by the entries and the cross-covariance matrix is defined by the entries  [14]. The matrices are square and diagonal, with the entries given by .

It is easy to see that the problem defined by Eq. 5 has the exact same form as the generalized regression problem given by Eq. 11, with as dependent variable. In particular, the weight functions are given by and the noise term has variance . Therefore, the expectation of the posterior distributions can be obtained in closed from from Eq. 12.

4 Effective connectivity simulation study

We performed a simulation study to assess the performance of the GP CaKe approach in recovering the connectivity kernel from a network of simulated sources. The neuronal time series are generated by discretizing a system of integro-differential equations, as expressed in Eq. 3. Time series data was then generated for each of the sources using the Ornstein-Uhlenbeck process dynamic, i.e.


where the positive parameter is the relaxation coefficient of the process. The bigger is, the faster the process reverts to its mean (i.e. zero) after a perturbation. The discretization of this dynamic is equivalent to a first order autoregressive process. As ground truth effective connectivity, we used functions of the form


where is a (non-negative) time lag, is the connectivity strength from to and is the connectivity time scale.

In order to recover the connectivity kernels we first need to estimate the differential operator . For simplicity, we estimated the parameters of the differential operator by maximizing the univariate marginal likelihood of each individual source. This procedure requires that the variance of the structured input from the other neuronal populations is smaller than the variance of the unstructured white noise input so that the estimation of the intrinsic dynamic is not too much affected by the coupling.

Since most commonly used effective connectivity measures (e.g. Granger causality, partial directed coherence, directed transfer function) are obtained from fitted vector autoregression (VAR) coefficients, we use VAR as a comparison method. Since the least-squares solution for the VAR coefficients is not regularized, we also compare with a ridge regularized VAR model, whose penalty term is learned using cross-validation on separately generated training data. This comparison is particularly natural since our connectivity kernel is the continuous-time equivalent of the lagged AR coefficients between two time series.

4.1 Recovery of the effective connectivity kernels

We explore the effects of different parameter values to demonstrate the intuitiveness of the kernel parameters. Whenever a parameter is not specifically adjusted, we use the following default values: noise level , temporal smoothing and temporal localization . Furthermore, we set throughout.

Figure 1: Example of estimated connectivity. A. The estimated connectivity kernels for two connections: one present (2 1) and one absent (1 2). B. A three-node network in which node 1 feeds into node 2 and node 2 feeds into node 3. The disconnected edge from 1 to 3 is correctly estimated, as the estimated kernel is approximately zero. For visual clarity, estimated connectivity kernels for other absent connections (2 1, 3 and 3 1) are omitted in the second panel. The shaded areas indicate the 95% posterior density interval over 200 trials.

Figure 1 illustrates connectivity kernels recovered by GP CaKe. These kernels have a connection strength of if feeds into and otherwise. This applies to both the two node and the three node network. As these kernels show, our method recovers the desired shape as well as the magnitude of the effective connectivity for both connected and disconnected edges. At the same time, Fig. 1B demonstrates that the indirect pathway through two connections does not lead to a non-zero estimated kernel. Note furthermore that the kernels become non-zero after the zero-lag mark (indicated by the dashed lines), demonstrating that there is no significant anti-causal information leakage.

Figure 2: The effect of the the temporal localization, smoothness and noise level parameters on a present connection. A. The correlation and mean squared error between the ground truth connectivity kernel and the estimation by GP CaKe. B. The shapes of the estimated kernels as determined by the indicated parameter. Default values for the parameters that remain fixed are , and

. The dashed line indicates the zero-lag moment at which point the causal effect deviates from zero. The shaded areas indicate the 95% posterior density interval over 200 trials.

The effects of the different kernel parameter settings are shown in Fig. 2A, where again the method is estimating connectivity for a two node network with one active connection, with . We show the mean squared error (MSE) as well as the correlation between the ground truth effective connectivity and the estimates obtained using our method. We do this for different values of the temporal smoothing, the noise level and the temporal localization parameters. Figure 2B shows the estimated kernels that correspond to these settings. As to be expected, underestimating the temporal smoothness results in increased variance due to the lack of regularization. On the other hand, overestimating the smoothness results in a highly biased estimate as well as anti-causal information leakage. Overestimating the noise level does not induce anti-causal information leakage but leads to substantial bias. Finally, overestimating the temporal localization leads to an underestimation of the duration of the causal influence.

Figure 3: The performance of the recovery of the effective connectivity kernels in terms of the correlation and mean squared error between the actual and the recovered kernel. Left column: results for the two node graph shown in Fig. 1A. Right column: results for the three node graph shown in Fig. 1B. The dashed line indicates the baseline that estimates all node pairs as disconnected.

Figure 3 shows a quantitative comparison between GP CaKe and the (regularized and unregularized) VAR model for the networks shown in Fig. 1A and Fig. 1B. The connection strength was varied to study its effect on the kernel estimation. It is clear that GP CaKe greatly outperforms both VAR models and that ridge regularization is beneficial for the VAR approach. Note that, when the connection strength is low, the MSE is actually smallest for the fully disconnected model. Conversely, both GP CaKe and VAR always outperform the disconnected estimate with respect to the correlation measure.

5 Brain connectivity

In this section we investigate the effective connectivity structure of a network of cortical sources. In particular, we focus on sources characterized by alpha oscillations (8–12Hz), the dominant rhythm in MEG recordings. The participant was asked to watch one-minute long video clips selected from an American television series. During these blocks the participant was instructed to fixate on a cross in the center of the screen. At the onset of each block a visually presented message instructed the participant to pay attention to either the auditory or the visual stream. The experiment also included a so-called ‘resting state’ condition in which the participant was instructed to fixate on a cross in the center of a black screen. Brain activity was recorded using a 275 channels axial MEG system.

The GP CaKe method can be applied to a set of signals whose intrinsic dynamic can be characterized by stochastic differential equations. Raw MEG measurements can be seen as a mixture of dynamical signals, each characterized by a different intrinsic dynamic. Therefore, in order to apply the method on MEG data, we need to isolate a set of dynamic components. We extracted a series of unmixed neural sources by applying independent component analysis (ICA) on the sensor recordings. These components were chosen to have a clear dipolar pattern, the signature of a localized cortical source. These local sources have a dynamic that can be well approximated with a linear mixture of linear stochastic differential equations

[17]. We used the recently introduced temporal GP decomposition in order to decompose the components’ time series into a series of dynamic components [17]. In particular, for each ICA source we independently extracted the alpha oscillation component, which we modeled with a damped harmonic oscillator: . Note that the temporal GP decomposition automatically estimates the parameters and through a non-linear least-squares procedure [17].

Figure 4: Effective connectivity using MEG for three conditions: I. resting state (R), II. attention to video stream (V) and III. attention to audio stream (A). Shown are the connections between occipital cortex, parietal cortex and left and right auditory cortices. A. The binary network for each of the three conditions. B. The kernels for each of the connections. Note that the magnitude of the kernels depends on the noise level , and as the true strength is unknown, this is in arbitrary units.

We computed the effective connectivity between the sources that corresponded to occipital, parietal and left- and right auditory cortices (see Fig. 4A) using GP CaKe with the following parameter settings: temporal smoothing , temporal shift , temporal localization and noise level . To estimate the causal structure of the network, we performed a -test on the maximum values of the kernels for each of the three conditions. The results were corrected for multiple comparisons using FDR correction with . The resulting structure is shown in Fig. 4A, with the corresponding causal kernels in Fig. 4B. The three conditions are clearly distinguishable from their estimated connectivity structure. For example, during the auditory attention condition, alpha band causal influence from parietal to occipital cortex is suppressed relative to the other conditions. Furthermore, a number of connections (i.e. right to left auditory cortex, as well as both auditory cortices to occipital cortex) are only present during the resting state.

6 Discussion

We introduced a new effective connectivity method based on GP regression and integro-differential dynamical systems, referred to as GP CaKe. GP CaKe can be seen as a nonparametric extension of DCM [11] where the posterior distribution over the effective connectivity kernel can be obtained in closed form. In order to regularize the estimation, we introduced a new family of causal covariance functions that encode three basic assumptions about the effective connectivity kernel: (1) temporal localization, (2) causality, and (3) temporal smoothness. The resulting estimated kernels reflect the time-modulated causal influence that one region exerts on another. Using simulations, we showed that GP CaKe produces effective connectivity estimates that are orders of magnitude more accurate than those obtained using (regularized) multivariate autoregression. Furthermore, using MEG data, we showed that GP CaKe is able to uncover interesting patterns of effective connectivity between different brain regions, modulated by cognitive state.

Despite its high performance, the current version of the GP CaKe method has some limitations. First, the method can only be used on signals whose intrinsic dynamics are well approximated by linear stochastic differential equations. Real-world neural recordings are often a mixture of several independent dynamic components. In this case the signal needs to be preprocessed using a dynamic decomposition technique [17]. The second limitation is that the intrinsic dynamics are currently estimated from the univariate signals. This procedure can lead to biases when the neuronal populations are strongly coupled. Therefore, future developments should focus on the integration of dynamic decomposition with connectivity estimation within an overarching Bayesian model.

The model can be extended in several other directions. First, the causal structure of the neural dynamical system can be constrained using structural information in a hierarchical Bayesian model. Here, structural connectivity may be provided as an a priori constraint, for example derived from diffusion-weighted MRI [18], or learned from the functional data simultaneously  [19]. This allows the model to automatically remove connections that do not reflect a causal interaction, thereby regularizing the estimation. Alternatively, the anatomical constraints on causal interactions may be integrated into a spatiotemporal model of the brain cortex by using partial integro-differential neural field equations [20] and spatiotemporal causal kernels. In addition, the nonparametric modeling of the causal kernel can be integrated into a more complex and biophysically realistic model where the differential equations are not assumed to be linear [12] or where the observed time series data are filtered through a haemodynamic [21] or calcium impulse response function [22].

Finally, while our model explicitly refers to neuronal populations, we note that the applicability of the GP CaKe framework is in no way limited to neuroscience and may also be relevant for fields such as econometrics and computational biology.


  •  1. A. Fornito and E. T. Bullmore, “Connectomics: A new paradigm for understanding brain disease.,” European Neuropsychopharmacology, vol. 25, pp. 733–748, 2015.
  •  2. K. Friston, “Functional and effective connectivity: A review,” Brain Connectivity, vol. 1, no. 1, pp. 13–35, 2011.
  •  3. S. L. Bressler and V. Menon, “Large-scale brain networks in cognition: Emerging methods and principles,” Trends in Cognitive Sciences, vol. 14, no. 6, pp. 277–290, 2010.
  •  4. K. E. Stephan and A. Roebroeck, “A short history of causal modeling of fMRI data.,” NeuroImage, vol. 62, no. 2, pp. 856–863, 2012.
  •  5. K. Friston, R. Moran, and A. K. Seth, “Analysing connectivity with Granger causality and dynamic causal modelling.,” Current Opinion in Neurobiology, vol. 23, no. 2, pp. 172–178, 2013.
  •  6. K. Sameshima and L. A. Baccalá, “Using partial directed coherence to describe neuronal ensemble interactions,” Journal of Neuroscience Methods, vol. 94, no. 1, pp. 93–103, 1999.
  •  7. M. Kamiński, M. Ding, W. A. Truccolo, and S. L. Bressler, “Evaluating causal relations in neural systems: Granger causality, directed transfer function and statistical assessment of significance,” Biological Cybernetics, vol. 85, no. 2, pp. 145–157, 2001.
  •  8. M. Dhamala, G. Rangarajan, and M. Ding, “Analyzing information flow in brain networks with nonparametric Granger causality,” NeuroImage, vol. 41, no. 2, pp. 354–362, 2008.
  •  9. S. L. Bressler and A. K. Seth, “Wiener–Granger causality: A well established methodology,” NeuroImage, vol. 58, no. 2, pp. 323–329, 2011.
  •  10. B. Schelter, J. Timmer, and M. Eichler, “Assessing the strength of directed influences among neural signals using renormalized partial directed coherence,” Journal of Neuroscience Methods, vol. 179, no. 1, pp. 121–130, 2009.
  •  11. K. Friston, B. Li, J. Daunizeau, and K. E. Stephan, “Network discovery with DCM,” NeuroImage, vol. 56, no. 3, pp. 1202–1221, 2011.
  •  12. O. David, S. J. Kiebel, L. M. Harrison, J. Mattout, J. M. Kilner, and K. J. Friston, “Dynamic causal modeling of evoked responses in EEG and MEG,” NeuroImage, vol. 30, no. 4, pp. 1255–1272, 2006.
  •  13. N. L. Hjort, C. Holmes, P. Müller, and S. G. Walker, Bayesian Nonparametrics. Cambridge University Press, 2010.
  •  14. C. E. Rasmussen,

    Gaussian Processes for Machine Learning

    The MIT Press, 2006.
  •  15. L. Ambrogioni and E. Maris, “Complex–valued Gaussian process regression for time series analysis,” arXiv preprint arXiv:1611.10073, 2016.
  •  16. U. C. Täuber, Critical dynamics: a field theory approach to equilibrium and non-equilibrium scaling behavior. Cambridge University Press, 2014.
  •  17. L. Ambrogioni, M. A. J. van Gerven, and E. Maris, “Dynamic decomposition of spatiotemporal neural signals,” arXiv preprint arXiv:1605.02609, 2016.
  •  18. M. Hinne, L. Ambrogioni, R. J. Janssen, T. Heskes, and M. A. J. van Gerven, “Structurally-informed Bayesian functional connectivity analysis,” NeuroImage, vol. 86, pp. 294–305, 2014.
  •  19. M. Hinne, R. J. Janssen, T. Heskes, and M. A. J. van Gerven, “Bayesian estimation of conditional independence graphs improves functional connectivity estimates,” PLoS Computational Biology, vol. 11, no. 11, p. e1004534, 2015.
  •  20. S. Coombes, P. beim Graben, R. Potthast, and J. Wright, Neural Fields. Springer, 2014.
  •  21. K. J. Friston, A. Mechelli, R. Turner, and C. J. Price, “Nonlinear responses in fMRI: the Balloon model, Volterra kernels, and other hemodynamics,” NeuroImage, vol. 12, no. 4, pp. 466–477, 2000.
  •  22. C. Koch, Biophysics of computation: Information processing in single neurons. Computational Neuroscience Series, Oxford University Press, 2004.