Scalable inference of functional neural connectivity at submillisecond timescales

Arina Medvedeva (Flatiron Institute) · Edoardo Balzani (New York University) · Alex Williams (New York University) · Stephen Keeley (Fordham University)
closed-form integral solutionscontinuous-time modelsdiscrete-time counterpartsfilter identificationfunctional connectivity inferencegpu accelerationlaguerre polynomialslarge-scale neural recordingsmc estimatorsneural spike train dataorthogonal temporal basispa estimatorspoisson generalized linear modelpolynomial approximationsstochastic optimizationsynaptic dynamical timescales

The Poisson Generalized Linear Model (GLM) is a foundational tool for analyzing neural spike train data. However, standard implementations rely on discretizing spike times into binned count data, limiting temporal resolution and scalability. Here, we develop stochastic optimization methods and polynomial approximations to the continuous-time analog of these models, and show them to be advantageous over their discrete-time counterparts. Further, we propose using a set of exponentially scaled Laguerre polynomials as an orthogonal temporal basis, which improves filter identification and yields closed-form integral solutions under the polynomial approximation. Applied to both synthetic and real spike-time data from rodent hippocampus, our methods demonstrate superior accuracy and scalability compared to traditional binned GLMs, enabling functional connectivity inference in large-scale neural recordings that are temporally precise on the order of synaptic dynamical timescales. We provide open-source implementations of both MC and PA estimators, optimized for GPU acceleration, to facilitate adoption in the neuroscience community.