Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits

v1v2 (latest)

Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits

11 February 2019

Pierre Perrault

Vianney Perchet

ArXiv (abs)PDF HTML

Papers citing "Exploiting Structure of Uncertainty for Efficient Matroid Semi-Bandits"

5 / 5 papers shown

Title
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms Wei Chen Yajun Wang Yang Yuan Qinshi Wang 100 285 0 31 Jul 2014
Matroid Bandits: Fast Combinatorial Optimization with Learning Branislav Kveton Zheng Wen Azin Ashkan Hoda Eydgahi Brian Eriksson 87 121 0 20 Mar 2014
An efficient algorithm for learning with semi-bandit feedback Gergely Neu Gábor Bartók 121 80 0 13 May 2013
Regret in Online Combinatorial Optimization Jean-Yves Audibert Sébastien Bubeck Gábor Lugosi OffRL 75 258 0 20 Apr 2012
Efficient Minimization of Decomposable Submodular Functions Peter Stobbe Andreas Krause 85 124 0 26 Oct 2010

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.