Gaussian-process factor analysis for low-dimensional single-trial analysis of neural population activity.
We consider the problem of extracting smooth, low-dimensional neural trajectories that summarize the activity recorded simultaneously from many neurons on individual experimental trials. Beyond the benefit of visualizing the high-dimensional, noisy spiking activity in a compact form, such trajectories can offer insight into the dynamics of the neural circuitry underlying the recorded activity. Current methods for extracting neural trajectories involve a two-stage process: the spike trains are first smoothed over time, then a static dimensionality-reduction technique is applied. We first describe extensions of the two-stage methods that allow the degree of smoothing to be chosen in a principled way and that account for spiking variability, which may vary both across neurons and across time. We then present a novel method for extracting neural trajectories-Gaussian-process factor analysis (GPFA)-which unifies the smoothing and dimensionality-reduction operations in a common probabilistic framework. We applied these methods to the activity of 61 neurons recorded simultaneously in macaque premotor and motor cortices during reach planning and execution. By adopting a goodness-of-fit metric that measures how well the activity of each neuron can be predicted by all other recorded neurons, we found that the proposed extensions improved the predictive ability of the two-stage methods. The predictive ability was further improved by going to GPFA. From the extracted trajectories, we directly observed a convergence in neural state during motor planning, an effect that was shown indirectly by previous studies. We then show how such methods can be a powerful tool for relating the spiking activity across a neural population to the subject's behavior on a single-trial basis. Finally, to assess how well the proposed methods characterize neural population activity when the underlying time course is known, we performed simulations that revealed that GPFA performed tens of percent better than the best two-stage method.
Department of Electrical Engineering, Neurosciences Program, Stanford University, Stanford, CA, USA.
Byron M
BM
Yu
John P
JP
Cunningham
Gopal
G
Santhanam
Stephen I
SI
Ryu
Krishna V
KV
Shenoy
Maneesh
M
Sahani
D000200:Action Potentials / Q000502:physiology*; D000818:Animals; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009474:Neurons / Q000502:physiology*; D017711:Nonlinear Dynamics; D016011:Normal Distribution; D025341:Principal Component Analysis; D011930:Reaction Time / Q000502:physiology; D012815:Signal Processing, Computer-Assisted; D013997:Time Factors