Regret in Online Combinatorial Optimization
From MaRDI portal
Publication:5169692
DOI10.1287/moor.2013.0598zbMath1341.68309arXiv1204.4710OpenAlexW2152898676MaRDI QIDQ5169692
Sébastien Bubeck, Jean-Yves Audibert, Gábor Lugosi
Publication date: 11 July 2014
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4710
Decision theory (91B06) Combinatorial optimization (90C27) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)
Related Items (15)
Unnamed Item ⋮ Decentralized online integer programming problems with a coupling cardinality constraint ⋮ Unifying mirror descent and dual averaging ⋮ The role of optimization in some recent advances in data-driven decision-making ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) ⋮ An inverse optimization approach for a capacitated vehicle routing problem ⋮ Unnamed Item ⋮ Maximin effects in inhomogeneous large-scale data ⋮ Learning to Optimize via Information-Directed Sampling ⋮ Sequential Interdiction with Incomplete Information and Learning ⋮ Unnamed Item ⋮ Game of Thrones: Fully Distributed Learning for Multiplayer Bandits ⋮ Online Learning over a Finite Action Set with Limited Switching ⋮ Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science ⋮ Small-Loss Bounds for Online Learning with Partial Information
This page was built for publication: Regret in Online Combinatorial Optimization
