Stream Clipper: Scalable Submodular Maximization on Stream
Tianyi Zhou, Jeff Bilmes

TL;DR
Stream Clipper is a scalable streaming algorithm for submodular maximization that achieves near-offline performance in document/video summarization by adaptively managing elements with thresholds and buffer, balancing efficiency and quality.
Contribution
It introduces an adaptive threshold streaming algorithm that matches offline greedy performance under certain conditions, with improved efficiency for summarization tasks.
Findings
Outperforms other streaming methods in summarization quality
Uses less computation and memory than offline algorithms
Achieves approximation factors close to the theoretical bound in practice
Abstract
We propose a streaming submodular maximization algorithm "stream clipper" that performs as well as the offline greedy algorithm on document/video summarization in practice. It adds elements from a stream either to a solution set or to an extra buffer based on two adaptive thresholds, and improves by a final greedy step that starts from adding elements from . During this process, swapping elements out of can occur if doing so yields improvements. The thresholds adapt based on if current memory utilization exceeds a budget, e.g., it increases the lower threshold, and removes from the buffer elements below the new lower threshold. We show that, while our approximation factor in the worst case is (like in previous work, and corresponding to the tight bound), we show that there are data-dependent conditions where our bound falls within the range $[1/2,…
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
TopicsComplexity and Algorithms in Graphs · Algorithms and Data Compression · Internet Traffic Analysis and Secure E-voting
