ResearchTrend.AI
Near-optimal Per-Action Regret Bounds for Sleeping Bandits
v1v2 (latest)

Near-optimal Per-Action Regret Bounds for Sleeping Bandits

Quan Nguyen
Nishant A. Mehta
ArXiv (abs)PDFHTML

Papers citing "Near-optimal Per-Action Regret Bounds for Sleeping Bandits"

7 / 7 papers shown
Title
Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
Beyond Minimax Rates in Group Distributionally Robust Optimization via a Novel Notion of Sparsity
Quan Nguyen
Nishant A. Mehta
Cristóbal Guzmán
236
2
0
01 Oct 2024
Efficient Contextual Bandits in Non-stationary Worlds
Efficient Contextual Bandits in Non-stationary Worlds
Haipeng Luo
Chen-Yu Wei
Alekh Agarwal
John Langford
91
133
0
05 Aug 2017
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
Gergely Neu
405
185
0
10 Jun 2015
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
172
178
0
25 Feb 2015
Prediction with Advice of Unknown Number of Experts
Prediction with Advice of Unknown Number of Experts
A. Chernov
V. Vovk
427
45
0
09 Aug 2014
A Second-order Bound with Excess Losses
A Second-order Bound with Excess Losses
Pierre Gaillard
Gilles Stoltz
T. Erven
83
154
0
10 Feb 2014
Prediction with expert evaluators' advice
Prediction with expert evaluators' advice
A. Chernov
V. Vovk
308
39
0
24 Feb 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.