
Streaming Submodular Maximization with Fairness Constraints
We study the problem of extracting a small subset of representative item...
read it

Distributed Submodular Maximization
Many largescale machine learning problemsclustering, nonparametric l...
read it

Submodular Optimization Over Streams with Inhomogeneous Decays
Cardinality constrained submodular function maximization, which aims to ...
read it

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach
We study the classical problem of maximizing a monotone submodular funct...
read it

Stream Clipper: Scalable Submodular Maximization on Stream
Applying submodular maximization in the streaming setting is nontrivial ...
read it

Robust Algorithms under Adversarial Injections
In this paper, we study streaming and online algorithms in the context o...
read it

ApproximateClosedItemset Mining for Streaming Data Under Resource Constraint
Here, we present a novel algorithm for frequent itemset mining for strea...
read it
Beyond 1/2Approximation for Submodular Maximization on Massive Data Streams
Many tasks in machine learning and data mining, such as data diversification, nonparametric learning, kernel machines, clustering etc., require extracting a small but representative summary from a massive dataset. Often, such problems can be posed as maximizing a submodular set function subject to a cardinality constraint. We consider this question in the streaming setting, where elements arrive over time at a fast pace and thus we need to design an efficient, lowmemory algorithm. One such method, proposed by Badanidiyuru et al. (2014), always finds a 0.5approximate solution. Can this approximation factor be improved? We answer this question affirmatively by designing a new algorithm SALSA for streaming submodular maximization. It is the first lowmemory, singlepass algorithm that improves the factor 0.5, under the natural assumption that elements arrive in a random order. We also show that this assumption is necessary, i.e., that there is no such algorithm with better than 0.5approximation when elements arrive in arbitrary order. Our experiments demonstrate that SALSA significantly outperforms the state of the art in applications related to exemplarbased clustering, social graph analysis, and recommender systems.
READ FULL TEXT
Comments
There are no comments yet.