no code implementations • 25 Sep 2019 • Nguyen Kim Thang, Abhinav Srivastav
First, we present an online algorithm that achieves a $1/e$-approximation ratio with the regret of $O(T^{2/3})$ for maximizing DR-submodular functions over any down-closed convex set.
no code implementations • 23 May 2019 • Christoph Dürr, Nguyen Kim Thang, Abhinav Srivastav, Léo Tible
In this paper, we study the fundamental problem of maximizing non-monotone DR-submodular functions over down-closed and general convex sets in both offline and online settings.