conftrace_

sleeping bandit

6 papers

Explore in graph

Co-occurring keywords · papers mentioning both

multi-armed bandit (5) regret bound (5) online learning (4) online algorithm (3) adversarial learning (3) stochastic optimization (3) dueling bandit (1) tsallis entropy (1) stochastic action set (1) adversarial regret (1)

Papers

Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity ICML 2025 Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024 Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits NeurIPS 2023 One Arrow, Two Kills: A Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits AISTATS 2023 Improved Sleeping Bandits with Stochastic Action Sets and Adversarial Rewards ICML 2020 Online combinatorial optimization with stochastic decision sets and adversarial losses NeurIPS 2014