2016
Adaptive Algorithms for Online Convex Optimization with Long-term Constraints
ICML 2016poster
We present an adaptive online gradient descent algorithm to solve online convex optimization problems with long-term constraints, which are constraints that need to be satisfied when accumulated over a finite number of rounds T, but can be violated in intermediate rounds. For some user-defined trade…