DeepAI AI Chat
Log In Sign Up

Scaling Submodular Maximization via Pruned Submodularity Graphs

by   Tianyi Zhou, et al.
University of Washington

We propose a new random pruning method (called "submodular sparsification (SS)") to reduce the cost of submodular maximization. The pruning is applied via a "submodularity graph" over the n ground elements, where each directed edge is associated with a pairwise dependency defined by the submodular function. In each step, SS prunes a 1-1/√(c) (for c>1) fraction of the nodes using weights on edges computed based on only a small number (O( n)) of randomly sampled nodes. The algorithm requires _√(c)n steps with a small and highly parallelizable per-step computation. An accuracy-speed tradeoff parameter c, set as c = 8, leads to a fast shrink rate √(2)/4 and small iteration complexity _2√(2)n. Analysis shows that w.h.p., the greedy algorithm on the pruned set of size O(^2 n) can achieve a guarantee similar to that of processing the original dataset. In news and video summarization tasks, SS is able to substantially reduce both computational costs and memory usage, while maintaining (or even slightly exceeding) the quality of the original (and much more costly) greedy algorithm.


Stream Clipper: Scalable Submodular Maximization on Stream

Applying submodular maximization in the streaming setting is nontrivial ...

Robust Sequence Networked Submodular Maximization

In this paper, we study the Robust optimization for sequence Networked s...

The Power of Subsampling in Submodular Maximization

We propose subsampling as a unified algorithmic technique for submodular...

Learning Mixtures of Submodular Shells with Application to Document Summarization

We introduce a method to learn a mixture of submodular "shells" in a lar...

Submodular Maximization Under A Matroid Constraint: Asking more from an old friend, the Greedy Algorithm

The classical problem of maximizing a submodular function under a matroi...

Submodular Maximization with Limited Function Access

We consider a class of submodular maximization problems in which decisio...

Scaling Submodular Optimization Approaches for Control Applications in Networked Systems

Often times, in many design problems, there is a need to select a small ...