|
|
||||||||
INNOVATIVE METHODOLOGY
1Neuroscience Department, Brown University, Providence, Rhode Island; 2Neuroscience Statistics Research Laboratory, Department of Anesthesia and Critical Care, Massachusetts General Hospital, Boston; and 3Division of Health Sciences and Technology, Harvard Medical School/Massachusetts Institute of Technology, Cambridge, Massachusetts
Submitted 8 July 2004; accepted in final form 23 August 2004
|
|
ABSTRACT |
|---|
|
|
|
INTRODUCTION |
|---|
|
Third, current capabilities to record the simultaneous activity of multiple single neurons (Csicsvari et al. 2003
; Donoghue 2002
; Nicolelis et al. 2003
; Wilson and McNaughton 1993
) make it possible to study the extent to which spiking activity in a given neuron is related to concurrent ensemble spiking activity (Grammont and Riehle 1999
, 2003
; Hatsopoulos et al. 1998
, 2003
; Jackson et al. 2003
; Maynard et al. 1999
; Sanes and Truccolo 2003
). Therefore, a statistical modeling framework that allows the analysis of the simultaneous effects of extrinsic covariates, spiking history, and concurrent neural ensemble activity would be highly desirable.
Current studies investigating the relation between spiking activity and these 3 covariate types have used primarily linear (reverse correlation) or nonlinear regression methods (e.g., Ashe and Georgopoulos 1994
; Fu et al. 1995
; Luczak et al. 2004
). Although these methods have played an important role in characterizing the spiking properties in many neural systems, 3 important shortcomings have not been fully addressed. First, neural spike trains form a sequence of discrete events or point process time series (Brillinger 1988
). Standard linear or nonlinear regression methods are designed for the analysis of continuous-valued data and not point process observations. To model spike trains with conventional regression methods the data are frequently smoothed or binned, a preprocessing step that can alter their stochastic structure and, as a consequence, the inferences made from their analysis. Second, although it is accepted that extrinsic covariates, spiking history, and neural ensemble activity affect neural spiking, current approaches make separate assessments of these effects, thereby making it difficult to establish their relative importance. Third, model goodness-of-fit assessments as well as the analysis of neural ensemble representation based on decoding should be carried out using methods appropriate for the point process nature of neural spike trains.
To address these issues, we present a point process likelihood framework to analyze the simultaneous effects and relative importance of spiking history, neural ensemble, and extrinsic covariates. We show that this likelihood analysis can be efficiently conducted by representing the logarithm of the point process conditional intensity function in terms of linear combinations of general functions of the covariates and then using the discrete time point process likelihood function to fit the model to spike train data in the generalized linear model (GLM) framework. Because the discrete time point process likelihood function is general, we also show how it may be used to relate covariates to neural spike trains in a non-GLM model. We illustrate the methods in the analysis of a simulated data example and an example in which multiple single neurons are recorded from MI in a monkey performing a visuomotor pursuit-tracking task.
|
|
METHODS |
|---|
|
A point process is a set of discrete events that occur in continuous time. For a neural spike train this would be the set of individual spike times. Given an observation interval (0, T], a sequence of J spike times 0 < u1 < ... < uj < ... < uJ
T constitutes a point process. Let N(t) denote the number of spikes counted in the time interval (0, t] for t
(0, T]. We define a single realization of the point process during the time interval (0, t] as N0:t = {0 < u1 < u2 < ... < uj
t
N(t) = j} for j
J.
Conditional intensity function
A stochastic neural point process can be completely characterized by its conditional intensity function
(t | H (t)) (Daley and Vere-Jones 2003
), defined as
![]() | (1) |
,
(t | H(t))
gives approximately the neuron's spiking probability in the time interval (t, t +
]. Because defining the conditional intensity function completely defines the point process, to model the neural spike train in terms of a point process it suffices to define its conditional intensity function. We use parametric models to express the conditional intensity as a function of covariates of interest, therefore relating the neuron's spiking probability to the covariates. We use
(t |
, H(t)) to denote the parametric representation of the conditional intensity function in Eq. 1, where
denotes an unknown parameter to be estimated. The dimension of
depends on the form of the model used to define the conditional intensity function.
A discrete time representation of the point process will facilitate the definition of the point process likelihood function and the construction of our estimation algorithms. To obtain this representation, we choose a large integer K and partition the observation interval (0, T] into K subintervals (tk1, tk]k=1K each of length
= TK1. We choose large K so that there is at most one spike per subinterval. The discrete time versions of the continuous time variables are now denoted as Nk=N(tk), N1:k=N0:tk, and Hk = H(tk). Because we chose large K, the differences
Nk = Nk Nk1 define the spike train as a binary time series of zeros and ones. In discrete time, the parametric form of the conditional intensity function becomes
(tk |
, Hk).
Point process likelihood and GLM framework
Because of its several optimality properties, we choose a likelihood approach (Pawitan 2001
) for fitting and analyzing the parametric models of the conditional intensity function. As in all likelihood analyses, the likelihood function for a continuous time point process is formulated by deriving the joint probability density of the spike train, which is the joint probability density of the J spike times 0 < u1 < u2 < ... < uJ
T in (0, T]. For any point process model satisfying Eq. 1, this probability density can be expressed in terms of the conditional intensity function (Daley and Vere-Jones 2003
). Similarly, in the discrete time representation, this joint probability density can be expressed in terms of the joint probability mass function of the discretized spike train (see APPENDIX Eqs. A1 and A2) and is expressed here as a product of conditionally independent Bernoulli events (Andersen et al. 1992
; Berman and Turner 1992
; Brillinger 1988
; Brown et al. 2003
)
![]() | (2) |
J) relates to the probability of observing a spike train with 2 or more spikes in any subinterval (tk1, tk]. From Eqs. A3A5 in the APPENDIX, it follows that Eq. 2 can be reexpressed as
![]() | (3) |
, given the spike train observations N1:K, then this probability mass function defines our discrete time point process likelihood function and we denote it as L(
| HK) = P(N1:K |
). From Eq. A6 in the APPENDIX, it can be seen that Eq. 3 is a discrete time approximation to the joint probability density of a continuous time point process.
To develop a computationally tractable and efficient approach to estimating
we note that for any subinterval (tk1, tk], the conditional intensity function is approximately constant so that, by Eq. 3, P(
Nk)=exp{log [
(tk |
, Hk)]
Nk
(tk |
, Hk)
} is given by the Poisson probability mass function. Because
is small, this is equivalent to the Bernoulli probability P(
Nk)=[
(tk |
, Hk)
]
Nk [1
(tk |
, Hk)
]1
Nk in Eq. 2. If we now express the logarithm of the conditional intensity function as a linear combination of general functions of the covariates
![]() | (4) |
, and q is the dimension of the estimated parameter
, then Eq. 3 has the same form as the likelihood function for a GLM under a Poisson probability model and a log link function (see APPENDIX, Eqs. A7A8). Thus, maximum likelihood estimation of model parameters and likelihood analyses can be carried out using the PoissonGLM framework. Alternatively, if we extend the results in Brillinger (1988)
![]() | (5) |
sufficiently small (i.e., at most one spike per time subinterval), likelihood analyses performed with either the Bernoulli or the Poisson model are equivalent. However, because we are interested in modeling the conditional intensity function directly, instead of the probability of events in our discrete time likelihoods, we used the PoissonGLM framework in our analyses. Therefore, we can take advantage of the computational efficiency and robustness of the GLM framework together with all of the analysis tools from the point process theory: goodness-of-fit based on the time rescaling theorem, residual analysis, model selection, and stochastic decoding based on point process observations. We refer to this combined framework as the point processGLM framework. This framework covers a very large class of models because Eq. 4 allows for general functions of the covariates and of interaction terms consisting of combinations of the covariates. An application of GLM analysis to spike train data, without the support of the derived relations between the point process and GLM likelihood functions, would remain purely heuristic in nature.
Finally, Eqs. 2 and 3 are generally applicable discrete time approximations for the point process likelihood function. Thus, when a parametric model of the conditional intensity function cannot be expressed in terms of either Eq. 4 or Eq. 5, the GLM framework may be replaced with standard algorithms for computing maximum likelihood estimates (Pawitan 2001
).
Models for the conditional intensity function
We formulate specific models for the conditional intensity function that incorporate the effects of spiking history, ensemble, and extrinsic covariates. For the exposition in the remainder of this section, we extend our notation to include the neural ensemble activity. Consider an observation time interval t
(0, T] with corresponding sequences of Jc spike times 0 < u1c < ... < ujc < ... < uJcc
T, for c = 1, ..., C recorded neurons. Let N1:K1:C=
c=1C N1:Kc denote the sample path for the entire ensemble.
CONDITIONAL INTENSITY MODELS IN THE POINT PROCESSGLM FRAMEWORK.
The general form for the conditional intensity function we use to model a single cell's spiking activity is
![]() | (6) |
= {
X,
E,
I},
I(tk | N1:k,
I) is the component of the intensity function conditioned on the spiking history N1:k of the neuron whose intensity is being modeled,
E(tk | N1:K1:C,
E) is the component related to the ensemble history contribution, and
X(tk |xk+
,
X) is the component related to an extrinsic covariate xk+
, where
is an integer time shift. Note that the term Hk, used in the previous section, is now replaced by more specific information according to the model. We consider the following specific models for each of these 3 covariate types. We begin with a model incorporating the spiking history component.
The spiking history component is modeled as
![]() | (7) |
n represents the autoregressive coefficients, and
0 relates to a background level of activity. This model is henceforth referred to as the autoregressive spiking history model. We apply Akaike's standard information criterion (AIC, see Eq. 16 below) to estimate the parameter Q. We expect this autoregressive spiking history model to capture mostly refractory effects, recovery periods, and oscillatory properties of the neuron.
The contributions from the ensemble are expressed in terms of a regression model of order R
![]() | (8) |
![]() | (9) |
In our application to MI data, the extrinsic covariate xk+
will specify the hand velocity. To model this component we employ a variation of the Moran and Schwartz (1999)
model, henceforth referred to as the velocity model
![]() | (10) |
| and
k+
are, respectively, the magnitude and angle of the 2-D hand velocity vector in polar coordinates at time tk+
. In this model xk+
=[|Vk+
|,
k+
]'. For illustration purposes, we have considered only a single, fixed-time shift
in the above model. Based on previous results (Paninski et al. 2004
= 150 ms. A much more generic model form including linear or nonlinear functions of covariates at many different time lags could be easily formulated.
The most complex conditional intensity function models we investigate are the autoregressive spiking history plus velocity and ensemble activity, and the autoregressive spiking history plus velocity and ensemble rates models. For the former, the full conditional intensity function model is given by
![]() | (11) |
It should be noticed that although these models are in the "generalized linear" model class, the relation between the conditional intensity function and spiking history, ensemble, and extrinsic covariates can be highly nonlinear. These models are linear only after the transformation of the natural parameter (here the conditional intensity function) by the log link function and only with respect to the model parameters being estimated. As seen in Eq. 4, general functions (e.g., quadratic, cubic, etc.) of the actual measured covariates can be used.
NON-GLM CONDITIONAL INTENSITY FUNCTION MODEL.
To illustrate the generality of the proposed point process framework, we construct and analyze a non-GLM conditional intensity function model that also incorporates effects of spiking history, neural ensemble, and extrinsic covariates. Additionally, this example demonstrates a procedure for obtaining a conditional intensity function by first modeling the interspike interval (ISI) conditional probability density function. The conditional intensity is obtained from the ISI probability density model using the relation (Brown et al. 2003
)
![]() | (12) |
, Hk) is the ISI probability density, specified here by the inhomogeneous inverse Gaussian (Barbieri et al. 2001
![]() | (13) |
. The set of parameters defining the inhomogeneous inverse Gaussian density and therefore the conditional intensity function is denoted
= {
X,
E,
}. This model (Eqs. 12, 13, and A11) is henceforth referred to as the inhomogeneous inverse Gaussian plus velocity and ensemble rates model. The history dependence in this model extends back to the time of the previous, most recent spike. Maximum likelihood parameter estimation
Maximum likelihood parameter estimates for the models in the point processGLM framework were efficiently computed using the iterative reweighted least squares (IRLS) algorithm. This method is the standard choice for the maximum likelihood estimation of GLMs because of its computational simplicity, efficiency, and robustness. IRLS applies the NewtonRaphson method to the reweighted least squares problem (McCullagh and Nelder 1989
). Given the conditional intensity model in Eq. 4, the log-likelihood function is strictly concave. Therefore, if the maximum log-likelihood exists, it is unique (Santner and Duffy 1989
). Confidence intervals and p-values were obtained following standard computations based on the observed Fisher information matrix (Pawitan 2001
). Statistically nonsignificant parameters (e.g. P
0.001) were set to zero for all of the models. In the non-GLM case, the inhomogeneous inverse Gaussian model was fit by direct maximization of the likelihood function using a quasi-Newton method (IMSL, C function min_uncon_multivar, from Visual Numerics, 2001). For the data sets used here, the most intensive computations involved operations on large matrices of size about 106 x 200. Algorithms were coded in C and run on dual-processor 3.9-GHz IBM machines, 2 GB of RAM memory. Standard GLM estimation using IRLS is also available in several statistical packages (S-Plus, SPSS, and Matlab Statistics toolbox).
Goodness-of-fit, point process residual analyses and model comparison
KOLMOGOROVSMIRNOV (K-S) TEST ON TIME RESCALED ISIS.
Before making an inference from a statistical model, it is crucial to assess the extent to which the model describes the data. Measuring quantitatively the agreement between a proposed model and a spike train data series is a more challenging problem than for models of continuous-valued processes. Standard distance measures applied in continuous data analyses, such as average sum of squared errors, are not designed for point process data. One alternative solution to this problem is to apply the time-rescaling theorem (Brown et al. 2002
; Ogata 1988
; Papangelou 1972
) to transform point processes like spike trains into continuous measures appropriate for goodness-of-fit assessment. Once a conditional intensity function model has been fit to a spike train data series, we can compute rescaled times zj from the estimated conditional intensity and from the spike times as
![]() | (14) |
is the maximum likelihood estimate of the parameters. The zj values will be independent uniformly distributed random variables on the interval [0, 1) if and only if the conditional intensity function model corresponds to the true conditional intensity of the process. Because the transformation in Eq. 14 is one to one, any statistical assessment that measures the agreement between the zj values and a uniform distribution directly evaluates how well the original model agrees with the spike train data. To construct the K-S test, we order the zj values from smallest to largest, denoting the ordered values as z(j), and then plot the values of the cumulative distribution function of the uniform density function defined as bj=(j1/2)/J for j = 1, ..., J against the z(j). We term these plots K-S plots. If the model is correct, then the points should lie on a 45° line. Confidence bounds for the degree of agreement between a model and the data may be constructed using the distribution of the KolmogorovSmirnov statistic (Johnson and Kotz 1970To assess how well a model performs in terms of the original ISIs (ISIj=ujuj1), we relate the ISIs to the computed zj values in the following manner. First, the empirical probability density of the zj values is computed, and the ratio of the empirical to the expected (uniform) density is calculated for each bin in the density. Second, the ISI values in the data are rounded to integer milliseconds and collected into bins. For these ISIs, all the corresponding zj values as well as the ratios of empirical to expected densities in the related bins are obtained. This correspondence between ISIs and zj values is easily available from Eq. 14. Third, we compute the mean ratio R (i.e., the mean of all the ratios for this particular ISI value). A mean ratio R > 1 (R < 1) implies that there are more (less) rescaled ISIs of length zj than expected and that the intensity is being underestimated (overestimated), on average, at this particular ISI value.
If the model is correct, the zj values should be not only uniformly distributed, but also independent. Thus, even when the K-S statistic is small, we still need to show that the rescaled times are independent. Here we assess independence up to 2nd-order temporal correlations by computing the autocorrelation function of the transformed rescaled times. As a visualization aid, we plot zj+1 against zj.
POINT PROCESS RESIDUAL ANALYSIS.
A standard approach in goodness-of-fit analysis is to examine structure in the data that is not described by the model. For continuous valued data, this is done by analyzing the residual error (i.e., the difference between the true and predicted values). For point process data, a different definition of residuals is needed to relate the conditional intensity function to the observed spike train data. The point process residual (Andersen et al. 1992
) over nonoverlapping moving time windows is defined as
![]() | (15) |
1. In the application to MI data, we will look for relations between the point process residual and motor covariates (e.g., speed or direction) by computing their cross-correlation functions. Existence of correlations would imply that there is some structure left in the residuals that is not captured by the conditional intensity function model.
MODEL SELECTION.
An additional tool for comparing models comes from the statistical theory of model selection (Burnham and Anderson 2002
). The idea consists of choosing the best models to approximate an underlying process generating the observed data, a process whose complexity can be potentially infinite dimensional. To achieve this goal, we adopt Akaike's standard information criterion (AIC) (Akaike 1973
). This criterion also provides a way to rank different candidate models. The AIC was originally derived as an estimate of the expected relative KullbackLeibler distance (Cover and Thomas 1991
) between a distribution given by an approximating model and the distribution of the true underlying process generating the data. This criterion is formulated as
![]() | (16) |
| HK) is the likelihood function, L(
| HK) = P(N1:K |
, HK);
is the maximum likelihood estimate of the model parameters
; and q is the total number of parameters in the model. By this criterion, the best model is the one with the smallest AIC, implying that the approximate distance between this model and the "true process" generating the data is smallest. The AIC is frequently interpreted as a measure of the trade-off between how well the model fits the data and the number of parameters required to achieve that fit, or of the desired trade-off between bias and variance (Burnham and Anderson 2002Neural decoding analysis by state estimation with point process observations
Beyond assessing the goodness-of-fit of a single cell model with respect to its individual spike train data, we also analyze the ability of the model, over the entire cell population, to decode an m-dimensional extrinsic covariate xk+
. Such decoding will use the spike times of the entire ensemble of cells and the corresponding conditional intensity function for each of these cells. We thus perform a state estimation of xk based on point process observations and thereby assess the ensemble coding properties of the cell population. The estimated extrinsic covariate will be given by the posterior mode after a Gaussian approximation to the BayesChapmanKolmogorov system (Eden et al. 2004
).
For the particular type of hand kinematics data described above, we model xk as a Gaussian autoregressive process of order 1, henceforth AR(1), given by
![]() | (17) |
k is the noise term given by a zero mean m-dimensional white Gaussian vector with m x m covariance matrix W
. The matrices F and W
are fitted by maximum likelihood.
The point process observation equation is expressed in terms of the modeled conditional intensity functions
c(tk | · ) for each of the C cells entering the decoding. As an example, for intensity functions conditioned on a motor covariate xk+
and intrinsic spiking history N1:kC, we have the following recursive point process filter.One step prediction
![]() | (18) |
![]() | (19) |
![]() | (20) |
![]() | (21) |
(
2) denotes the m-dimensional vector (m x m matrix) of first (second) partial derivatives with respect to xk+
, and Wk+
|k+
is the posterior covariance matrix of xk+
. Similarly, decoding equations based on other models of the conditional intensity function can be obtained. The derivation of the recursive point process filter is based on the well-established (Mendel 1995
The amount of uncertainty in the algorithm about the true state of the decoded parameter is related to the matrix Wk+
|k+
. Confidence regions and coverage probability for the decoding can thus be obtained as follows. At time k
t an approximate 0.95 confidence region for the true covariate xk+
may be constructed as
![]() | (22) |
0.952(m) gives the 0.95 quantile of the
2 distribution with degrees of freedom equal to the dimension m of the covariate. The coverage probability up to time tk is given by sk/k where sk is the number of times the true covariate is within the confidence regions during the time interval (0, k
]. In the decoding analysis we compute the mean of the coverage probability over the entire decoding period. A Monte Carlo simulation is employed to obtain the confidence intervals and coverage probability for the covariate in polar coordinates. We first use the estimated posterior covariance matrix to generate 104 Gaussian-distributed samples centered at the current covariate estimates in Cartesian coordinates. Second, these random samples are converted to polar coordinates. Finally, the confidence intervals are then computed from the distribution of the random samples in polar coordinates. |
|
RESULTS |
|---|
|
= 1 ms. Simulation study
The goal of the simulation study is 2-fold. First, we illustrate the main properties of the model in Eq. 11 containing the autoregressive history, neural ensemble history, and motor covariate effects. Second, we demonstrate that the parameters of the simulated model are accurately recovered from relatively small spike data sets by maximum likelihood estimation implemented with the IRLS algorithm.
The conditional intensity functions of 6 neurons (A, B, C, D, E, F) were simulated using methods as described in Ogata (1981)
. The intensity of 5 of them (BF) was given by the velocity model (Eq. 10); that is, the neurons were modeled as inhomogeneous Poisson processes with mean background spiking rates of 17, 16, 9, 8, and 7 Hz, respectively, and inhomogeneity introduced by the modulating hand velocity signal. Different velocity tuning functions were used for the set of cells. The hand velocity signal was sampled from actual hand trajectories performed by a monkey (see Application to MI spiking data, below). The conditional intensity function for neuron A was given by the autoregressive spiking history plus ensemble and velocity model (Eq. 11). The background mean firing rate of this neuron was set to 10 Hz. The autoregressive spiking history component contained 120 coefficients covering 120 ms of spiking history (see Fig. 2B). The autoregressive coefficients mimicked the effects of refractoryrecovery periods and rebound excitation. From the ensemble of 5 neurons, only 2 contributed excitatory (neuron B) and inhibitory (neuron C) effects at 3 time lags (1, 2, and 3 ms).
|
The main features of the conditional intensity function model in Eq. 11 can be observed in Fig. 1, where the simulated conditional intensity function of neuron A and its own spiking activity are plotted together with the activity of the other 5 neurons and the contribution of velocity signal. The simulated conditional intensity function clearly shows the dependence on spike history: after a spike, the intensity drops to almost zero and slowly recovers, reaching a period of higher than background spiking probability at about 20 ms after the spike. Fast excitatory and inhibitory effects follow the spikes of neurons B and C. Spiking history, neural ensemble, and velocity modulate each other's contributions in a multiplicative fashion.
|
Application to MI spiking data
Experimental data were obtained from the MI area of a behaving monkey. Details of the basic recording hardware and protocols are available elsewhere (Donoghue et al. 1998
; Maynard et al. 1999
). After task training, a Bionic Technologies LLC (BTL, Salt Lake City, UT) 100-electrode silicon array was implanted in the area of MI corresponding to the arm representation. One monkey (M. mulatta) was operantly conditioned to track a smoothly and randomly moving visual target. The monkey viewed a computer monitor and gripped a 2-link, low-friction manipulandum that constrained hand movement to a horizontal plane. The hand (x, y) position signal was digitized and resampled to 1 kHz. Low-passfiltered finite differences of position data were used to obtain hand velocities. Some 130 trials (89 s each) were recorded. More details about the statistical properties of the distributions for hand position and velocity, spiking sorting methods, and other task details can be found in Paninski et al. (2004)
.
Models including 1, 2, or all of the 3 types of covariates were analyzed. To start, we focus on the analysis of the velocity and the autoregressive spiking history plus velocity models. Later, we also compare these 2 models using neural decoding based on the observation of the entire ensemble of cells. For this reason, we analyzed these 2 models for each of the 20 cells in the ensemble. More detailed analysis involving K-S plots, point process residuals, and AIC model comparison will be illustrated for one typical cell.
K-S GOODNESS-OF-FIT ANALYSIS FOR THE VELOCITY AND THE AUTOREGRESSIVE SPIKING HISTORY PLUS VELOCITY MODELS. The tuning functions obtained from the velocity model (Eq. 10) are shown in Fig. 3. This model was statistically significant for all of the cells. Preferred direction was diverse across cells, covering the range of possible directions. The corresponding K-S plots are shown in Fig. 4. The quantiles refer to the z(j)s (Eq. 14) and the cumulative distribution function (CDF) refers to the expected uniform distribution for the case when the estimated conditional intensity model was equivalent to the true one. The velocity model tends to overestimate (underestimate) the conditional intensity at lower (middle) quantiles. Introduction of the autoregressive spiking history component (Eq. 7) in the velocity model greatly improved the explanation of the spiking process, almost completely eliminating both the over- and underestimation of the intensity. The maximum order of the autoregressive component was about 120 (i.e., the component incorporated history effects spanning over 120 ms in the past). The most significant history effects extended to 60 ms in the past. For the majority of the cells, this component seemed to capture mostly 3 main history effects: refractory and recovery periods followed by an increase in the firing probability around 20 ms after a spike (see Fig. 5B). It should be noticed that the autoregressive coefficients could have also reflected dynamical network properties of nonmeasured neural ensembles such as networks of excitatory and inhibitory neurons where the modeled cell is embedded, or nonmeasured fast extrinsic covariates. No significant differences in the K-S plots were observed between a pure autoregressive history model and the autoregressive history plus velocity models (not shown).
|
|
|
1,040 s) in this example set and relate the fitting problems of the velocity model to the original nontime rescaled ISIs. In the velocity model, the intensity is overestimated (mean ratio R < 1) for ISIs below 10 ms and underestimated (mean ratio R > 1) for ISIs in the interval 10 to about 40 ms (Fig. 5D). The overestimation is likely a reflection of a refractoryrecovery period (up to
10 ms) after the cell has spiked, which is not captured by the velocity model. The underestimation reflects a period of increased firing probability that follows the recovery period. These 2 different regimes are reasonably well captured by the coefficients of the autoregressive component (see Fig. 5B), thus resulting in the improved fit observed for the autoregressive spiking history plus velocity model. Introduction of the autoregressive component makes the observed density for the zj values much closer to the expected uniform density (Fig. 5C). The K-S statistic measures how close rescaled times are to being uniformly distributed on [0, 1). In addition, a good model should also generate independent and identically distributed rescaled times. To illustrate this point, we checked for temporal correlations at lag 1 in the time-rescaled ISIs (Fig. 6). As expected, some temporal structure remains in the case of the velocity model (r2 = 0.25, P = 106), whereas this structure is effectively insignificant for the velocity plus autoregressive spiking history (r2 = 0.002, P = 106). The cross-correlation function computed over a broad range of lags was consistent with this result.
|
We computed the correlations for the residuals from the autoregressive spiking history model (Eq. 7) and compared them to the correlations for the residuals from the velocity and from the autoregressive spiking history plus velocity model. Residuals were computed for nonoverlapping 200-ms moving windows (Fig. 7). Cross-correlation functions were computed between the residuals and the mean of the kinematic variables. Mean (x, y) velocities were computed for each time window and were used to obtain, in polar coordinates, the respective mean movement speed and direction. In the autoregressive model case, peak cross-correlation values between the residuals and direction, speed, and velocities in x and y coordinates were 0.29, 0.10, 0.17, and 0.50, respectively. For the autoregressive spiking history and velocity model, the peak cross-correlation values for the same variables were 0.08, 0.06, 0.12, and 0.28. This suggests that, for this particular neuron, the velocity model captures a significant amount of information about hand velocity available in the spiking activity. Nonetheless, it is also clear that there is a residual structure in the spiking activity that is statistically related to the hand velocity in Cartesian coordinates and that is not captured by the autoregressive spiking history plus velocity model. Furthermore, the cross-correlation functions for both the velocity and the autoregressive spiking history plus velocity model show no significant differences, which suggests that the autoregressive component does not carry additional statistical information about hand velocity.
|
|
|
VELOCITY AND MOVEMENT DIRECTION DECODING ANALYSIS.
The velocity (Eq. 10) and the autoregressive spiking history plus velocity models were used in the neural decoding of hand velocity. Models were fit to a training data set (120 trials, about 89 s each) and applied to decoding on a different test data set (10 trials, again about 89 s each). The state matrix F for the AR(1) state process (Eq. 17) was estimated to be diagonal with nonzero terms approximately equal to 0.99, and the noise covariance matrix W
to be diagonal with nonzero entries equal to 0.01. Figure 10 shows the resulting decoding of movement direction and, in Cartesian coordinates, the estimated (x, y) velocities for a single test trial based on the velocity model. Overall, decoding of movement direction was remarkably good. Decoded (x, y) velocities captured mostly slower fluctuations. To compare the decoding performance of the 2 models, we computed the coverage probability and the decoding error. Table 1 gives the mean values (across time and trials) for the coverage probabilities of the bivariate estimate (velocity magnitude and movement direction) and the coverage probabilities of the univariate estimate (velocity magnitude or movement direction). Mean coverage probability for the movement direction estimate was 0.94 for the velocity model. For the same model, coverage probabilities for the bivariate estimate and velocity magnitude were much smaller, consistent with the observation that the estimated velocities in Cartesian coordinates captured mostly slow fluctuations. Mean coverage probability, mean and median decoding errors, and confidence intervals for the decoding errors were not significantly different between the 2 models.
|
|
|
|
DISCUSSION |
|---|
|
Analyses that measure the simultaneous effects of different covariates are crucial because the covariates modulate the neural spiking activity at the same time. Currently used analysis methods do not allow for the modeling of the simultaneous effects of spiking history, neural ensemble, and extrinsic covariates on the spike train treated as a point process. To evaluate the relation between spiking activity and covariates, the spike train data are frequently transformed to a rate function and the relation between the rate function and the covariate is then assessed using regression methods (e.g., Ashe and Georgopoulos 1994
; Luczak et al. 2004
). The relation between a neuron's spiking activity, spiking history, and concurrent neural activity are usually assessed using autocorrelation and pairwise cross-correlation analyses performed directly on the spike train (e.g., Hatsopoulos et al. 1998
). The use of different methods to assess individually the importance of these covariates precludes an analysis of the neural point process in which the relative importance of all covariates is assessed and may also lead to a misleading estimate of the covariate effects. For example, spiking history effects can interfere with the accurate estimation of extrinsic covariate effects in spike triggered averages and reverse correlation methods (Aguera y Arcas and Fairhall 2003
; Aguera y Arcas et al. 2003
). Additionally, current analysis techniques also assess the contribution of ensemble covariates separately. For instance, pairwise cross-correlation analyses measure the statistical association of a single neuron to each member of the ensemble separately but not the association between the single neuron's activity and the entire observed ensemble.
The key to our likelihood approach is representing the conditional intensity function of a single neuron in terms of the covariates. In this way, the covariates are directly related to the probability that the neuron spikes. Although this formulation can be used generally to analyze the relation between covariates and neural spiking activity, it usually requires writing a new algorithm or function to carry out the maximum likelihood estimation with each new model formulation. To make our point process likelihood approach more broadly applicable, we showed that by representing the logarithm of the conditional intensity function as a linear combination of general functions of the covariates, the conditional intensity function model could be efficiently fit to neural spike train data using the GLM framework under a Poisson distribution and a log link function (Eqs. 3, A6, and A8). We also showed that, equivalently, if the point process is represented as a conditionally dependent Bernoulli process (Eqs. 2 and A2) and the probability of the events is modeled by a logistic function, then the point process model could also be fit using the GLM framework under a Bernoulli distribution and a logistic link function (Eqs. 5 and A10). Regarding the time discretization, we note that the 1-ms discretization interval we chose should not be interpreted as the absolute discretization interval for all applications of the point processGLM framework. How fine the discretization interval should be will depend on the particular problem under study.
Our use of the Poisson distribution to fit point process models does not mean that we are assuming that our original data are Poisson. We are rather exploiting for computational purposes the fact that all point process likelihoods that admit a conditional intensity function, including those that are history dependent, have the same mathematical form given by Eq. A6. Our analysis makes explicit the relation between likelihood methods for point processes, conditional Bernoulli processes, and GLM model fitting with Poisson or Bernoulli distributions. This relation provides a justification for using this GLM framework to analyze spike trains as point process data.
The point processGLM framework for analyzing neural spike train data has several important advantages. First, this framework allows us to formulate complex models to relate the spiking activity to covariates. The fact that Eq. 4 is written in terms of general functions of the covariates provides the framework with a very large class of possible models. Second, the GLM framework is part of several standard mathematical and statistical packages (e.g., Splus, Matlab, SPSS), so that the approach is readily accessible to experimentalists analyzing their data. Even though likelihood-based methods are highly desirable because of several optimality properties, the biggest impediment to their widespread use is the lack of readily available software in which a flexible class of neural spike train models can be easily applied to data. The point processGLM framework offers a practical, broadly applicable solution to the computational problem of fitting potentially complex point process models for neural spike trains by maximum likelihood.
Third, the point processGLM framework makes it possible to apply a set of goodness-of-fit tools for point processes not available in the GLM. These are the point process residuals analysis, goodness-of-fit tests based on the time-rescaling theorem, and decoding from point process observations. Fourth, the model selection and goodness-of-fit methods available in GLM are extended to spike train data. Thus we have a set of complementary methods to assess the extent to which proposed models explain the structure in neural spike trains. Although we used the point processGLM framework to carry out most of the analysis, we also illustrated with the conditional intensity function based on the inhomogeneous inverse Gaussian model how non-GLM point process likelihood models may be used to analyze neural spike train data. Finally, by analogy with the way in which linear regression methods are used to analyze the relation between a continuous dependent variable and a set of candidate explanatory variables, the ready availability of software to implement GLMs also makes it possible for neurophysiologists to quickly assess the relevance of a wide range of covariates before proceeding to construct more specific models that may require non-GLM algorithms to carry out the model fitting.
A key objective of the proposed framework is to provide tools for the assessment of the relative importance of the covariates on neural spiking activity. We showed how this objective is accomplished by analyzing the goodness-of-fit of each model we proposed. Because no method provides a complete assessment of goodness-of-fit, we used the standard statistical approach of using multiple complementary measures that evaluate different aspects of the model's agreement with the data. We applied 4 complementary types of goodness-of-fit techniques in our example data set: KolmogorovSmirnov tests based on the time-rescaling theorem, model selection by AIC, point process residual analysis, and neural spike train decoding based on point process observations.
First, the K-S analyses performed on the example data problems were useful in providing a sense of how close our models were to capturing the stochastic structure in the example data sets. The fact that some of our models captured most of the statistical structure in the spiking activity (Figs. 4 and 8) suggests that developing a parsimonious statistical model of MI activity is a realistic goal. The K-S plots also highlighted the importance of the spiking history. The fact that the coefficients had a structure that seemed to reflect mostly refractory and recovery periods together with rebound excitation in short time scales (effectively shorter than 60 ms) suggests that the autoregressive component successfully captured important history effects.
Second, the AIC analysis provided additional information for model comparison when the K-S plots did not distinguish between different models. By finely ranking the different models, the AIC analysis allowed for the assessment of the distinct effects and relative importance of the 3 types of covariates. Our choice of the AIC for model comparison was motivated by the fact that AIC was derived to be an estimate of the expected relative KullbackLeibler distance between the distributions generated by the model and the distribution of the underlying stochastic process generating the data. The "true" underlying model does not need to be in the set of tested models for the AIC analysis to suggest the most appropriate model, a situation that we believe is more often the rule than the exception in biology. Because the AIC is penalized with increasing numbers of model parameters, its use is more appropriate than the use of the data likelihood itself in preventing overfitting of the data by the model. Additionally, an equivalence between AIC and cross-validation in model comparison problems has been established (Stone 1977
), and model-based penalty methods (e.g., AIC) outperform cross-validation in important aspects when assessing prediction performance (Efron 2004
). We also computed the Bayesian information criterion (BIC) (Schwarz 1978
), an alternate, more conservative criterion function for each of our models and found that it yielded the same model rankings as did the AIC. When comparing complex models, another protection against overfitting comes from having large quantities of data as compared to the number of model parameters. In our example the >106 data observations far outnumbered the maximum 200 or so parameters in our most complex models. Apparent inconsistencies between AIC and K-S analyses could occur in cases where, for example, the conditional intensity model is more likely to produce the observed spike train as a whole, but is less accurate in describing a specific aspect of the data structure, such as the regime of small ISIs. This might have been the case when comparing the AIC and K-S plots results for the autoregressive spiking history plus velocity and ensemble model and a simpler autoregressive spiking history plus velocity model (Figs. 8 and 9).
Third, we illustrated how the point process residual analysis can be used to assess the contribution of an extrinsic covariate to a single neuron's spiking activity. In the illustration example, the residual analysis showed that the introduction of the velocity covariate captured a significant amount of the statistical structure related to hand velocity available in the spiking activity of a single neuron. Yet, for the particular cell chosen in this study, the analysis was also able to reveal that there still was a significant amount of structure in the residuals that was correlated to hand velocity but that was not captured by this specific form of the velocity model. Cross-correlation analysis of the point process residuals and extrinsic covariates is thus an important tool for assessing whether a particular model has captured well the effects of the covariate on the spiking activity. The ideal model should produce a residual with no significant correlations to the modeled covariate. It should also be noted that, unlike the decoding analysis, the point process residual analysis is not dependent on the properties of a decoding algorithm.
Fourth, complementing the above 3 goodness-of-fit analysis tools, the spike train decoding allowed for the goodness-of-fit assessment at the neural ensemble level. In conjunction with understanding what makes a neuron spike, we are also interested in assessing how well a model captures the representation of an extrinsic covariate at the ensemble level. At present, decoding is the only technique we have for assessing goodness-of-fit at this level. The key elements for assessing goodness-of-fit in the decoding analysis were the predicted signal and its confidence intervals and coverage probability, and especially the estimation error and its confidence intervals. The confidence intervals and the coverage probability based on the estimated posterior covariance matrix provided an estimate of the amount of uncertainty in the decoding algorithm, whereas the decoding error and its distribution provided a measure of the algorithm's actual performance. For this reason, the mean coverage probability should be interpreted in conjunction with the mean decoding error. As suggested by the narrow distribution of the decoding error and approximately 0.95 mean coverage probability (Table 1), hand movement direction was remarkably well decoded. Velocity estimates in Cartesian coordinates captured reasonably well slow fluctuations in the measured hand velocity. We also illustrated how to assess the contribution of the autoregressive spiking history component to neural decoding. The autoregressive spiking history plus velocity and the velocity models performed similarly well. This preliminary result suggests that short time dynamics captured by the autoregressive component did not play a crucial role in decoding hand velocity or movement direction in this data set. Given that the models used in the decoding analysis did not include the ensemble or ensemble rates covariate, the ensemble decoding assumed independent encoder cells. Nonetheless, the framework also allows the assessment of the contribution of interaction patterns in the neural ensemble to decoding. That could be easily achieved by extending the conditional intensity models to include the ensemble covariates. This analysis is beyond the scope of this paper and will be addressed elsewhere.
In summary, the above 4 complementary goodness-of-fit and model selection analyses are an essential step for achieving our primary objective of assessing the effects and relative importance of the modeled covariates. The proposed point process framework provides a starting point for building and analyzing complex models of spiking activity including the 3 types of covariates discussed in this paper. In particular, the point processGLM framework provides a systematic approach to neural spike train data analysis analogous to that for continuous-valued variables under the linear Gaussian regression framework.
We foresee several potential improvements and extensions of this framework. Although we were able to fit models with hundreds of parameters, much larger models will require the development of efficient algorithms for both GLM and non-GLM computations. Also, to analyze the relation between the simultaneous firing of an entire ensemble relative to its spiking history and a set of extrinsic covariates, we can extend the framework by using multivariate point process likelihoods (Chornoboy et al. 1988
). A multivariate likelihood model will facilitate the study of the independence, redundancy, and synergy in the ensemble representation. Finally, multielectrode devices (Csicsvari et al. 2003
; Donoghue 2002
; Nicolelis et al. 2003
) now make possible the simultaneous recordings of multiple single cells from many different brain areas. We foresee the proposed framework as a valuable tool for investigating how interacting brain regions represent, compute, and process information. We are currently applying this framework to the analysis of parietal and MI spiking activity in monkeys performing visuomotor tracking tasks and hippocampus activity in rats performing a range of learning tasks.
|
|
APPENDIX |
|---|
|
The likelihood of a neural spike train, like that of any statistical model, is defined by finding the joint probability density of the data. We show below that the joint probability of any point process is easy to derive from the conditional intensity function. We show that the point process likelihood function in Eqs. 2 and 3 gives a discrete time approximation of the likelihood function for a continuous time point process (Eq. A6 below).
Let 0 < u1 < u2, ..., uJ < T be a set of neural spike train measurements. Using the discrete time representation given in the METHODS section, define the events
![]() |
![]() |
![]() | (A1) |
(tkj1, tkj], j = 1, ..., J, for a subset of the intervals satisfying k1 < k2 < ... < kj. The remaining K J intervals have no spikes.
The probability of exactly J events occurring within the intervals (tkj1, tkj]j=1J in (0, T], may then be computed as
![]() |
![]() | (A2) |
The spike train thus forms a sequence of conditionally independent Bernoulli trials, with the probability of a spike in the kth time interval given by P(Ak). In any interval (tk1, tk] we have
![]() |
![]() | (A3) |
![]() | (A4) |
, [1
(tk)
]
exp{
(tk)
} andlog [
(tk)
[1
(tk)
]1]
log (
(tk)
), therefore we obtain
![]() | (A5) |

0 P(N1:K)/
J, is then obtained as
![]() | (A6) |
is sufficiently small. The Poisson and BernoulliGLMs
We briefly define a generalized linear model and show that for small enough
, the Bernoulli and PoissonGLMs are equivalent in the modeling of spiking train data.
Two main aspects characterize a generalized linear model of a random variable y (McCullagh and Nelder 1989
). First, the modeled random variable y has a distribution in the exponential family. Among several members of this family are the Gaussian, the Poisson, and the Bernoulli distribution. The exponential family has the general form
![]() | (A7) |
is known, this is an exponential-family model with canonical parameter
.
For the particular case of the Poisson distribution,
= log
, b(
) = e
, a(
) =
= 1, c(y,
) = log (y!). The location and scale parameters are
and
, respectively. Thus the distribution in Eq. A7 can be expressed as f(y |
)=exp{y log
log (y!)}=
ye
/y!. Note that the canonical parameter
has, in the Poisson case, a natural representation in terms of the logarithm of the parameter
. The joint probability distribution for an independently distributed data set y = {yk}k=1K becomes
![]() | (A8) |
k of this Poisson process is generalized by the conditional intensity function (Eq. 1); and yk =
Nk,
= 1, then Eq. A8 has the same form as the typical general likelihood function for any discrete time point process (Eqs. 3 and A5).
For the Bernoulli case, we let y = {0, 1} with the probability of success denoted by P, and set
= log ([1 P]1P), b(
) = log(1 + e
), a(
) =
, c( · ) = 1, and
= 1. Thus, for single realizations we have p(y | P) = Py(1 P)1y. Given an independently distributed data set y = {yk}k=1K, the likelihood function under the Bernoulli distribution becomes
![]() | (A9) |
Nk we obtain Eq. A2.
Second, the defining feature of a generalized linear model follows. The canonical parameter of the exponential family is expressed in a linear form by a transformation given by a monotonic differentiable function. In the Poisson case, if the canonical parameter is modeled as a linear combination of general functions of covariates v of interest (that is,
= log
(
, v) =
i=1q
igi (vi) as in Eq. 4 or equivalently as
(
, v) = exp{
i=1q
igi(vi)} as in Eqs. 510), then f(y |
,
)
exp{y log
(
, v)
(
, v)} gives the distribution for a GLM under a Poisson distribution and a log link function. In the Bernoulli case, if
= log ([1 P(Ak |
, Hk)]1P(Ak |
, Hk)) is modeled as linear combination of general functions of the covariates, then Eqs. 2 and A2 give the likelihood function for a GLM under a Bernoulli distribution and a logistic link function.
Finally, we establish the relation between the Poisson and BernoulliGLMs in the context of neural point process models. After making explicit the parametric model of the conditional intensity function, we have the probability of a spike event in the time interval (tk1, tk] given by P(Ak |
, Hk) =
(tk |
, Hk)
+ o(
). For small
![]() | (A10) |
, the Bernoulli and PoissonGLMs are equivalent when applied to the modeling of spiking train data. The IIG model for the ISI probability density
For a particular cell, let te=tkuNk1 denote the time elapsed since the last spike uNk1. The inhomogeneous inverse Gaussian ISI probability density function conditioned on the motor covariate and neural ensemble activity is defined as
![]() | (A11) |
, N1:k1:C,
},
> 0 is the location parameter and s(tk | · ) > 0 is the scaling parameter at time tk, conditioned on the extrinsic and ensemble rates covariates as given in Eq. 13. |
|
GRANTS |
|---|
|
|
|
DISCLOSURE |
|---|
|
|
|
FOOTNOTES |
|---|
Address for reprint requests and other correspondence: W. Truccolo, Neuroscience Department, Brown University, 190 Thayer St., Providence, RI (E-mail Wilson_Truccolo{at}Brown.edu)
|
|
REFERENCES |
|---|
|
Aguera y Arcas B, Fairhall AL, and Bialek W. Computation in a single neuron: Hodgkin and Huxley revisited. Neural Comput 15: 17151749, 2003.[CrossRef][Web of Science][Medline]
Akaike H. Information theory as an extension of the maximum likelihood principle. In: Second International Symposium on Information Theory, edited by Petrov BN and Csaki F. Budapest: Akademiai Kiado, 1973, p. 267281.
Andersen PK, Borgan O, Gill RD, and Keiding N. Statistical Models Based on Counting Processes. New York: Springer-Verlag, 1992.
Ashe J and Georgopoulos AP. Movement parameters and neural activity in motor cortex and area-5. Cereb Cortex 4: 590600, 1994.
Barbieri R, Quirk MC, Frank LM, Wilson MA, and Brown EN. Construction and analysis on non-Poisson stimulus-response models of neural spiking activity. J Neurosci Methods 105: 2537, 2001.[CrossRef][Web of Science][Medline]
Berman M and Turner TR. Approximating point process likelihoods with GLIM. Appl Stat 41: 3138, 1992.[CrossRef]
Brillinger DR. Maximum likelihood analysis of spike trains of interacting nerve cells. Biol Cybern 59: 189200, 1988.[CrossRef][Web of Science][Medline]
Brown EN, Barbieri R, Eden UT, and Frank LM. Likelihood methods for neural data analysis. In: Computational Neuroscience: A Comprehensive Approach, edited by Feng J. London: CRC, 2003.
Brown EN, Barbieri R, Ventura V, Kass RE, and Frank LM. The time-rescaling theorem and its application to neural spike train data analysis. Neural Comput 14: 3252346, 2002.[CrossRef][Web of Science][Medline]
Burnham KP and Anderson DR. Model Selection and Multimodel Inference: A Practical Information Theoretic Approach (2nd ed.). New York: Springer-Verlag, 2002.
Chornoboy ES, Schramm LP, and Karr AF. Maximum likelihood identification of neural point process systems. Biol Cybern 59: 265275, 1988.[CrossRef][Web of Science][Medline]
Cover TM and Thomas JA. Elements of Information Theory. New York: Wiley, 1991.
Csicsvari J, Henze DA, Jamieson B, Harris KD, Sirota A, Bartho P, Wise KD, and Buzsaki G. Massively parallel recording of unit and local field potentials with silicon-based electrodes. J Neurophysiol 90: 13141323, 2003.
Daley D and Vere-Jones D. An Introduction to the Theory of Point Processes. New York: Springer-Verlag, 2003.
Donoghue JP. Connecting cortex to machines: recent advances in brain interfaces. Nat Neurosci 5: 10851088, 2002.
Donoghue JP, Sanes JN, Hatsopoulos NG, and Gaal G. Neural discharge and local field potential oscillations in primate motor cortex during voluntary movements. J Neurophysiol 79: 159173, 1998.
Eden UT, Frank LM, Barbieri R, Solo V, and Brown EN. Dynamic analysis of neural encoding by point process adaptive filtering. Neural Comput 16: 971998, 2004.[CrossRef][Web of Science][Medline]
Efron B. The estimation of prediction error: Covariance penalties and cross-validation. J Am Stat Assoc 99: 619632, 2004.[CrossRef][Web of Science]
Frank LM, Eden UT, Solo V, Wilson MA, and Brown EN. Contrasting patterns of receptive field plasticity in the hippocampus and the entorhinal cortex: an adaptive filtering approach. J Neurosci 22: 38173830, 2002.
Fu QG, Flament D, Coltz JD, and Ebner TJ. Temporal encoding of movement kinematics in the discharge of primate primary motor and premotor neurons. J Neurophysiol 73: 836854, 1995.
Grammont F and Riehle A. Precise spike synchronization in monkey motor cortex involved in preparation for movement. Exp Brain Res 128: 118122, 1999.[CrossRef][Web of Science][Medline]
Grammont F and Riehle A. Spike synchronization and firing rate in a population of motor cortical neurons in relation to movement direction and reaction time. Biol Cybern 88: 360373, 2003.[CrossRef][Web of Science][Medline]
Hatsopoulos NG, Ojakangas CL, Paninski L, and Donoghue JP. Information about movement direction obtained from synchronous activity of motor cortical neurons. Proc Natl Acad Sci USA 95: 1570615711, 1998.
Hatsopoulos NG, Paninski L, and Donoghue JP. Sequential movement representations based on correlated neuronal activity. Exp Brain Res 149: 478486, 2003.[CrossRef][Web of Science][Medline]
Hille B. Ion Channels of Excitable Membrane (3rd ed.). Sunderland, MA: Sinauer Associates, 2001.
Jackson A, Gee VJ, Baker SN, and Lemon RN. Synchrony between neurons with similar muscle fields in monkey motor cortex. Neuron 38: 115125, 2003.[CrossRef][Web of Science][Medline]
Johnson A and Kotz S. Distributions in Statistics: Continuous Univariate Distributions. New York: Wiley, 1970.
Kass RE and Ventura V. A spike-train probability model. Neural Comput 13: 17131720, 2001.[CrossRef][Web of Science][Medline]
Keat J, Reinagel P, Reid RC, and Meister M. Predicting every spike: a model for the responses of visual neurons. Neuron 30: 803817, 2001.[CrossRef][Web of Science][Medline]
Kitagawa G and Gersh W. Smoothness Priors Analysis of Time Series. New York: Springer-Verlag, 1996.
Knierim JJ and Vanessen DC. Neuronal responses to static texture patterns in area-V1 of the alert macaque monkey. J Neurophysiol 67: 961980, 1992.
Luczak A, Hackett TA, Kajikawa Y, and Laubach M. Multivariate receptive field mapping in marmoset auditory cortex. J Neurosci Methods 136: 7785, 2004.[CrossRef][Web of Science][Medline]
Maynard EM, Hatsopoulos NG, Ojakangas CL, Acuna BD, Sanes JN, Normann RA, and Donoghue JP. Neuronal interactions improve cortical population coding of movement direction. J Neurosci 19: 80838093, 1999.
McCullagh P and Nelder JA. Generalized Linear Models (2nd ed.). Boca Raton, FL: Chapman & Hall/CRC, 1989.
Mehta MR, Barnes CA, and McNaughton BL. Experience-dependent, asymmetric expansion of hippocampal place fields. Proc Natl Acad Sci USA 94: 89188921, 1997.
Mehta MR, Quirk MC, and Wilson MA. Experience-dependent asymmetric shape of hippocampal receptive fields. Neuron 25: 707715, 2000.[CrossRef][Web of Science][Medline]
Mendel JM. Lessons in Estimation Theory for Signal Processing, Communications, and Control. Englewood Cliffs, NJ: Prentice Hall, 1995.
Moran DW and Schwartz AB. Motor cortical representation of speed and direction during reaching. J Neurophysiol 82: 26762692, 1999.
Nicolelis MA, Dimitrov D, Carmena JM, Crist R, Lehew G, Kralik JD, and Wise SP. Chronic, multisite, multielectrode recordings in macaque monkeys. Proc Natl Acad Sci USA 100: 1104111046, 2003.
Ogata Y. On Lewis' simulation method for point processes. IEEE Trans Inform Theory IT-27: 2331, 1981.[CrossRef]
Ogata Y. Statistical models for earthquake occurrences and residual analysis for point processes. J Am Stat Assoc 83: 927, 1988.[CrossRef][Web of Science]
O'Keefe J and Dostrovsky J. The hippocampus as a spatial map. Preliminary evidence from unit activity in the freely-moving rat. Brain Res 34: 171175, 1971.[CrossRef][Web of Science][Medline]
O'Keefe J and Recce ML. Phase relationship between hippocampal place units and the EEG theta rhythm. Hippocampus 3: 317330, 1993.[CrossRef][Web of Science][Medline]
Paninski L, Fellows MR, Hatsopoulos NG, and Donoghue JP. Spatiotemporal tuning of motor neurons for hand position and velocity. J Neurophysiol 91: 515532, 2004.
Papangelou F. Integrability of expected increments of point processes and a related change of scale. Trans Am Math Soc 165: 483506, 1972.[CrossRef]
Pawitan Y. In All Likelihood: Statistical Modeling and Inference Using Likelihood. London: Oxford Univ. Press, 2001.
Sanes JN and Truccolo W. Motor "binding": do functional assemblies in primary motor cortex have a role? Neuron 38: 35, 2003.[CrossRef][Web of Science][Medline]
Santner TJ and Duffy DE. The statistical analysis of discrete data. New York: Springer-Verlag, 1989.
Schwarz G. Estimating the dimension of a model. Ann Stat 6: 461464, 1978.[CrossRef]
Scott SH. The role of primary motor cortex in goal-direction movements: insights from neurophysiological studies on non-human primates. Curr Opin Neurobiol 13: 671677, 2003.[CrossRef][Web of Science][Medline]
Sillito AM, Grieve KL, Jones HE, Cudeiro J, and Davis J. Visual cortical mechanisms detecting focal orientation discontinuities. Nature 378: 492496, 1995.[CrossRef][Medline]
Stone M. An asymptotic equivalence of choice of model by cross-validation and Akaike's criterion. J R Stat Soc B 39: 4447, 1977.
Tanner MA. Tools for Statistical Inference: Methods for the Exploration of Posterior Distributions and Likelihood Functions. New York: Springer-Verlag, 1996.
Vinje WE and Gallant JL. Sparse coding and decorrelation in primary visual cortex during natural vision. Science 287: 12731276, 2000.
Wilson HR. Simplified dynamics of human and mammalian neocortical neurons. J Theor Biol 200: 375388, 1999.[CrossRef][Web of Science][Medline]
Wilson MA and McNaughton BL. Dynamics of the hippocampal ensemble code for space. Science 261: 10551058, 1993.
This article has been cited by other articles:
![]() |
W. Gerstner and R. Naud How Good Are Neuron Models? Science, October 16, 2009; 326(5951): 379 - 380. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. Ostojic, N. Brunel, and V. Hakim How Connectivity, Background Activity, and Synaptic Properties Shape the Cross-Correlation between Spike Trains J. Neurosci., August 19, 2009; 29(33): 10234 - 10253. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. Santhanam, B. M. Yu, V. Gilja, S. I. Ryu, A. Afshar, M. Sahani, and K. V. Shenoy Factor-Analysis Methods for Higher-Performance Neural Prostheses J Neurophysiol, August 1, 2009; 102(2): 1315 - 1330. [Abstract] [Full Text] [PDF] |
||||
![]() |
B. M. Yu, J. P. Cunningham, G. Santhanam, S. I. Ryu, K. V. Shenoy, and M. Sahani Gaussian-Process Factor Analysis for Low-Dimensional Single-Trial Analysis of Neural Population Activity J Neurophysiol, July 1, 2009; 102(1): 614 - 635. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. Grun Data-Driven Significance Estimation for Precise Spike Correlation J Neurophysiol, March 1, 2009; 101(3): 1126 - 1140. [Abstract] [Full Text] [PDF] |
||||
![]() |
T. Tateno and H.P.C. Robinson Integration of Broadband Conductance Input in Rat Somatosensory Cortical Inhibitory Interneurons: An Inhibition-Controlled Switch Between Intrinsic and Input-Driven Spiking in Fast-Spiking Cells J Neurophysiol, February 1, 2009; 101(2): 1056 - 1072. [Abstract] [Full Text] [PDF] |
||||
![]() |
A. Bollimunta, Y. Chen, C. E. Schroeder, and M. Ding Neuronal Mechanisms of Cortical Alpha Oscillations in Awake-Behaving Macaques J. Neurosci., October 1, 2008; 28(40): 9976 - 9988. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. Czanner, U. T. Eden, S. Wirth, M. Yanike, W. A. Suzuki, and E. N. Brown Analysis of Between-Trial and Within-Trial Neural Spiking Dynamics J Neurophysiol, May 1, 2008; 99(5): 2672 - 2693. [Abstract] [Full Text] [PDF] |
||||
![]() |
W. Truccolo, G. M. Friehs, J. P. Donoghue, and L. R. Hochberg Primary Motor Cortex Tuning to Intended Movement Kinematics in Humans with Tetraplegia J. Neurosci., January 30, 2008; 28(5): 1163 - 1178. [Abstract] [Full Text] [PDF] |
||||
![]() |
J. Y. Cohen, P. Pouget, G. F. Woodman, C. R. Subraveti, J. D. Schall, and A. F. Rossi Difficulty of Visual Search Modulates Neuronal Interactions and Response Variability in the Frontal Eye Field J Neurophysiol, November 1, 2007; 98(5): 2580 - 2587. [Abstract] [Full Text] [PDF] |
||||
![]() |
L. Srinivasan, U. T. Eden, S. K. Mitter, and E. N. Brown General-Purpose Filter Design for Neural Prosthetic Devices J Neurophysiol, October 1, 2007; 98(4): 2456 - 2475. [Abstract] [Full Text] [PDF] |
||||
![]() |
N. G. Hatsopoulos, Q. Xu, and Y. Amit Encoding of Movement Fragments in the Motor Cortex J. Neurosci., May 9, 2007; 27(19): 5105 - 5114. [Abstract] [Full Text] [PDF] |
||||
![]() |
B. R. Townsend, L. Paninski, and R. N. Lemon Linear Encoding of Muscle Activity in Primary Motor Cortex and Cerebellum J Neurophysiol, November 1, 2006; 96(5): 2578 - 2592. [Abstract] [Full Text] [PDF] |
||||
![]() |
R. M. Davies, G. L. Gerstein, and S. N. Baker Measurement of Time-Dependent Changes in the Irregularity of Neural Spiking J Neurophysiol, August 1, 2006; 96(2): 906 - 918. [Abstract] [Full Text] [PDF] |
||||
![]() |
B. B. Averbeck and D. Lee Effects of Noise Correlations on Information Encoding and Decoding J Neurophysiol, June 1, 2006; 95(6): 3633 - 3644. [Abstract] [Full Text] [PDF] |
||||
![]() |
S. J. Slee, M. H. Higgs, A. L. Fairhall, and W. J. Spain Two-Dimensional Time Coding in the Auditory Brainstem J. Neurosci., October 26, 2005; 25(43): 9978 - 9988. [Abstract] [Full Text] [PDF] |
||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
| Visit Other APS Journals Online |