Consensus Based Distributed Sparse Bayesian Learning By Fast Marginal Likelihood Maximization

More Info
expand_more

Abstract

For swarm systems, distributed processing is of paramount importance, and Bayesian methods are preferred for their robustness. Existing distributed sparse Bayesian learn- ing (SBL) methods rely on the automatic relevance deter- mination (ARD), which involves a computationally complex reweighted l1-norm optimization, or they use loopy belief propagation, which is not guaranteed to converge. Hence, this paper looks into the fast marginal likelihood maximiza- tion (FMLM) method to develop a faster distributed SBL version. The proposed method has a low communication overhead, and can be distributed by simple consensus meth- ods. The performed simulations indicate a better performance compared with the distributed ARD version, yet the same per- formance as the FMLM.

Files

Letter.pdf
(.pdf | 1.45 Mb)

Download not available

Consensus_Based_Distributed_Sp... (.pdf)
(.pdf | 1.57 Mb)
- Embargo expired in 19-05-2021