arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2006.08266cs.CCcs.DMq-bio.NC
收藏

理解神经回路的PSPACE难度

The PSPACE-hardness of understanding neural circuits

Vidya Sagar Sharma, Piyush Srivastava

摘要:

在神经科学中,理解神经回路功能的一个重要方面是确定回路中的哪些神经元(如果有的话)对神经回路所控制的生物行为至关重要。类似的问题是确定给定的一小组神经元是否足以显示行为,即使电路中的所有其他神经元都被停用。这样的神经元子集形成了被研究行为的所谓退化回路。实验技术的最新进展为研究人员提供了以非常高的分辨率激活和失活神经元子集的工具,即使在活体动物中也是如此。从这样的实验中收集的数据可以是以下形式:当给定的神经元子集被停用时,是否观察到所研究的行为?这种设置导致的算法问题,确定最小的重要或退化的神经元集时,作为输入的神经回路的描述。算法问题需要弄清楚哪些神经元子集应该被扰动(激活/去激活),然后使用来自这些扰动的数据来确定最小的生命或退化集。鉴于大量可能的扰动,以及神经回路的循环性质,在这种方法中组合爆炸的可能性已经在生物学和神经科学文献中被认识到。在本文中,我们证明了问题的最小或最小尺寸的退化集,并找到一组重要的神经元,神经回路作为输入,实际上是PSPACE困难的。更重要的是,我们证明了我们的硬度结果表明,一个更简单的问题,模拟这样的神经电路,本身是PSPACE硬。

英文摘要:

In neuroscience, an important aspect of understanding the function of a neural circuit is to determine which, if any, of the neurons in the circuit are vital for the biological behavior governed by the neural circuit. A similar problem is to determine whether a given small set of neurons may be enough for the behavior to be displayed, even if all other neurons in the circuit are deactivated. Such a subset of neurons forms what is called a degenerate circuit for the behavior being studied. Recent advances in experimental techniques have provided researchers with tools to activate and deactivate subsets of neurons with a very high resolution, even in living animals. The data collected from such experiments may be of the following form: when a given subset of neurons is deactivated, is the behavior under study observed? This setting leads to the algorithmic question of determining the minimal vital or degenerate sets of neurons when one is given as input a description of the neural circuit. The algorithmic problem entails both figuring out which subsets of neurons should be perturbed (activated/deactivated), and then using the data from those perturbations to determine the minimal vital or degenerate sets. Given the large number of possible perturbations, and the recurrent nature of neural circuits, the possibility of a combinatorial explosion in such an approach has been recognized in the biology and the neuroscience literature. In this paper, we prove that the problems of finding minimal or minimum-size degenerate sets, and of finding the set of vital neurons, of a neural circuit given as input, are in fact PSPACE-hard. More importantly, we prove our hardness results by showing that a simpler problem, that of simulating such neural circuits, is itself PSPACE-hard.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑