Ranking with submodular functions on the fly
Guangyi Zhang, Nikolaj Tatti, Aristides Gionis

TL;DR
This paper extends the maximum submodular ranking framework to streaming models, proposing algorithms for function and item arriving scenarios, with applications and empirical evaluations for sequence-ranking problems under constraints.
Contribution
It introduces streaming algorithms for MSR with function and item arriving models, broadening applicability and including constraints like matroids for fair exposure.
Findings
Proposed practical approximation algorithms for streaming MSR.
Extended MSR framework to include constraints such as matroids.
Empirical evaluation demonstrating effectiveness of the algorithms.
Abstract
Maximizing submodular functions have been studied extensively for a wide range of subset-selection problems. However, much less attention has been given to the role of submodularity in sequence-selection and ranking problems. A recently-introduced framework, named \emph{maximum submodular ranking} (MSR), tackles a family of ranking problems that arise naturally when resources are shared among multiple demands with different budgets. For example, the MSR framework can be used to rank web pages for multiple user intents. In this paper, we extend the MSR framework in the streaming setting. In particular, we consider two different streaming models and we propose practical approximation algorithms. In the first streaming model, called \emph{function arriving}, we assume that submodular functions (demands) arrive continuously in a stream, while in the second model, called \emph{item…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Game Theory and Voting Systems · Optimization and Search Problems
