Online Learning for Non-monotone DR-Submodular Maximization: From Full Information to Bandit Feedback

Abstract: In this paper, we revisit the online non-monotone continuous DR-submodular maximization problem over a down-closed convex set, which finds wide real-world applications in the domain of machine lear...
0 Replies
Loading