We recently discussed two recent papers proposing improvements to the commonly used discrete approximation of the log-likelihood for a point process (Paninski, 2004). The likelihood is written as

where are the spike times and is the conditional intensity function (CIF) of the process at time given the preceding spikes. Typically, the integral in this equation cannot be evaluated in closed form. The standard approximation computes the function by binning along a regular lattice with bins size

where is the number of spikes in the th bin. Both papers demonstrate that smarter approximations to the integral are better for point-process statistics than naïvely binning spike train data.

The first paper we discussed (Citi et al., 2014) used the fact that neurons have an absolute refractory period after each spike to derive a correction term which makes up for the average spike placement within a bin

This correction is extremely simple to implement, but the authors demonstrate that it not provides a better approximation to the likelihood, but GLMs can be successfully fit to data using larger bin sizes than with the naïve approximation.

The second paper (Mena & Paninski, submitted) proposes to approximate the integral in the point-process likelihood using quadrature methods. The assuming the CIF is zero for some time $tau$ after each spike

Then the smaller integrals () are computed using Gaussian quadrature.

This method produces a very accurate approximation to the true (continuous) likelihood function, and is more accurate than the likelihood given by Citi et al. while evaluating the CIF at less points. In addition, they point out that their likelihood remains just as simple to maximize as the standard approximation when using non-adaptive quadrature methods. However, they do not show that their method improves parameter estimation of a GLM in practice.