Login / Signup
Optimal Non-Asymptotic Lower Bound on the Minimax Regret of Learning with Expert Advice.
Francesco Orabona
Dávid Pál
Published in:
CoRR (2015)
Keyphrases
</>
lower bound
expert advice
upper bound
worst case
minimax regret
optimal solution
learning process
online learning
learning problems
learning algorithm
bayesian networks
pairwise
np hard
dynamic programming
supervised learning