Regret in online combinatorial optimization
| Year of publication: |
2014
|
|---|---|
| Authors: | Audibert, Jean-Yves ; Bubeck, Sébastien ; Lugosi, Gábor |
| Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 1, p. 31-45
|
| Subject: | online optimization | combinatorial optimization | mirror descent | multi-armed bandits | minimax regret | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Scheduling-Verfahren | Scheduling problem |
-
Robust combinatorial optimization under convex and discrete cost uncertainty
Buchheim, Christoph, (2018)
-
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty
Kurtz, Jannis, (2018)
-
On recoverable and two-stage robust selection problems with budgeted uncertainty
Chassein, André, (2018)
- More ...
-
Strategies for sequential prediction of stationary time series
Györfi, László, (2000)
-
A zero-delay sequential scheme for lossy coding of individual sequences
Linder, Tamás, (2000)
-
Worst-case bounds for the logarithmic loss of predictors
Driesen, David M., (1999)
- More ...