Journal of Computational Neuroscience

, Volume 29, Issue 1, pp 89–105

Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-space models

Article

DOI: 10.1007/s10827-009-0150-x

Cite this article as:
Koyama, S. & Paninski, L. J Comput Neurosci (2010) 29: 89. doi:10.1007/s10827-009-0150-x

Abstract

A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a posteriori (MAP) path of the hidden state variable in these models, given spike train observations. If the state transition density is log-concave and the observation model satisfies certain standard assumptions, then the optimization problem is strictly concave and can be solved rapidly with Newton–Raphson methods, because the Hessian of the loglikelihood is block tridiagonal. We can further exploit this block-tridiagonal structure to develop efficient parameter estimation methods for these models. We describe applications of this approach to neural decoding problems, with a focus on the classic integrate-and-fire model as a key example.

Keywords

Tridiagonal Newton–Raphson method Laplace approximation State-space models Point processes 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Statistics and Center for the Neural Basis of CognitionCarnegie Mellon UniversityPittsburghUSA
  2. 2.Department of Statistics and Center for Theoretical NeuroscienceColumbia UniversityNew YorkUSA

Personalised recommendations