...
首页> 外文期刊>Neural computation >Deconstructing Odorant Identity via Primacy in Dual Networks
【24h】

Deconstructing Odorant Identity via Primacy in Dual Networks

机译:通过双重网络中的优先权解构气味标识

获取原文
获取原文并翻译 | 示例

摘要

In the olfactory system, odor percepts retain their identity despite substantial variations in concentration, timing, and background. We study a novel strategy for encoding intensity-invariant stimulus identity that is based on representing relative rather than absolute values of stimulus features. For example, in what is known as the primacy coding model, odorant identities are represented by the conditions that some odorant receptors are activated more strongly than others. Because, in this scheme, odorant identity depends only on the relative amplitudes of olfactory receptor responses, identity is invariant to changes in both intensity and monotonic nonlinear transformations of its neuronal responses. Here we show that sparse vectors representing odorant mixtures can be recovered in a compressed sensing framework via elastic net loss minimization. In the primacy model, this minimization is performed under the constraint that some receptors respond to a given odorant more strongly than others. Using duality transformation, we show that this constrained optimization problem can be solved by a neural network whose Lyapunov function represents the dual Lagrangian and whose neural responses represent the Lagrange coefficients of primacy and other constraints. The connectivity in such a dual network resembles known features of connectivity in olfactory circuits. We thus propose that networks in the piriform cortex implement dual computations to compute odorant identity with the sparse activities of individual neurons representing Lagrange coefficients. More generally, we propose that sparse neuronal firing rates may represent Lagrange multipliers, which we call the dual brain hypothesis. We show such a formulation is well suited to solve problems with multiple interacting relative constraints.
机译:在嗅觉系统中,尽管浓度,时间和背景存在很大差异,但气味感知仍保持其身份。我们研究了一种新的编码强度不变的刺激身份的策略,该策略基于表示刺激特征的相对值而不是绝对值。例如,在所谓的首要编码模型中,以某些气味受体比其他气味受体更强烈地被激活的条件来表示气味身份。因为在此方案中,气味的同一性仅取决于嗅觉受体反应的相对幅度,所以同一性对于其神经元反应的强度和单调非线性变换均不变。在这里,我们表明可以通过弹性净损失最小化在压缩感知框架中恢复代表气味混合物的稀疏向量。在首要模型中,这种最小化是在某些受体比其他受体更强烈地响应给定气味的约束下进行的。使用对偶变换,我们表明可以通过一个神经网络解决该约束优化问题,该神经网络的Lyapunov函数表示对偶拉格朗日函数,而其神经响应则表示拉格朗日系数的首要性和其他约束。这样的双网络中的连接性类似于嗅觉电路中的连接性的已知特征。因此,我们建议在梨状皮层中的网络实现双重计算,以利用代表拉格朗日系数的单个神经元的稀疏活动来计算加味剂身份。更普遍地,我们提出稀疏的神经元放电率可能代表拉格朗日乘数,我们称其为双脑假说。我们表明,这样的表述非常适合解决具有多个相互作用的相对约束的问题。

著录项

  • 来源
    《Neural computation》 |2019年第4期|710-737|共28页
  • 作者单位

    Cold Spring Harbor Lab, POB 100, Cold Spring Harbor, NY 11724 USA;

    Cold Spring Harbor Lab, POB 100, Cold Spring Harbor, NY 11724 USA;

    NYU, Sch Med, Neurosci Inst, New York, NY 10016 USA;

    Cold Spring Harbor Lab, POB 100, Cold Spring Harbor, NY 11724 USA;

  • 收录信息 美国《科学引文索引》(SCI);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号