Dueling Optimization with a Monotone Adversary

Avrim Blum, Meghal Gupta, Gene Li +3

We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an…