Distributed bandit online convex optimization with time-varying coupled inequality constraints
Distributed bandit online convex optimization with time-varying coupled inequality constraints is considered, motivated by a repeated game between a group of learners and an adversary. The learners attempt to minimize a sequence of global loss functions and at the same time satisfy a sequence of cou...
Saved in:
Main Authors: | Yi, Xinlei, Li, Xiuxian, Yang, Tao, Xie, Lihua, Chai, Tianyou, Johansson, Karl Henrik |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/159488 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Distributed online convex optimization with time-varying coupled inequality constraints
by: Yi, Xinlei, et al.
Published: (2023) -
Regret and cumulative constraint violation analysis for distributed online constrained convex optimization
by: Yi, Xinlei, et al.
Published: (2023) -
Distributed online optimization for multi-agent networks with coupled inequality constraints
by: Li, Xiuxian, et al.
Published: (2022) -
Multi-armed linear bandits with latent biases
by: Kang, Qiyu, et al.
Published: (2024) -
Smooth convex approximation and its applications
by: SHI SHENGYUAN
Published: (2010)