Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition.
Lin ChenQian YuHannah LawrenceAmin KarbasiPublished in: CoRR (2019)
Keyphrases
- phase transition
- minimax regret
- online convex optimization
- constraint satisfaction
- preference elicitation
- decision problems
- np complete
- online learning
- utility function
- cellular automata
- long run
- convex optimization
- misclassification costs
- constraint satisfaction problems
- computational complexity
- cost sensitive
- reward function
- cost function
- evolutionary algorithm