2019
Exponential Weights on the Hypercube in Polynomial Time
AISTATS 2019poster
We study a general online linear optimization problem(OLO). At each round, a subset of objects from a fixed universe of $n$ objects is chosen, and a linear cost associated with the chosen subset is incurred. To measure the performance of our algorithms, we use the notion of regret which is the diffe…