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. 1606.00313
  4. Cited By
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits

Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits

1 June 2016
Vasilis Syrgkanis
Haipeng Luo
A. Krishnamurthy
Robert Schapire
ArXivPDFHTML

Papers citing "Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits"

6 / 6 papers shown
Title
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
Masahiro Kato
Shinji Ito
83
0
0
05 Mar 2024
Taking a hint: How to leverage loss predictors in contextual bandits?
Taking a hint: How to leverage loss predictors in contextual bandits?
Chen-Yu Wei
Haipeng Luo
Alekh Agarwal
67
27
0
04 Mar 2020
Efficient Algorithms for Adversarial Contextual Learning
Efficient Algorithms for Adversarial Contextual Learning
Vasilis Syrgkanis
A. Krishnamurthy
Robert Schapire
75
79
0
08 Feb 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits
Alexander Rakhlin
Karthik Sridharan
OffRL
164
72
0
06 Feb 2016
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
Alekh Agarwal
Daniel J. Hsu
Satyen Kale
John Langford
Lihong Li
Robert Schapire
OffRL
192
504
0
04 Feb 2014
Efficient Optimal Learning for Contextual Bandits
Efficient Optimal Learning for Contextual Bandits
Miroslav Dudík
Daniel J. Hsu
Satyen Kale
Nikos Karampatziakis
John Langford
L. Reyzin
Tong Zhang
118
300
0
13 Jun 2011
1