## Neural Computation

May 1, 2003, Vol. 15, No. 5, Pages 965-991
(doi: 10.1162/089976603765202622)
© 2003 Massachusetts Institute of Technology
Estimating a State-Space Model from Point Process Observations
Article PDF (2.24 MB)
Abstract

A widely used signal processing paradigm is the state-space model. The state-space model is defined by two equations: an observation equation that describes how the hidden state or latent process is observed and a state equation that defines the evolution of the process through time. Inspired by neurophysiology experiments in which neural spiking activity is induced by an implicit (latent) stimulus, we develop an algorithm to estimate a state-space model observed through point process measurements. We represent the latent process modulating the neural spiking activity as a gaussian autoregressive model driven by an external stimulus. Given the latent process, neural spiking activity is characterized as a general point process defined by its conditional intensity function. We develop an approximate expectation-maximization (EM) algorithm to estimate the unobservable state-space process, its parameters, and the parameters of the point process. The EM algorithm combines a point process recursive nonlinear filter algorithm, the fixed interval smoothing algorithm, and the state-space covariance algorithm to compute the complete data log likelihood efficiently. We use a Kolmogorov-Smirnov test based on the time-rescaling theorem to evaluate agreement between the model and point process data. We illustrate the model with two simulated data examples: an ensemble of Poisson neurons driven by a common stimulus and a single neuron whose conditional intensity function is approximated as a local Bernoulli process.
{"ft_lang_label":"__label__en","ft_lang_prob":0.89199483,"math_prob":0.9718707,"size":1545,"snap":"2020-34-2020-40","text_gpt3_token_len":275,"char_repetition_ratio":0.14536016,"word_repetition_ratio":0.0,"special_character_ratio":0.16181229,"punctuation_ratio":0.06882591,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98512363,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-09T18:43:35Z\",\"WARC-Record-ID\":\"<urn:uuid:aafda9b1-e79a-4724-9a52-a0e882db6c10>\",\"Content-Length\":\"29356\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2a10490e-5713-4d8b-9630-e1a9c798be35>\",\"WARC-Concurrent-To\":\"<urn:uuid:88862f6c-f1ed-43af-b7f6-dd193ba6c191>\",\"WARC-IP-Address\":\"18.7.27.156\",\"WARC-Target-URI\":\"http://mitpdev.mit.edu/node/25579\",\"WARC-Payload-Digest\":\"sha1:JLCTLBG7O5PZTWTCWYCXW2VW5CTWEZ7Q\",\"WARC-Block-Digest\":\"sha1:DUEEEUDEUYM6ILSKERML4GD3HURY6XK2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439738562.5_warc_CC-MAIN-20200809162458-20200809192458-00440.warc.gz\"}"}