Sparsity-aware distributed learning
Lists
Only you see this
Abstract
In this chapter, the problem of sparsity-aware distributed learning is studied. In particular, we consider the setup of an ad-hoc network, the nodes of which are tasked to estimate, in a collaborative way, a sparse parameter vector of interest. Both batch and online algorithms will be discussed. In the batch learning context, the distributed LASSO algorithm and a distributed greedy technique will be presented. Furthermore, an LMS-based sparsity promoting algorithm, revolving around the l1 norm, as well as a greedy distributed LMS will be discussed. Moreover, a set-theoretic sparsity promoting distributed technique will be examined. Finally, the performance of the presented algorithms will be validated in several scenarios.
BibTeX
@inproceedings{chouvardas2015sparsity,
author = {Symeon Chouvardas and Yannis Kopsinis and Sergios Theodoridis},
title = {{Sparsity-aware distributed learning}},
booktitle = {Cambridge},
year = {2015},
doi = {10.1017/cbo9781316162750.003},
}Loading related content...