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 521 1 0 01 Apr 2025
Adversarial Combinatorial Semi-bandits with Graph Feedback Yuxiao Wen 139 0 0 26 Feb 2025
Sum-max Submodular Bandits Stephen Pasteris Alberto Rumi Fabio Vitale Nicolò Cesa-Bianchi 56 2 0 10 Nov 2023
Preference-based Reinforcement Learning with Finite-Time Guarantees Yichong Xu Ruosong Wang Lin F. Yang Aarti Singh A. Dubrawski 109 60 0 16 Jun 2020
Unifying mirror descent and dual averaging A. Juditsky Joon Kwon Eric Moulines 106 29 0 30 Oct 2019
Top-k Combinatorial Bandits with Full-Bandit Feedback Idan Rejwan Yishay Mansour 78 51 0 28 May 2019
Learning to Route Efficiently with End-to-End Feedback: The Value of Networked Structure Ruihao Zhu E. Modiano 30 4 0 24 Oct 2018