Fetching the paper…
Reading the bibliography…
In this paper, we investigate the non-stationary combinatorial semi-bandit problem, both in the switching case and in the dynamic case.
On the likelihood that one unknown probability exceeds another in view of the evidence of two samples
William R Thompson · 1933
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Herbert Robbins · 1952
Earlier work this paper cites.
A constructive proof of the representation theorem for polyhedral sets based on fundamental definitions
Hanif D Sherali · 1987
Earlier work this paper cites.
The on-line shortest path problem under partial monitoring
A. György, T. Linder, G. Lugosi, and G. Ottucsák · 2007
Earlier work this paper cites.
On upper-confidence bound policies for switching bandit problems
Aurélien Garivier and Eric Moulines · 2011
Earlier work this paper cites.
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi · 2012
Earlier work this paper cites.
Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
Yi Gai, Bhaskar Krishnamachari, and Rahul Jain · 2012
Earlier work this paper cites.
Combinatorial multi-armed bandit: General framework, results, and applications
Wei Chen, Yajun Wang, and Yang Yuan · 2013
Earlier work this paper cites.
Combinatorial multi-armed bandit and its extension to probabilistically triggered arms
Wei Chen, Yajun Wang, Yang Yuan, and Qinshi Wang · 2013
Earlier work this paper cites.
Taming the monster: A fast and simple algorithm for contextual bandits
Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire · 2014
Earlier work this paper cites.
Regret in online combinatorial optimization
Jean-Yves Audibert, Sébastien Bubeck, and Gábor Lugosi · 2014
Cited alongside, same era.
Stochastic multi-armed-bandit problem with non-stationary rewards
Yonatan Gur, Assaf J. Zeevi, and Omar Besbes · 2014
Cited alongside, same era.
Matroid bandits: Fast combinatorial optimization with learning
Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, and Brian Eriksson · 2014
Cited alongside, same era.
Non-stationary stochastic optimization
Omar Besbes, Yonatan Gur, and Assaf J. Zeevi · 2015
Cited alongside, same era.
Combinatorial bandits revisited
Richard Combes, Mohammad Sadegh Talebi Mazraeh Shahi, Alexandre Proutiere, et al · 2015
Cited alongside, same era.
Tracking the best expert in non-stationary stochastic environments
Chen-Yu Wei, Yi-Te Hong, and Chi-Jen Lu · 2016
Adaptively tracking the best bandit arm with an unknown number of distribution changes
Peter Auer, Pratik Gajane, and Ronald Ortner · 2019
Later among the works it cites.
A new algorithm for non-stationary contextual bandits: Efficient, optimal and parameter-free
Yifang Chen, Chung-Wei Lee, Haipeng Luo, and Chen-Yu Wei · 2019
Later among the works it cites.
Learning to optimize under non-stationarity
Wang Chi Cheung, David Simchi-Levi, and Ruihao Zhu · 2019
Later among the works it cites.
Near-optimal oracle-efficient algorithms for stationary and non-stationary stochastic linear bandits
Baekjin Kim and Ambuj Tewari · 2019
Later among the works it cites.
Weighted linear bandits for non-stationary environments
Yoan Russac, Claire Vernade, and Olivier Cappé · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications
Qinshi Wang and Wei Chen · 2017
Cited alongside, same era.
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2018
Cited alongside, same era.
A change-detection based framework for piecewise-stationary multi-armed bandit problem
Fang Liu, Joohyun Lee, and Ness B. Shroff · 2018
Cited alongside, same era.
Efficient contextual bandits in non-stationary worlds
Haipeng Luo, Chen-Yu Wei, Alekh Agarwal, and John Langford · 2018
Cited alongside, same era.
Finite-time analysis of the multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer
Cited in the paper.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire
Cited in the paper.
Lingda Wang, Huozhi Zhou, Bingcong Li, Lav R Varshney, and Zhizhen Zhao · 2019
Later among the works it cites.
Online second price auction with semi-bandit feedback under the non-stationary setting
Haoyu Zhao and Wei Chen · 2019
Later among the works it cites.
A near-optimal change-detection based algorithm for piecewise-stationary combinatorial semi-bandits
Huozhi Zhou, Lingda Wang, Lav R Varshney, and Ee-Peng Lim · 2019
Later among the works it cites.
Beating stochastic and adversarial semi-bandits optimally and simultaneously
Julian Zimmert, Haipeng Luo, and Chen-Yu Wei · 2019
Later among the works it cites.