Efficient "Shotgun" Inference of Neural Connectivity from Highly Sub-sampled Activity Data

Daniel Soudry, Suraj Keshri, Patrick Stinson, Min-hwan Oh, Garud Iyengar, Liam Paninski

Abstract

Author Summary Optical imaging of the activity in a neuronal network is limited by the scanning speed of the imaging device. Therefore, typically, only a small fixed part of the network is observed during the entire experiment. However, in such an experiment, it can be hard to infer from the observed activity patterns whether (1) a neuron A directly affects neuron B, or (2) another, unobserved neuron C affects both A and B. To deal with this issue, we propose a “shotgun” observation scheme, in which, at each time point, we observe a small changing subset of the neurons from the network. Consequently, many fewer neurons remain completely unobserved during the entire experiment, enabling us to eventually distinguish between cases (1) and (2) given sufficiently long experiments. Since previous inference algorithms cannot efficiently handle so many missing observations, we develop a scalable algorithm for data acquired using the shotgun observation scheme, in which only a small fraction of the neurons are observed in each time bin. Using this kind of simulated data, we show the algorithm is able to quickly infer connectivity in spiking recurrent networks with thousands of neurons.
BibTeX
@article{soudry2015efficient,
  author = {Daniel Soudry and Suraj Keshri and Patrick Stinson and Min-hwan Oh and Garud Iyengar and Liam Paninski},
  title = {{Efficient "Shotgun" Inference of Neural Connectivity from Highly Sub-sampled Activity Data}},
  journal = {PLOS Computational Biology},
  year = {2015},
  doi = {10.1371/journal.pcbi.1004464},
}

Loading related content...

Figure