Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits.

Shubham Gupta Aadirupa Saha

Published in: CoRR (2021)

Keyphrases

non stationary
adaptive algorithms
worst case
computationally efficient
multi armed bandit
computational complexity
regret bounds
multiscale
online learning
computer vision
expert advice
regret minimization
image processing
dynamic programming
loss function
bandit problems