Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1606.00313
Cited By
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits
Neural Information Processing Systems (NeurIPS), 2016
1 June 2016
Vasilis Syrgkanis
Haipeng Luo
A. Krishnamurthy
Robert Schapire
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits"
28 / 28 papers shown
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
Masahiro Kato
Shinji Ito
587
2
0
05 Mar 2024
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits
Neural Information Processing Systems (NeurIPS), 2023
Haolin Liu
Chen-Yu Wei
Julian Zimmert
297
14
0
02 Sep 2023
Incentivizing High-Quality Content in Online Recommender Systems
Xinyan Hu
Meena Jagadeesan
Sai Li
Jacob Steinhard
417
14
0
13 Jun 2023
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability
Aadirupa Saha
A. Krishnamurthy
312
43
0
24 Nov 2021
Contextual Games: Multi-Agent Learning with Side Information
Pier Giuseppe Sessa
Ilija Bogunovic
Andreas Krause
Maryam Kamgarpour
239
24
0
13 Jul 2021
Boosting for Online Convex Optimization
International Conference on Machine Learning (ICML), 2021
Elad Hazan
Karan Singh
OffRL
179
11
0
18 Feb 2021
Adversarial Linear Contextual Bandits with Graph-Structured Side Observations
AAAI Conference on Artificial Intelligence (AAAI), 2020
Lingda Wang
Bingcong Li
Huozhi Zhou
G. Giannakis
Lav Varshney
Zhizhen Zhao
321
9
0
10 Dec 2020
Taking a hint: How to leverage loss predictors in contextual bandits?
Annual Conference Computational Learning Theory (COLT), 2020
Chen-Yu Wei
Haipeng Luo
Alekh Agarwal
356
30
0
04 Mar 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles
International Conference on Machine Learning (ICML), 2020
Dylan J. Foster
Alexander Rakhlin
673
240
0
12 Feb 2020
Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting
Ziping Xu
Ambuj Tewari
325
12
0
06 Feb 2020
Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits
Annual Conference Computational Learning Theory (COLT), 2020
Gergely Neu
Julia Olkhovskaya
470
53
0
01 Feb 2020
Fair Contextual Multi-Armed Bandits: Theory and Experiments
Conference on Uncertainty in Artificial Intelligence (UAI), 2019
Yifang Chen
Alex Cuellar
Haipeng Luo
Jignesh Modi
Heramb Nemlekar
Stefanos Nikolaidis
FaML
259
66
0
13 Dec 2019
Online Pricing with Reserve Price Constraint for Personal Data Markets
IEEE Transactions on Knowledge and Data Engineering (TKDE), 2019
Chaoyue Niu
Zhenzhe Zheng
Fan Wu
Shaojie Tang
Guihai Chen
177
42
0
28 Nov 2019
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits
International Conference on Artificial Intelligence and Statistics (AISTATS), 2019
Niladri S. Chatterji
Vidya Muthukumar
Peter L. Bartlett
273
48
0
24 May 2019
Introduction to Multi-Armed Bandits
Aleksandrs Slivkins
1.6K
1,218
0
15 Apr 2019
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
A. Beygelzimer
D. Pál
Balazs Szorenyi
D. Thiruvenkatachari
Chen-Yu Wei
Chicheng Zhang
238
14
0
06 Feb 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free
Yifang Chen
Chung-Wei Lee
Haipeng Luo
Chen-Yu Wei
367
143
0
03 Feb 2019
Adversarial Bandits with Knapsacks
Nicole Immorlica
Karthik Abinav Sankararaman
Robert Schapire
Aleksandrs Slivkins
764
131
0
28 Nov 2018
Contextual bandits with surrogate losses: Margin bounds and efficient algorithms
Neural Information Processing Systems (NeurIPS), 2018
Dylan J. Foster
A. Krishnamurthy
395
19
0
28 Jun 2018
Online Learning via the Differential Privacy Lens
Jacob D. Abernethy
Young Hun Jung
Chansoo Lee
Audra McMillan
Ambuj Tewari
337
14
0
27 Nov 2017
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm
Tongyi Cao
A. Krishnamurthy
230
8
0
21 Nov 2017
Small-loss bounds for online learning with partial information
Thodoris Lykouris
Karthik Sridharan
Éva Tardos
331
42
0
09 Nov 2017
Efficient Contextual Bandits in Non-stationary Worlds
Haipeng Luo
Chen-Yu Wei
Alekh Agarwal
John Langford
391
152
0
05 Aug 2017
Adversarial Ranking for Language Generation
Neural Information Processing Systems (NeurIPS), 2017
Kevin Qinghong Lin
Dianqi Li
Xiaodong He
Zhengyou Zhang
Ming-Ting Sun
GAN
419
349
0
31 May 2017
Efficient Online Bandit Multiclass Learning with
O
~
(
T
)
\tilde{O}(\sqrt{T})
O
~
(
T
)
Regret
International Conference on Machine Learning (ICML), 2017
A. Beygelzimer
Francesco Orabona
Chicheng Zhang
290
21
0
25 Feb 2017
Corralling a Band of Bandit Algorithms
Annual Conference Computational Learning Theory (COLT), 2016
Alekh Agarwal
Haipeng Luo
Behnam Neyshabur
Robert Schapire
452
170
0
19 Dec 2016
Oracle-Efficient Online Learning and Auction Design
Miroslav Dudík
Nika Haghtalab
Haipeng Luo
Robert Schapire
Vasilis Syrgkanis
Jennifer Wortman Vaughan
240
67
0
05 Nov 2016
Risk-Aware Algorithms for Adversarial Contextual Bandits
Wen Sun
Debadeepta Dey
Ashish Kapoor
159
2
0
17 Oct 2016
1
Page 1 of 1
