Computing sparse representations using a network of sparsely communicating nodes

Filed Under : | | |

Type: Journal Publication

Web: http://www.mitpressjournals.org/doi/abs/10.1162/NECO_a_00353


Abstract: Computing sparse redundant representations is an important problem in both applied mathematics and neuroscience. In many applications, this problem must be solved in an energy-efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating by low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, the operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We show that the numerical performance of HDA is on par with existing algorithms. In the asymptotic regime, the representation error of HDA decays with time, t, as 1/t. HDA is stable against time-varying noise; specifically, the representation error decays as 1/sqrt(t) for gaussian white noise.


Cited as: Tao Hu, A. Genkin and D.B. Chklovskii, "Computing sparse representations using a network of sparsely communicating nodes", Neural Computation 24, 2852 (2012)

Comments are closed.