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: | , , , , , |
---|---|
其他作者: | |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/159488 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|