conftrace_

sleeping bandit

5 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) online algorithm (445) adversarial learning (1595) stochastic optimization (1060) dueling bandit (57) tsallis entropy (15) stochastic action set (3) adversarial regret (4)

Papers

Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024
One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NIPS 2023
Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards ICML 2020
Online combinatorial optimization with stochastic decision sets and adversarial losses NIPS 2014