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. 2003.01922
  4. Cited By
Taking a hint: How to leverage loss predictors in contextual bandits?

Taking a hint: How to leverage loss predictors in contextual bandits?

4 March 2020
Chen-Yu Wei
Haipeng Luo
Alekh Agarwal
ArXivPDFHTML

Papers citing "Taking a hint: How to leverage loss predictors in contextual bandits?"

21 / 21 papers shown
Title
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
Catoni Contextual Bandits are Robust to Heavy-tailed Rewards
Chenlu Ye
Yujia Jin
Alekh Agarwal
Tong Zhang
152
0
0
04 Feb 2025
Mean estimation and regression under heavy-tailed distributions--a
  survey
Mean estimation and regression under heavy-tailed distributions--a survey
Gabor Lugosi
S. Mendelson
81
241
0
10 Jun 2019
Equipping Experts/Bandits with Long-term Memory
Equipping Experts/Bandits with Long-term Memory
Kai Zheng
Haipeng Luo
Ilias Diakonikolas
Liwei Wang
OffRL
36
15
0
30 May 2019
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and
  Adapting
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting
A. Krishnamurthy
John Langford
Aleksandrs Slivkins
Chicheng Zhang
OffRL
79
66
0
05 Feb 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient,
  Optimal, and Parameter-free
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free
Yifang Chen
Chung-Wei Lee
Haipeng Luo
Chen-Yu Wei
69
132
0
03 Feb 2019
Improved Path-length Regret Bounds for Bandits
Improved Path-length Regret Bounds for Bandits
Sébastien Bubeck
Yuanzhi Li
Haipeng Luo
Chen-Yu Wei
54
46
0
29 Jan 2019
Make the Minority Great Again: First-Order Regret Bound for Contextual
  Bandits
Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits
Zeyuan Allen-Zhu
Sébastien Bubeck
Yuanzhi Li
LRM
82
30
0
09 Feb 2018
More Adaptive Algorithms for Adversarial Bandits
More Adaptive Algorithms for Adversarial Bandits
Chen-Yu Wei
Haipeng Luo
79
181
0
10 Jan 2018
Tracking the Best Expert in Non-stationary Stochastic Environments
Tracking the Best Expert in Non-stationary Stochastic Environments
Chen-Yu Wei
Yi-Te Hong
Chi-Jen Lu
20
59
0
02 Dec 2017
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Vasilis Syrgkanis
Haipeng Luo
A. Krishnamurthy
Robert Schapire
76
42
0
01 Jun 2016
Efficient Algorithms for Adversarial Contextual Learning
Efficient Algorithms for Adversarial Contextual Learning
Vasilis Syrgkanis
A. Krishnamurthy
Robert Schapire
75
79
0
08 Feb 2016
Fast Convergence of Regularized Learning in Games
Fast Convergence of Regularized Learning in Games
Vasilis Syrgkanis
Alekh Agarwal
Haipeng Luo
Robert Schapire
42
253
0
02 Jul 2015
The Computational Power of Optimization in Online Learning
The Computational Power of Optimization in Online Learning
Elad Hazan
Tomer Koren
78
68
0
08 Apr 2015
Doubly Robust Policy Evaluation and Optimization
Doubly Robust Policy Evaluation and Optimization
Miroslav Dudík
D. Erhan
John Langford
Lihong Li
OffRL
122
285
0
10 Mar 2015
Strongly Adaptive Online Learning
Strongly Adaptive Online Learning
Amit Daniely
Alon Gonen
Shai Shalev-Shwartz
ODL
103
177
0
25 Feb 2015
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
194
504
0
04 Feb 2014
Optimization, Learning, and Games with Predictable Sequences
Optimization, Learning, and Games with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
59
377
0
08 Nov 2013
Online Learning with Predictable Sequences
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
114
355
0
18 Aug 2012
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
Challenging the empirical mean and empirical variance: a deviation study
Challenging the empirical mean and empirical variance: a deviation study
O. Catoni
107
462
0
10 Sep 2010
Contextual Bandit Algorithms with Supervised Learning Guarantees
Contextual Bandit Algorithms with Supervised Learning Guarantees
A. Beygelzimer
John Langford
Lihong Li
L. Reyzin
Robert Schapire
OffRL
139
324
0
22 Feb 2010
1