Sparse and silent coding in neural circuits

András Lörincz

doi:10.1016/j.neucom.2011.10.017

Return

Sparse and silent coding in neural circuits

2012-03-01

András Lörincz *

Zsolt Palotai

Gábor Szirtes

DOI：10.1016/j.neucom.2011.10.017

Original

Save

View PDF

Abstract

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.

Keywords:

l(1)-Norm

Cross-entropy method

Sparse coding

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.