ResearchTrend.AI
Adaptive Regret for Bandits Made Possible: Two Queries Suffice

Adaptive Regret for Bandits Made Possible: Two Queries Suffice

Zhou Lu
Qiuyi Zhang
Xinyi Chen
Fred Zhang
David P. Woodruff
Elad Hazan
ArXivPDFHTML

Papers citing "Adaptive Regret for Bandits Made Possible: Two Queries Suffice"

3 / 3 papers shown
Title
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond
Dheeraj Baby
Yu Wang
66
26
0
21 Jan 2022
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
104
1,922
0
07 Sep 2019
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
122
177
0
25 Feb 2015

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.