Decentralized learning for wireless communications and networking
From MaRDI portal
Abstract: This chapter deals with decentralized learning algorithms for in-network processing of graph-valued data. A generic learning problem is formulated and recast into a separable form, which is iteratively minimized using the alternating-direction method of multipliers (ADMM) so as to gain the desired degree of parallelization. Without exchanging elements from the distributed training sets and keeping inter-node communications at affordable levels, the local (per-node) learners consent to the desired quantity inferred globally, meaning the one obtained if the entire training data set were centrally available. Impact of the decentralized learning framework to contemporary wireless communications and networking tasks is illustrated through case studies including target tracking using wireless sensor networks, unveiling Internet traffic anomalies, power system state estimation, as well as spectrum cartography for wireless cognitive radio networks.
Recommendations
Cited in
(12)- Over-the-Air computation for distributed machine learning and consensus in large wireless networks
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Adaptation, learning, and optimization over networks
- Decentralized dictionary learning over time-varying digraphs
- Sparsity promoting decentralized learning strategies for radio tomographic imaging using consensus based ADMM approach
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
- A divide-and-conquer algorithm for distributed optimization on networks
- Decentralized diffusion-based learning under non-parametric limited prior knowledge
- An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
- Barron space for graph convolutional neural networks
This page was built for publication: Decentralized learning for wireless communications and networking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350486)