ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2401.09278
  4. Cited By
Adaptive Regret for Bandits Made Possible: Two Queries Suffice

Adaptive Regret for Bandits Made Possible: Two Queries Suffice

17 January 2024
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
108
1,922
0
07 Sep 2019
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
124
177
0
25 Feb 2015
1