no code implementations • 15 Jun 2021 • Omid Sadeghi, Prasanna Raut, Maryam Fazel
For $(1)$, we obtain the first logarithmic regret bounds.
no code implementations • NeurIPS 2020 • Omid Sadeghi, Prasanna Raut, Maryam Fazel
In this paper, we consider an online optimization problem in which the reward functions are DR-submodular, and in addition to maximizing the total reward, the sequence of decisions must satisfy some convex constraints on average.
