Distributed online learning for joint regret with communication constraints

MaRDI QIDQ7028746zbMATH OpenFDO

Authors Dirk van der Hoeven, Hédi Hadiji, Tim van Erven

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v167/hoeven22a.html

zbMATH Keywords

communication constraintdistributed algorithmsonline convex optimizationonline learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27) Convex programming (90C25)

Cites work

• Adaptive subgradient methods for online learning and stochastic optimization
• Cooperative online learning: keeping your neighbors updated
• Decentralized Online Convex Optimization With Event-Triggered Communications
• Distributed Online Convex Optimization on Time-Varying Directed Graphs
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Fundamentals of nonparametric Bayesian inference
• Inference Under Information Constraints II: Communication Constraints and Shared Randomness
• MetaGrad: adaptation using multiple learning rates in online learning
• Online learning and online convex optimization
• Prediction, Learning, and Games
• Scale-invariant unconstrained online learning

This page was built for publication: Distributed online learning for joint regret with communication constraints

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