Login / Signup
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds.
Ehsan Emamjomeh-Zadeh
Chen-Yu Wei
Haipeng Luo
David Kempe
Published in:
CoRR (2020)
Keyphrases
</>
online learning
regret bounds
action sets
online convex optimization
reinforcement learning
finite state
e learning
markov decision processes
multi armed bandit
multi agent
state space
active learning
nearest neighbor
machine learning
upper bound
probability distribution
dynamic programming