A New Algorithm for Non-stationary Contextual Bandits: Efficient,
Optimal, and Parameter-free

v1v2v3 (latest)

A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free

3 February 2019

ArXiv (abs)PDF HTML

Papers citing "A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free"

17 / 17 papers shown

Title
An Adaptive Method for Weak Supervision with Drifting Data Alessio Mazzetto Reza Esfandiarpoor E. Upfal Stephen H. Bach Stephen H. Bach 120 1 0 02 Jun 2023
Taking a hint: How to leverage loss predictors in contextual bandits? Chen-Yu Wei Haipeng Luo Alekh Agarwal 140 27 0 04 Mar 2020
Learning to Optimize under Non-Stationarity Wang Chi Cheung D. Simchi-Levi Ruihao Zhu 95 139 0 06 Oct 2018
Tracking the Best Expert in Non-stationary Stochastic Environments Chen-Yu Wei Yi-Te Hong Chi-Jen Lu 46 59 0 02 Dec 2017
A Change-Detection based Framework for Piecewise-stationary Multi-Armed Bandit Problem Fang Liu Joohyung Lee Ness B. Shroff 54 117 0 08 Nov 2017
Online Learning for Changing Environments using Coin Betting Kwang-Sung Jun Francesco Orabona S. Wright Rebecca Willett 46 19 0 06 Nov 2017
Efficient Contextual Bandits in Non-stationary Worlds Haipeng Luo Chen-Yu Wei Alekh Agarwal John Langford 70 133 0 05 Aug 2017
Improved Dynamic Regret for Non-degenerate Functions Lijun Zhang Tianbao Yang Jinfeng Yi Jing Rong Zhi Zhou 237 127 0 13 Aug 2016
Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits Vasilis Syrgkanis Haipeng Luo A. Krishnamurthy Robert Schapire 138 42 0 01 Jun 2016
Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradient Tianbao Yang Lijun Zhang Rong Jin Jinfeng Yi 60 156 0 16 May 2016
Efficient Algorithms for Adversarial Contextual Learning Vasilis Syrgkanis A. Krishnamurthy Robert Schapire 148 80 0 08 Feb 2016
BISTRO: An Efficient Relaxation-Based Method for Contextual Bandits Alexander Rakhlin Karthik Sridharan OffRL 362 72 0 06 Feb 2016
The Computational Power of Optimization in Online Learning Elad Hazan Tomer Koren 142 69 0 08 Apr 2015
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 410 510 0 04 Feb 2014
Non-stationary Stochastic Optimization Omar Besbes Y. Gur A. Zeevi 188 435 0 20 Jul 2013
Efficient Optimal Learning for Contextual Bandits Miroslav Dudík Daniel J. Hsu Satyen Kale Nikos Karampatziakis John Langford L. Reyzin Tong Zhang 194 303 0 13 Jun 2011
Contextual Bandit Algorithms with Supervised Learning Guarantees A. Beygelzimer John Langford Lihong Li L. Reyzin Robert Schapire OffRL 199 326 0 22 Feb 2010

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.