conftrace_

optimal regret

9 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) stochastic bandit (98) adversarial bandit (59) online learning (1777) convex online learning (1) eluder dimension (22) online algorithm (445) phase transition (92) regret guarantee (8)

Papers

PRODuctive bandits: Importance Weighting No More NIPS 2024
VO$Q$L: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation COLT 2023
Kernelized Reinforcement Learning with Order Optimal Regret Bounds NIPS 2023
Sub-sampling for Efficient Non-Parametric Bandit Exploration NIPS 2020
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020
Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NIPS 2019
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits COLT 2016
Optimal Regret Analysis of Thompson Sampling in Stochastic Multi-armed Bandit Problem with Multiple Plays ICML 2015
On the Universality of Online Mirror Descent NIPS 2011