Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays

25 November 2019

Papers citing "Minimax Optimal Algorithms for Adversarial Bandit Problem with Multiple Plays"

4 / 4 papers shown

Title
Data Dependent Regret Guarantees Against General Comparators for Full or Bandit Feedback Kaan Gokcesu Hakan Gokcesu OffRL 42 0 0 12 Mar 2023
Natural Hierarchical Cluster Analysis by Nearest Neighbors with Near-Linear Time Complexity Kaan Gokcesu Hakan Gokcesu 25 1 0 15 Mar 2022
Efficient Online-Bandit Strategies for Minimax Learning Problems Christophe Roux Elias Wirth Sebastian Pokutta Thomas Kerdreux 42 2 0 28 May 2021
Optimal Stochastic Nonconvex Optimization with Bandit Feedback Puning Zhao Lifeng Lai 139 3 0 30 Mar 2021