Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models

Abstract

Distributed maximization of a submodular function in the MapReduce (MR) model has received much attention, culminating in two frameworks that allow a centralized algorithm to be run in the MR setting without loss of approximation, as long as the centralized algorithm satisfies a certain consistency property -- which had previously only been known to be satisfied by the standard greedy and continous greedy algorithms. A separate line of work has studied parallelizability of submodular maximization in the adaptive complexity model, where each thread may have access to the entire ground set. For the size-constrained maximization of a monotone and submodular function, we show that several sublinearly adaptive (highly parallelizable) algorithms satisfy the consistency property required to work in the MR setting, which yields practical, parallelizable and distributed algorithms. Separately, we develop the first distributed algorithm with linear query complexity for this problem. Finally, we provide a method to increase the maximum cardinality constraint for MR algorithms at the cost of additional MR rounds.

References in corpus (9)

• One Million Scenes for Autonomous Driving: ONCE Dataset
• Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
• Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity
• Regularized Submodular Maximization at Scale
• The FAST Algorithm for Submodular Maximization
• Parallel Algorithm for Non-Monotone DR-Submodular Maximization
• Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
• Quick Streaming Algorithms for Maximization of Monotone Submodular Functions in Linear Time
• Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint