DeepAI AI Chat
Log In Sign Up

DASH: Distributed Adaptive Sequencing Heuristic for Submodular Maximization

by   Tonmoy Dey, et al.

The development of parallelizable algorithms for monotone, submodular maximization subject to cardinality constraint (SMCC) has resulted in two separate research directions: centralized algorithms with low adaptive complexity, which require random access to the entire dataset; and distributed MapReduce (MR) model algorithms, that use a small number of MR rounds of computation. Currently, no MR model algorithm is known to use sublinear number of adaptive rounds which limits their practical performance. We study the SMCC problem in a distributed setting and present three separate MR model algorithms that introduce sublinear adaptivity in a distributed setup. Our primary algorithm, DASH achieves an approximation of 1/2(1-1/e-ε) using one MR round, while its multi-round variant METADASH enables MR model algorithms to be run on large cardinality constraints that were previously not possible. The two additional algorithms, T-DASH and G-DASH provide an improved ratio of (3/8-ε) and (1-1/e-ε) respectively using one and (1/ε) MR rounds . All our proposed algorithms have sublinear adaptive complexity and we provide extensive empirical evidence to establish: DASH is orders of magnitude faster than the state-of-the-art distributed algorithms while producing nearly identical solution values; and validate the versatility of DASH in obtaining feasible solutions on both centralized and distributed data.


page 1

page 2

page 3

page 4


A polynomial lower bound on adaptive complexity of submodular maximization

In large-data applications, it is desirable to design algorithms with a ...

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization

We study parallelizable algorithms for maximization of a submodular func...

Learning MR-Sort Models from Non-Monotone Data

The Majority Rule Sorting (MR-Sort) method assigns alternatives evaluate...

Parallel Algorithm for Non-Monotone DR-Submodular Maximization

In this work, we give a new parallel algorithm for the problem of maximi...

The FAST Algorithm for Submodular Maximization

In this paper we describe a new algorithm called Fast Adaptive Sequencin...

Federated Learning with Fair Worker Selection: A Multi-Round Submodular Maximization Approach

In this paper, we study the problem of fair worker selection in Federate...