conftrace_

logistic bandit

8 papers

Explore in graph

Co-occurring keywords

regret bound (1926) multi-armed bandit (1098) online learning (1777) confidence set (26) generalized linear model (138) regret minimization (315) computational efficiency (362) optimal algorithm (26) confidence sequence (16) problem-dependent guarantee (1)

Papers

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion AISTATS 2024
A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits NIPS 2024
Online (Multinomial) Logistic Bandit: Improved Regret and Constant Computation Cost NIPS 2023
Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022
An Experimental Design Approach for Regret Minimization in Logistic Bandits AAAI 2022
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits AISTATS 2021
Improved Optimistic Algorithms for Logistic Bandits ICML 2020
On the Performance of Thompson Sampling on Logistic Bandits COLT 2019