z-logo
open-access-imgOpen Access
Cautious regret minimization: Online optimization with long-term budget constraints
Author(s) -
Nikolaos Liakopoulos,
Apostolos Destounis,
Georgios S. Paschos,
Thrasyvoulos Spyropoulos,
Panayotis Mertikopoulos
Publication year - 2019
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - regret , computer science , mathematical optimization , benchmark (surveying) , term (time) , impossibility , residual , convex optimization , online algorithm , metric (unit) , competitive analysis , budget constraint , mathematics , upper and lower bounds , regular polygon , algorithm , economics , machine learning , political science , geography , operations management , physics , geometry , geodesy , quantum mechanics , law , mathematical analysis , neoclassical economics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom