论文标题
通过整体刺激进行在线神经连通性估计
Online neural connectivity estimation with ensemble stimulation
论文作者
论文摘要
系统神经科学的主要目标之一是将神经回路的结构与其功能联系起来,但是连通性的模式在从大量人群中记录行为生物体时很难确定。许多以前的方法试图使用观察数据的统计模型来估计神经元之间的功能连接,但是这些方法在很大程度上取决于参数假设,并且纯粹是相关的。然而,最近,全息光刺激技术使精确靶向神经元的选定集合,从而提供了建立直接因果关系的可能性。在这里,我们提出了一种基于嘈杂组测试的方法,该方法大大提高了稀疏网络中此过程的效率。通过刺激神经元的小型团体,我们表明可以通过许多测试来恢复仅在最小统计假设下的人口大小对数增长的测试。此外,我们证明我们的方法可以减少到有效解决的凸优化问题,这可能与二元连接权重的差异性贝叶斯推断有关,并且我们在后边缘上得出了严格的界限。这使我们能够将方法扩展到流式设置,在该设置中,不断更新的后代允许可选停止,并且我们证明了推断连接性的可行性,可在线推断网络的连接性。最后,我们展示了如何将我们的工作理论上链接到压缩传感方法,并比较不同设置中连通性推断的结果。
One of the primary goals of systems neuroscience is to relate the structure of neural circuits to their function, yet patterns of connectivity are difficult to establish when recording from large populations in behaving organisms. Many previous approaches have attempted to estimate functional connectivity between neurons using statistical modeling of observational data, but these approaches rely heavily on parametric assumptions and are purely correlational. Recently, however, holographic photostimulation techniques have made it possible to precisely target selected ensembles of neurons, offering the possibility of establishing direct causal links. Here, we propose a method based on noisy group testing that drastically increases the efficiency of this process in sparse networks. By stimulating small ensembles of neurons, we show that it is possible to recover binarized network connectivity with a number of tests that grows only logarithmically with population size under minimal statistical assumptions. Moreover, we prove that our approach, which reduces to an efficiently solvable convex optimization problem, can be related to Variational Bayesian inference on the binary connection weights, and we derive rigorous bounds on the posterior marginals. This allows us to extend our method to the streaming setting, where continuously updated posteriors allow for optional stopping, and we demonstrate the feasibility of inferring connectivity for networks of up to tens of thousands of neurons online. Finally, we show how our work can be theoretically linked to compressed sensing approaches, and compare results for connectivity inference in different settings.