No-regret algorithms for online $k$-submodular maximization.

Published in: AISTATS (2019)

Keyphrases

online algorithms
online learning
worst case
significant improvement
optimization problems
learning algorithm
objective function
lower bound
genetic algorithm
computationally efficient
computational efficiency
regret minimization