The Computational Structure of Spike Trains

Abstract

Neurons perform computations, and convey the results of those computations through the statistical structure of their output spike trains. Here we present a practical method, grounded in the information-theoretic analysis of prediction, for inferring a minimal representation of that structure and for characterizing its complexity. Starting from spike trains, our approach finds their causal state models (CSMs), the minimal hidden Markov models or stochastic automata capable of generating statistically identical time series. We then use these CSMs to objectively quantify both the generalizable structure and the idiosyncratic randomness of the spike train. Specifically, we show that the expected algorithmic information content (the information needed to describe the spike train exactly) can be split into three parts describing (1) the time-invariant structure (complexity) of the minimal spike-generating process, which describes the spike train statistically; (2) the randomness (internal entropy rate) of the minimal spike-generating process; and (3) a residual pure noise term not described by the minimal spike-generating process. We use CSMs to approximate each of these quantities. The CSMs are inferred nonparametrically from the data, making only mild regularity assumptions, via the causal state splitting reconstruction algorithm. The methods presented here complement more traditional spike train analyses by describing not only spiking probability and spike train entropy, but also the complexity of a spike train's structure. We demonstrate our approach using both simulated spike trains and experimental data recorded in rat barrel cortex during vibrissa stimulation.

Somewhat different format from journal version but same content

Cited by in corpus (23)

• A practical, unitary simulator for non-Markovian complex processes
• Bayesian Structural Inference for Hidden Processes
• Extreme dimensionality reduction with quantum modelling
• Optimal stochastic modelling with unitary quantum dynamics
• Thermodynamics of complexity and pattern manipulation
• Superior memory efficiency of quantum devices for the simulation of continuous-time stochastic processes
• General anesthesia reduces complexity and temporal asymmetry of the informational structures derived from neural recordings in Drosophila
• Unbounded memory advantage in stochastic simulation using quantum mechanics
• Matrix Product States for Quantum Stochastic Modelling
• Quantifying impacts of short-term plasticity on neuronal information transfer
• Memory-efficient tracking of complex temporal and symbolic dynamics with quantum simulators
• Robust inference of memory structure for efficient quantum modelling of stochastic processes
• Quantum coarse-graining for extreme dimension reduction in modelling stochastic temporal dynamics
• Provable superior accuracy in machine learned quantum models
• Circumventing the Curse of Dimensionality in Prediction: Causal Rate-Distortion for Infinite-Order Markov Processes
• Increasing complexity with quantum physics
• Surveying structural complexity in quantum many-body systems
• Understanding the Predictive Power of Computational Mechanics and Echo State Networks in Social Media
• Quantum-inspired identification of complex cellular automata
• Error-tolerant witnessing of divergences in classical and quantum statistical complexity
• Enhancing quantum models of stochastic processes with error mitigation
• Letting the Brain Speak for itself
• Ideal stochastic process modeling with post-quantum quasiprobabilistic theories