Skip to content
conftrace_

optimal regret

9 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (7) multi-armed bandit (4) stochastic bandit (3) adversarial bandit (2) function approximation (2) online learning (2) reinforcement learning (2) convex online learning (1) eluder dimension (1) online algorithm (1)

Papers

PRODuctive bandits: Importance Weighting No More NeurIPS 2024 Kernelized Reinforcement Learning with Order Optimal Regret Bounds NeurIPS 2023 VOQL: Towards Optimal Regret in Model-free RL with Nonlinear Function Approximation COLT 2023 An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020 Sub-sampling for Efficient Non-Parametric Bandit Exploration NeurIPS 2020 Phase Transitions and Cyclic Phenomena in Bandits with Switching Constraints NeurIPS 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 NeurIPS 2011