TY - GEN
T1 - Maximum likelihood estimation of a stochastic integrate-and-fire neural model
AU - Pillow, Jonathan W.
AU - Paninski, Liam
AU - Simoncelli, Eero P.
N1 - Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.
PY - 2004
Y1 - 2004
N2 - Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stage. We analyze the estimation of one such model for which this nonlinear step is implemented by a noisy, leaky, integrate-and-fire mechanism with a spike-dependent aftercurrent. This model is a biophysically plausible alternative to models with Poisson (memory-less) spiking, and has been shown to effectively reproduce various spiking statistics of neurons in vivo. However, the problem of estimating the model from extracellular spike train data has not been examined in depth. We formulate the problem in terms of maximum likelihood estimation, and show that the computational problem of maximizing the likelihood is tractable. Our main contribution is an algorithm and a proof that this algorithm is guaranteed to find the global optimum with reasonable speed. We demonstrate the effectiveness of our estimator with numerical simulations.
AB - Recent work has examined the estimation of models of stimulus-driven neural activity in which some linear filtering process is followed by a nonlinear, probabilistic spiking stage. We analyze the estimation of one such model for which this nonlinear step is implemented by a noisy, leaky, integrate-and-fire mechanism with a spike-dependent aftercurrent. This model is a biophysically plausible alternative to models with Poisson (memory-less) spiking, and has been shown to effectively reproduce various spiking statistics of neurons in vivo. However, the problem of estimating the model from extracellular spike train data has not been examined in depth. We formulate the problem in terms of maximum likelihood estimation, and show that the computational problem of maximizing the likelihood is tractable. Our main contribution is an algorithm and a proof that this algorithm is guaranteed to find the global optimum with reasonable speed. We demonstrate the effectiveness of our estimator with numerical simulations.
UR - http://www.scopus.com/inward/record.url?scp=84898953402&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84898953402&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84898953402
SN - 0262201526
SN - 9780262201520
T3 - Advances in Neural Information Processing Systems
BT - Advances in Neural Information Processing Systems 16 - Proceedings of the 2003 Conference, NIPS 2003
PB - Neural information processing systems foundation
T2 - 17th Annual Conference on Neural Information Processing Systems, NIPS 2003
Y2 - 8 December 2003 through 13 December 2003
ER -