Refined approachability algorithms and application to regret minimization with global costs.

Published in: J. Mach. Learn. Res. (2021)

Keyphrases

regret minimization
computational cost
computational complexity
learning algorithm
data structure
worst case
computationally efficient
theoretical analysis
machine learning
artificial intelligence
significant improvement
state space
utility function
nash equilibrium
optimal control