A Common Network Architecture Efficiently Implements a Variety of Sparsity-based Inference Problems (bibtex)
by , and
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 lp norms (0<= p <= 2), modified lp-norms, block-l1 norms, and re-weighted algorithms. Of particular interest is that we show significantly increased performance in re-weighted l1 algorithms by inferring all parameters jointly in a dynamical system rather than using an iterative approach native to digital computational architectures.
Reference:
A Common Network Architecture Efficiently Implements a Variety of Sparsity-based Inference ProblemsA.S. Charles, P. Garrigues and C.J. Rozell. Neural Computation, 24(12), pp. 3317–3339, December 2012.
Bibtex Entry:
@Article{charles.12e,
author = 	 {Charles, A.S. and Garrigues, P. and Rozell, C.J.},
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 lp norms (0<= p <= 2), modified lp-norms, block-l1 norms, and re-weighted algorithms.  Of particular interest is that we show significantly increased performance in re-weighted l1 algorithms by inferring all parameters jointly in a dynamical system rather than using an iterative approach native to digital computational architectures.},
year = 2012,
month = dec,
volume = {24},
number = {12},
pages = {3317--3339},
journal = {Neural Computation},
url = {http://siplab.gatech.edu/pubs/charlesNECO2012.pdf}
}
Powered by bibtexbrowser
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 1, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7027571797370911, "perplexity": 1860.6749606653327}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2020-10/segments/1581875146643.49/warc/CC-MAIN-20200227002351-20200227032351-00024.warc.gz"}