Apostolos Destounis

Cautious Regret Minimization: Online Optimization with Long-Term Budget Constraints

We study a class of online convex optimization problems with long-term budget constraints that arise naturally as reliability guarantees or total consumption constraints. In this general setting, prior work by Mannor et al. (2009) has shown that achieving no regret is impossible if the functions def…