A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints (Q4969032)
From MaRDI portal
scientific article; zbMATH DE number 7255032
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints |
scientific article; zbMATH DE number 7255032 |
Statements
5 October 2020
0 references
online convex optimization
0 references
long-term constraints
0 references
regret bounds
0 references
constraint violation bounds
0 references
low complexity
0 references
math.OC
0 references
cs.LG
0 references
stat.ML
0 references
