Self-Concordant Analysis of Generalized Linear Bandits with Forgetting

2 November 2020

Papers citing "Self-Concordant Analysis of Generalized Linear Bandits with Forgetting"

8 / 8 papers shown

Title
Near Optimal Pure Exploration in Logistic Bandits Eduardo Ochoa Rivera Ambuj Tewari 60 0 0 28 Oct 2024
A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits Junghyun Lee Se-Young Yun Kwang-Sung Jun 120 5 0 19 Jul 2024
A Simple Approach for Non-stationary Linear Bandits Peng Zhao Lijun Zhang Yuan Jiang Zhi Zhou 54 84 0 09 Mar 2021
Improved Optimistic Algorithms for Logistic Bandits Louis Faury Marc Abeille Clément Calauzènes Olivier Fercoq 70 93 0 18 Feb 2020
Weighted Linear Bandits for Non-Stationary Environments Yoan Russac Claire Vernade Olivier Cappé 120 107 0 19 Sep 2019
A Near-Optimal Change-Detection Based Algorithm for Piecewise-Stationary Combinatorial Semi-Bandits Huozhi Zhou Lingda Wang Lav Varshney Ee-Peng Lim 46 19 0 27 Aug 2019
A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-free Yifang Chen Chung-Wei Lee Haipeng Luo Chen-Yu Wei 101 133 0 03 Feb 2019
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit Yang Cao Zheng Wen Branislav Kveton Yao Xie 57 95 0 11 Feb 2018