Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks

DOI10.1016/J.INS.2021.10.003MaRDI QIDQ6180222zbMATH OpenOpenAlexFDO

Authors Jueyou Li, Xiaomei Zhu, Zhiyou Wu, Tingwen Huang

Publication date 19 January 2024

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2021.10.003

zbMATH Keywords

multi-agent networkonline learningdistributed optimizationbandit optimizationdistributed dual averaging

Mathematics Subject Classification ID

Convex programming (90C25) Online algorithms; streaming algorithms (68W27) Stochastic programming (90C15) Distributed algorithms (68W15)

Recommendations

• Gradient-free algorithms for distributed online convex optimization
• Distributed online bandit optimization under random quantization
• Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
• Event-triggered distributed online convex optimization with delayed bandit feedback

Cites work

• Asynchronous impulsive containment control in switched multi-agent systems
• Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
• Coordinate Dual Averaging for Decentralized Online Optimization With Nonseparable Global Objectives
• Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
• Distributed Convex Optimization with Inequality Constraints over Time-Varying Unbalanced Digraphs
• Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm
• Distributed Online Convex Optimization on Time-Varying Directed Graphs
• Distributed Online Optimization in Dynamic Environments Using Mirror Descent
• Distributed Optimization Over Time-Varying Directed Graphs
• Distributed Projection Subgradient Algorithm Over Time-Varying General Unbalanced Directed Graphs
• Distributed Subgradient Methods for Multi-Agent Optimization
• Distributed optimization for a class of uncertain MIMO nonlinear multi-agent systems with arbitrary relative degree
• Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
• Distributed optimization over directed graphs with row stochasticity and constraint regularity
• Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• EXTRA: an exact first-order algorithm for decentralized consensus optimization
• Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
• Logarithmic regret algorithms for online convex optimization
• Online Distributed Convex Optimization on Dynamic Networks
• Online convex optimization in the bandit setting: gradient descent without a gradient
• Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
• Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs

Cited in

(3)

• Gradient-free algorithms for distributed online convex optimization
• Distributed online optimization subject to long-term constraints and time-varying topology: an event-triggered and bandit feedback approach
• Federated dual averaging learning algorithm with delayed gradients for composite optimization

This page was built for publication: Online distributed dual averaging algorithm for multi-agent bandit optimization over time-varying general directed networks

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