Distributed Splitting-Over-Features Sparse Bayesian Learning with Alternating Direction Method of Multipliers

TL;DR: An algorithm for a distributed realization of sparse bayesian learning (SBL) is discussed for learning a static spatial process with the splitting-over-features approach over a network of interconnected agents.

Abstract: In processing spatially distributed data, multi-agent robotic platforms equipped with sensors and computing capabilities are gaining interest for applications in inhospitable environments In this work an algorithm for a distributed realization of sparse bayesian learning (SBL) is discussed for learning a static spatial process with the splitting-over-features approach over a network of interconnected agents The observed process is modeled as a superposition of weighted kernel functions, or features as we call it, centered at the agent's measurement locations SBL is then used to determine which feature is relevant for representing the spatial process Using upper bounding convex functions, the SBL parameter estimation is formulated as $\ell_{1}$ -norm constrained optimization, which is solved distributively using alternating direction method of multipliers (ADMM) and averaged consensus The performance of the method is demonstrated by processing real magnetic field data collected in a laboratory