.png){kind=icon}
返回
Sparse and silent coding in neural circuits
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2011.10.017.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparse coding algorithms find a linear basis in which signals can be represented by a small number of non-zero coefficients. Such coding may play an important role in neural information processing and metabolically efficient natural solutions serve as an inspiration for algorithms employed in various areas of computer science. In particular, finding non-zero coefficients in overcomplete sparse coding is a computationally hard problem, for which different approximate solutions have been proposed. Methods that minimize the magnitude of the coefficients ('l(1)-norm') instead of minimizing the size of the active subset of features ('l(0)-norm') may find the optimal solutions, but they do not scale well with the problem size and use centralized algorithms. Iterative, greedy methods, on the other hand are fast, but require a priori knowledge of the number of non-zero features, often find suboptimal solutions and they converge to the final sparse form through a series of non-sparse representations. In this article we propose a neurally plausible algorithm which efficiently integrates an l(0)-norm based probabilistic sparse coding model with ideas inspired by novel iterative solutions. Furthermore, the resulting algorithm does not require an exactly defined sparseness level thus it is suitable for representing natural stimuli with a varying number of features. We demonstrate that our combined method can find optimal solutions in cases where other, l(1)-norm based algorithms already fail. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
l(1)-Norm
Cross-entropy method
Sparse coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Preparation of PP-g-(AA-MAH) Fibers Using Suspension Grafting and Melt-Blown Spinning and its Adsorption for Aniline.png)
PolymersOAAI
PolymersIF0
OAAI分享收藏Timing, Timing, Timing: Fast Decoding of Object Information from Intracranial Field Potentials in Human Visual CortexNEURON
OAAI
NEURONIF15
OAAI分享收藏
查看更多内容