title: A common network architecture efficiently implements a variety of sparsity-based inference problems.
abstract: The sparse coding hypothesis has generated significant interest in the computational and theoretical neuroscience communities, but there remain open questions about the exact quantitative form of the sparsity penalty and the implementation of such a coding rule in neurally plausible architectures. The main contribution of this work is to show that a wide variety of sparsity-based probabilistic inference problems proposed in the signal processing and statistics literatures can be implemented exactly in the common network architecture known as the locally competitive algorithm (LCA). Among the cost functions we examine are approximate l(p) norms (0 ≤ p ≤ 2), modified l(p)-norms, block-l1 norms, and reweighted algorithms. Of particular interest is that we show significantly increased performance in reweighted l1 algorithms by inferring all parameters jointly in a dynamical system rather than using an iterative approach native to digital computational architectures.
authors.affiliation: School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30363, USA. acharles6@gatech.edu
authors.forename: Adam S
authors.initials: AS
authors.lastname: Charles
authors.forename: Pierre
authors.initials: P
authors.lastname: Garrigues
authors.forename: Christopher J
authors.initials: CJ
authors.lastname: Rozell
mesh_terms: D000465:Algorithms; D000818:Animals; D001185:Artificial Intelligence; D003198:Computer Simulation; D006801:Humans; D013003:Somatosensory Cortex / Q000502:physiology*