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:
ALT (2021)
Keyphrases
</>
online learning
regret bounds
action sets
online convex optimization
reinforcement learning
markov decision processes
finite state
state space
multi armed bandit
multi agent
e learning
linear regression
least squares
machine learning
closed form
average cost
active learning