Learning distributed jointly sparse systems by collaborative LMS
Lists
Only you see this
Abstract
In the proposed model of adaptive filtering network, distributed learning algorithm works cooperatively to identify separated unknown systems, which have different impulse responses. Specifically, JS-CoLMS algorithm is proposed to iteratively learn the unknown systems and the joint sparsity, based on a stochastic gradient approach and a subdifferentiable sparse-inducing penalty approximating the l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,0</sub> norm. The superior performance of the proposed algorithm and its relation to l <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> -LMS and Leaky LMS are briefly discussed and verified by numerical experiments.
BibTeX
@inproceedings{gu2014learning,
author = {Yuantao Gu and Mengdi Wang},
title = {{Learning distributed jointly sparse systems by collaborative LMS}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2014},
url = {https://openreview.net/forum?id=drMz9jYqtp},
}Loading related content...