Improved algorithms for linear stochastic bandits, Advances in Neural Information Processing Systems, pp.2312-2320, 2011. ,
Using confidence bounds for exploitation-exploration trade-offs, Journal of Machine Learning Research, vol.3, pp.397-422, 2002. ,
Adaptively tracking the best arm with an unknown number of distribution changes, European Workshop on Reinforcement Learning, vol.14, 2018. ,
Stochastic multi-armed-bandit problem with non-stationary rewards, Advances in neural information processing systems, pp.199-207, 2014. ,
Non-stationary stochastic optimization, Operations research, vol.63, issue.5, pp.1227-1244, 2015. ,
Optimal exploration-exploitation in a multi-armed-bandit problem with non-stationary rewards. Available at SSRN 2436629, 2018. ,
The generalized likelihood ratio test meets klucb: an improved algorithm for piece-wise non-stationary bandits, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02006471
The group fused lasso for multiple change-point detection, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00602121
Nearly optimal adaptive procedure for piecewisestationary bandit: a change-point detection approach, 2018. ,
, A new algorithm for non-stationary contextual bandits: Efficient, optimal, and parameter-free, 2019.
, Learning to optimize under non-stationarity, 2018.
Hedging the drift: Learning to optimize under non-stationarity, 2019. ,
Attribution modeling increases efficiency of bidding in display advertising, Proceedings of the AdKDD and TargetAd Workshop, 2017. ,
On upper-confidence bound policies for switching bandit problems, International Conference on Algorithmic Learning Theory, pp.174-188, 2011. ,
A linear response bandit problem, Stoch. Syst, vol.3, issue.1, pp.230-261, 2013. ,
Thompson sampling for dynamic multi-armed bandits, 10th International Conference on Machine Learning and Applications and Workshops, vol.1, 2011. ,
Chasing demand: Learning and earning in a changing environment, Mathematics of Operations Research, vol.42, issue.2, pp.277-307, 2017. ,
Information directed sampling and bandits with heteroscedastic noise, 2018. ,
Discounted ucb, 2nd Pascal Challenge Workshop, 2006. ,
, Bandit Algorithms, 2019.
Rotting bandits, Advances in Neural Information Processing Systems, pp.3074-3083, 2017. ,
A contextual-bandit approach to personalized news article recommendation, 2010. ,
, Efficient contextual bandits in non-stationary worlds, 2017.
, Non-stationary bandits with habituation and recovery dynamics, 2017.
Self-normalized processes: Limit theory and Statistical Applications, 2008. ,
, Taming non-stationary bandits: A bayesian approach, 2017.
Rotting bandits are no harder than stochastic ones, 2018. ,
On abruptly-changing and slowly-varying multiarmed bandit problems, 2018 Annual American Control Conference (ACC), pp.6291-6296, 2018. ,
Learning contextual bandits in a non-stationary environment, The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR '18, pp.495-504, 2018. ,
Piecewise-stationary bandit problems with side observations, Proceedings of the 26th Annual International Conference on Machine Learning, pp.1177-1184, 2009. ,