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 | Mathematische Optimierung | Mathematical programming | Entscheidung unter Unsicherheit | Decision under uncertainty | Theorie | Theory | Scheduling-Verfahren | Scheduling problem |
-
Benabbou, Nawal, (2018)
-
Robust combinatorial optimization with variable cost uncertainty
Poss, Michael, (2014)
-
Robust combinatorial optimization under convex and discrete cost uncertainty
Buchheim, Christoph, (2018)
- More ...
-
Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problem.
El Alaoui, Issam, (2013)
-
Robustness of stochastic bandit policies
Salomon, Antoine, (2014)
-
The entropic barrier : exponential families, log-concave geometry, and self-concordance
Bubeck, Sébastien, (2019)
- More ...