conftrace_

expected regret

11 papers

Explore in graph

Co-occurring keywords · papers mentioning both

multi-armed bandit (5) regret bound (4) worst-case optimality (2) online algorithm (2) risk management (2) real-time planning (1) optimal action (1) exponential decay (1) instance-dependent consistency (1) heavy-tailed risk (1)

Papers

A Trichotomy for List Transductive Online Learning ICML 2025 Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization ICML 2024 On Multi-Armed Bandit with Impatient Arms ICML 2024 Stochastic Multi-armed Bandits: Optimal Trade-off among Optimality, Consistency, and Tail Risk NeurIPS 2023 A Simple and Optimal Policy Design for Online Learning with Safety against Heavy-tailed Risk NeurIPS 2022 Expected Regret and Pseudo-Regret are Equivalent When the Optimal Arm is Unique JMLR 2022 Improved Regret Bounds for Projection-free Bandit Convex Optimization AISTATS 2020 A Thompson Sampling Algorithm for Cascading Bandits AISTATS 2019 Real-Time Planning as Decision-Making under Uncertainty AAAI 2019 Optimization, fast and slow: optimally switching between local and Bayesian optimization ICML 2018 Algorithms for Infinitely Many-Armed Bandits NeurIPS 2008