Published: 01 Jan 2019, Last Modified: 09 May 2023AISTATS 2019Readers: Everyone
Abstract: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...