DeepAI
Log In Sign Up

Fully Dynamic Algorithm for Constrained Submodular Optimization

06/08/2020
by   Silvio Lattanzi, et al.
0

The task of maximizing a monotone submodular function under a cardinality constraint is at the core of many machine learning and data mining applications, including data summarization, sparse regression and coverage problems. We study this classic problem in the fully dynamic setting, where elements can be both inserted and removed. Our main result is a randomized algorithm that maintains an efficient data structure with a poly-logarithmic amortized update time and yields a (1/2-ϵ)-approximate solution. We complement our theoretical analysis with an empirical study of the performance of our algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/18/2022

Sparsification of Decomposable Submodular Functions

Submodular functions are at the core of many machine learning and data m...
09/02/2020

Fully-Dynamic Submodular Cover with Bounded Recourse

In submodular covering problems, we are given a monotone, nonnegative su...
10/25/2022

Efficient and Stable Fully Dynamic Facility Location

We consider the classic facility location problem in fully dynamic data ...
11/05/2021

On the Complexity of Dynamic Submodular Maximization

We study dynamic algorithms for the problem of maximizing a monotone sub...
06/10/2020

Variational Optimization for the Submodular Maximum Coverage Problem

We examine the submodular maximum coverage problem (SMCP), which is rela...
02/18/2021

Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression

The concept of weak submodularity and the related submodularity ratio co...
04/30/2019

Categorical Feature Compression via Submodular Optimization

In the era of big data, learning from categorical features with very lar...