The Computational Structure of Spike Trains
Robert Haslinger, Kristina Lisa Klinkner, and Cosma Rohilla Shalizi

TL;DR
This paper introduces a practical information-theoretic method to infer minimal causal models of neuronal spike trains, enabling detailed analysis of their structure, randomness, and complexity from data.
Contribution
It presents a nonparametric approach to infer causal state models from spike trains, quantifying their structure and randomness in a unified framework.
Findings
Successfully applied to simulated spike trains.
Effectively characterized experimental rat cortex data.
Decomposed spike train information into structure, entropy, and noise.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural dynamics and brain function · Advanced Memory and Neural Computing · stochastic dynamics and bifurcation
