Do Less, Get More: Streaming Submodular Maximization with Subsampling
Moran Feldman, Amin Karbasi, Ehsan Kazemi

TL;DR
This paper introduces a novel one-pass streaming algorithm for submodular maximization that uses subsampling to achieve tight approximation guarantees, minimal memory, and low function evaluations, enabling scalable machine learning applications.
Contribution
It presents the first streaming algorithm that combines subsampling with streaming for submodular maximization, offering improved efficiency and scalability.
Findings
Achieves a 4p approximation ratio for monotone functions under p-matchoid constraints.
Uses only O(k) memory and O(km/p) queries per element, significantly reducing resource usage.
Outperforms state-of-the-art algorithms by up to fifty times in video summarization tasks.
Abstract
In this paper, we develop the first one-pass streaming algorithm for submodular maximization that does not evaluate the entire stream even once. By carefully subsampling each element of data stream, our algorithm enjoys the tightest approximation guarantees in various settings while having the smallest memory footprint and requiring the lowest number of function evaluations. More specifically, for a monotone submodular function and a -matchoid constraint, our randomized algorithm achieves a approximation ratio (in expectation) with memory and queries per element ( is the size of the largest feasible solution and is the number of matroids used to define the constraint). For the non-monotone case, our approximation ratio increases only slightly to . To the best or our knowledge, our algorithm is the first that combines the benefits of streaming…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Complexity and Algorithms in Graphs · Internet Traffic Analysis and Secure E-voting
