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
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A low complexity algorithm with O(T) regret and O(1) constraint violations for online convex optimization with long term constraints |
scientific article; zbMATH DE number 7255032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8996538519859314
0 references
0.826711893081665
0 references
0.771248996257782
0 references
0.7664851546287537
0 references
0.759994626045227
0 references
