Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm

DOI10.1109/TAC.2020.3033712MaRDI QIDQ5033804zbMATH OpenFDO

Authors Rishabh Dixit, Amrit Singh Bedi, Ketan Rajawat

Publication date 24 February 2022

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1905.07018

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(10)

• Online learning via congregational gradient descent
• Online Proximal Learning Over Jointly Sparse Multitask Networks With $\ell _{\infty, 1}$ Regularization
• Differentially private distributed online learning over time‐varying digraphs via dual averaging
• Online Learning over Dynamic Graphs via Distributed Proximal Gradient Algorithm
• Online composite optimization with time-varying regularizers
• Online distributed optimization with stochastic gradients: high probability bound of regrets
• Distributed mirror descent for online bandit saddle point problem
• Privacy-preserving distributed online mirror descent for nonconvex optimization
• Distributed online optimization with edge-based event-triggered communication
• Gradient-free algorithms based on weight-balancing for online distributed optimisation

This page was built for publication: Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5033804)