Non-monotone Sequential Submodular Maximization
Shaojie Tang, Jing Yuan

TL;DR
This paper addresses the challenge of maximizing a sum of non-monotone submodular functions through sequential selection and ranking of items, extending beyond the traditional monotone assumption to better model real-world scenarios like diversity-aware recommendations.
Contribution
It introduces the first algorithms for non-monotone sequential submodular maximization, covering flexible, fixed-length, and special cases, with empirical validation in video recommendation systems.
Findings
Proposed algorithms outperform baselines in experiments.
Effective in diverse applications like recommendation and assortment optimization.
Validated on real-world video recommendation data.
Abstract
In this paper, we study a fundamental problem in submodular optimization, which is called sequential submodular maximization. Specifically, we aim to select and rank a group of items from a ground set such that the weighted summation of (possibly non-monotone) submodular functions is maximized, here each function takes the first items from this sequence as input. The existing research on sequential submodular maximization has predominantly concentrated on the monotone setting, assuming that the submodular functions are non-decreasing. However, in various real-world scenarios, like diversity-aware recommendation systems, adding items to an existing set might negatively impact the overall utility. In response, this paper pioneers the examination of the aforementioned problem with non-monotone submodular functions and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsComplexity and Algorithms in Graphs · Smart Parking Systems Research · Privacy-Preserving Technologies in Data
