A Network of Spiking Neurons for Computing Sparse Representations in an Energy-Efficient Way

DOI10.1162/NECO_a_00353zbMath1268.92024arXiv1210.1530OpenAlexW2005918037WikidataQ42039320 ScholiaQ42039320MaRDI QIDQ2840871

Dmitri B. Chklovskii, Tao Hu, Alexander V. Genkin

Publication date: 23 July 2013

Published in: Neural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1530

Mathematics Subject Classification ID

Neural biology (92C20) Neural networks for/in biological studies, artificial life and related topics (92B20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Short-Term Memory Capacity in Networks via the Restricted Isometry Property

Cites Work

• Unnamed Item
• Unnamed Item
• Equality relating Euclidean distance cone to positive semidefinite cone
• Fast linearized Bregman iteration for compressive sensing and sparse denoising
• Least angle regression. (With discussion)
• Coordinate descent optimization for \(l^{1}\) minimization with application to compressed sensing; a greedy algorithm
• Pathwise coordinate optimization
• Linearized Bregman iterations for compressed sensing
• Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
• Atomic Decomposition by Basis Pursuit
• Regularization and Variable Selection Via the Elastic Net

This page was built for publication: A Network of Spiking Neurons for Computing Sparse Representations in an Energy-Efficient Way