Sparse connectivity for MAP inference in linear models using sister mitral cells.

Sparse connectivity for MAP inference in linear models using sister mitral cells.
复制标题

使用姐妹二尖瓣在线性模型中的稀疏连通性用于MAP推断。

DOI:
10.1371/journal.pcbi.1009808
复制
发表时间:
2022-01
影响因子:
4.3
通讯作者:
Latham PE
Latham PE
中科院分区:
生物学2区
文献类型:
--
作者:
Tootoonian S;Schaefer AT;Latham PE

文献摘要

参考文献

相似文献

感觉处理是困难的,因为感兴趣的变量以一种相对复杂的方式在棘波序列中编码。研究感觉加工的一个主要目标是了解大脑是如何提取这些变量的。在这里,我们回顾了一个常见的编码模型,在该模型中,变量是线性编码的。虽然通常有比神经元更多的变量,但这个问题仍然是可解的,因为任何时候都只有少量的变量出现(稀疏先验)。然而,以前的解决方案需要所有到所有的连接,这与大脑中看到的稀疏连接不同。在这里,我们提出了一个算法,该算法可证明达到MAP(最大后验概率)推理解,但使用稀疏连通性来实现。我们的算法是受小鼠嗅球电路的启发,但我们的方法足够通用,可以应用于其他模式。此外,应该可以将其扩展到非线性编码模型。感觉系统必须从噪声和模棱两可的输入中推断出潜在变量。MAP推理--在给定感觉输入的情况下为潜在变量选择最可能的值--是实现这一点的最简单方法之一,但其神经实现通常需要涉及的神经元之间的所有对所有连接。在常见的感觉环境中,这可能需要一个神经元与数十万个其他神经元连接,这在生物学上是不可信的。在这项工作中,我们从嗅觉系统的姐妹二尖瓣细胞-与同一输入通道相关的神经元组-获得灵感,以推导出一种使用稀疏连接性进行MAP推断的方法。为此,我们将姐妹细胞分配给潜在变量的随机子集,并使用额外的细胞来确保姐妹细胞正确地共享信息。然后,我们推导出姐妹细胞计算原始MAP推理解所需的电路和动力学。我们的工作产生了一个生物学上可信的电路,它可以证明解决了MAP推理问题,并提供了可实验测试的预测。虽然受到嗅觉系统的启发,我们的方法是相当普遍的,并可能适用于其他感觉模式。
Sensory processing is hard because the variables of interest are encoded in spike trains in a relatively complex way. A major goal in studies of sensory processing is to understand how the brain extracts those variables. Here we revisit a common encoding model in which variables are encoded linearly. Although there are typically more variables than neurons, this problem is still solvable because only a small number of variables appear at any one time (sparse prior). However, previous solutions require all-to-all connectivity, inconsistent with the sparse connectivity seen in the brain. Here we propose an algorithm that provably reaches the MAP (maximum a posteriori) inference solution, but does so using sparse connectivity. Our algorithm is inspired by the circuit of the mouse olfactory bulb, but our approach is general enough to apply to other modalities. In addition, it should be possible to extend it to nonlinear encoding models. Sensory systems must infer latent variables from noisy and ambiguous input. MAP inference—choosing the most likely value for the latent variables given the sensory input—is one of the simplest methods for doing that, but its neural implementation often requires all-to-all connectivity between the neurons involved. In common sensory contexts this can require a single neuron to connect to hundreds of thousands of others, which is biologically implausible. In this work we take inspiration from the ‘sister’ mitral cells of the olfactory system—groups of neurons associated with the same input channel—to derive a method for performing MAP inference using sparse connectivity. We do so by assigning sister cells to random subsets of the latent variables and using additional cells to ensure that sisters correctly share information. We then derive the circuitry and dynamics required for the sister cells to compute the original MAP inference solution. Our work yields a biologically plausible circuit that provably solves the MAP inference problem and provides experimentally testable predictions. While inspired by the olfactory system, our method is quite general, and is likely to apply to other sensory modalities.
DOI: 10.1152/jn.1993.69.6.1948
发表时间: 1993-06-01
影响因子: 2.5
作者:
BHALLA, US;BOWER, JM
通讯作者: BOWER, JM
DOI: 10.1016/j.neuron.2012.05.017
发表时间: 2012-07-26
期刊: NEURON
影响因子: 16.2
作者:
Fukunaga, Izumi;Berning, Manuel;Schaefer, Andreas T.
通讯作者: Schaefer, Andreas T.
DOI: 10.1073/pnas.88.15.6462
发表时间: 1991-08-01
影响因子: 11.1
作者:
HOPFIELD, JJ
通讯作者: HOPFIELD, JJ
DOI: 10.1073/pnas.0307882100
发表时间: 2004-02-24
影响因子: 11.1
作者:
Malnic, B;Godfrey, PA;Buck, LB
通讯作者: Buck, LB
DOI: 10.1038/s41467-020-17490-0
发表时间: 2020-07-31
影响因子: 16.6
作者:
Hiratani, Naoki;Latham, Peter E.
通讯作者: Latham, Peter E.