A Tight Lower Bound for Online Convex Optimization with Switching Costs.
Antonios AntoniadisKevin SchewiorPublished in: WAOA (2017)
Keyphrases
- lower bound
- switching costs
- efficient algorithms for solving
- online convex optimization
- upper bound
- regret bounds
- online learning
- prior studies
- np hard
- worst case
- individual level
- convex optimization
- objective function
- long run
- network effects
- optimal solution
- online services
- newton method
- website
- electronic commerce
- linear programming