Login / Signup
Breaking the $\sqrt{T}$ Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits.
Avishek Ghosh
Abishek Sankararaman
Published in:
ICML (2022)
Keyphrases
</>
regret bounds
online learning
lower bound
linear regression
expert advice
multi armed bandit
online convex optimization
upper bound
contextual information
least squares
context sensitive
bregman divergences
neural network
support vector
markov decision processes