Skip to Main content Skip to Navigation
Journal articles

Random-Walk Perturbations for Online Combinatorial Optimization

Abstract : We study online combinatorial optimization problems where a learner is interested in minimizing its cumulative regret in the presence of switching costs. To solve such problems, we propose a version of the follow-the-perturbed-leader algorithm in which the cumulative losses are perturbed by independent symmetric random walks. In the general setting, our forecaster is shown to enjoy near-optimal guarantees on both quantities of interest, making it the best known efficient algorithm for the studied problem. In the special case of prediction with expert advice, we show that the forecaster achieves an expected regret of the optimal order O(√ n log N) where n is the time horizon and N is the number of experts, while guaranteeing that the predictions are switched at most O(√ n log N) times, in expectation.
Document type :
Journal articles
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Gergely Neu Connect in order to contact the contributor
Submitted on : Tuesday, October 13, 2015 - 2:23:15 PM
Last modification on : Thursday, January 20, 2022 - 4:17:10 PM
Long-term archiving on: : Thursday, April 27, 2017 - 12:16:27 AM


Files produced by the author(s)



Luc Devroye, Gábor Lugosi, Gergely Neu. Random-Walk Perturbations for Online Combinatorial Optimization. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2015, 61 (7), pp.4099 - 4106. ⟨10.1109/TIT.2015.2428253⟩. ⟨hal-01214987⟩



Les métriques sont temporairement indisponibles