Tight Bounds for Bandit Combinatorial Optimization

24 February 2017

Papers citing "Tight Bounds for Bandit Combinatorial Optimization"

7 / 7 papers shown

Title
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries Arnab Maiti Zhiyuan Fan Kevin Jamieson Lillian J. Ratliff Gabriele Farina 489 0 0 01 Apr 2025
Importance weighting without importance weights: An efficient algorithm for combinatorial semi-bandits Gergely Neu Gábor Bartók 73 37 0 17 Mar 2015
First-order regret bounds for combinatorial semi-bandits Gergely Neu 184 59 0 23 Feb 2015
On the Complexity of Bandit Linear Optimization Ohad Shamir 110 14 0 11 Aug 2014
Volumetric Spanners: an Efficient Exploration Basis for Learning Elad Hazan Zohar Karnin Raghu Mehka 255 97 0 21 Dec 2013
Towards minimax policies for online linear optimization with bandit feedback Sébastien Bubeck Nicolò Cesa-Bianchi Sham Kakade OffRL 283 150 0 14 Feb 2012
The on-line shortest path problem under partial monitoring Pál Benkö T. Várady L. Andor Ralph Robert Martin 593 355 0 08 Apr 2007