Corpus ID: 220487060

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

@article{Amanatidis2020FastAN,
  title={Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint},
  author={Georgios Amanatidis and Federico Fusco and Philip Lazos and S. Leonardi and Rebecca Reiffenhauser},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.05014}
}
Constrained submodular maximization problems encompass a wide variety of applications, including personalized recommendation, team formation, and revenue maximization via viral marketing. The massive instances occurring in modern day applications can render existing algorithms prohibitively slow, while frequently, those instances are also inherently stochastic. Focusing on these challenges, we revisit the classic problem of maximizing a (possibly non-monotone) submodular function subject to a… Expand
The Power of Randomization: Efficient and Effective Algorithms for Constrained Submodular Maximization
TLDR
This paper proposes several randomized algorithms that improve upon the state-of-the-art algorithms in terms of approximation ratio and time complexity, both under the non-adaptive setting and the adaptive setting. Expand
Randomized Algorithms for Submodular Function Maximization with a k-System Constraint
TLDR
This paper proposes a randomized algorithm with an improved approximation ratio of (1 + √ k), while achieving nearlylinear time complexity significantly lower than that of the state-of-the-art algorithm. Expand
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
TLDR
This work obtains the first constant factor approximation algorithm for non-monotone submodular maximization subject to a knapsack constraint with nearoptimal O(log n) adaptive complexity and is also the first combinatorial approach with sublinear adaptive complexity for the problem. Expand
Beyond Pointwise Submodularity: Non-Monotone Adaptive Submodular Maximization subject to Knapsack and $k$-System Constraints
  • Shaojie Tang
  • Computer Science
  • 2021
TLDR
Inspired by two recent studies on non-monotone adaptive submodular maximization, a sampling-based randomized algorithm is developed that achieves a 1 10 approximation for the case of a knapsack constraint and a 1 2k+4 approximation ratio for the cases of a k-system constraint. Expand
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint
TLDR
This work considers the fundamental problem of (non-monotone) submodular function maximization with a knapsack constraint, and proposes simple yet effective and efficient algorithms for it that achieve the best performance bounds compared to the state-of-the-art approximation algorithms with efficient implementation for the same problem. Expand
Robust Adaptive Submodular Maximization
  • Shaojie Tang
  • Computer Science, Mathematics
  • ArXiv
  • 2021
TLDR
A new class of stochastic functions, called worst-case submodular function, is introduced, which achieves an approximation close to 1− e 1 2 under both worst case setting and average case setting simultaneously. Expand
Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies
TLDR
A new approach is introduced to relate the greedy non-adaptive algorithm to the adaptive optimum, which does not rely on multi-linear extensions or random walks on optimal decision trees, and may be used to analyze other adaptive optimization problems. Expand
A Sample Decreasing Threshold Greedy-Based Algorithm for Big Data Summarisation
As the scales of datasets expand rapidly in the applications of big data, increasing efforts have been made to develop fast algorithms. This paper addresses big data summarisation problems usingExpand
A sample decreasing threshold greedy-based algorithm for big data summarisation
TLDR
This paper proposes an efficient algorithm for maximising general non-negative submodular objective functions subject to k -extendible system constraints and validated and compared with that of benchmark algorithms through experiments with a movie recommendation system based on a real database. Expand
Approximation Algorithms for Submodular Data Summarization with a Knapsack Constraint
TLDR
A large number of studies have cast data summarization as a submodular function maximization problem (e.g, [2], [3], [4], [5], [6], clustering], network design [13], and document/corpus summarization [14]. Expand
...
1
2
...

References

SHOWING 1-10 OF 57 REFERENCES
Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms
TLDR
These ideas are extended to give a simple greedy-based constant factor algorithms for non-monotone submodular maximization subject to a knapsack constraint, and for (online) secretary setting subject to uniform matroid or a partition matroid constraint. Expand
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
TLDR
This paper establishes a strong relation between the discrete problem and its continuous relaxation, obtained through extension by expectation of the submodular function, and shows that the probabilistic domain defined by a continuous solution can be reduced to yield a polynomial-size domain. Expand
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity
TLDR
The results demonstrate that the first constant-factor approximation algorithm for maximizing a non-monotone submodular function subject to a cardinality constraint that runs in adaptive rounds and makes oracle queries in expectation is given. Expand
A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
TLDR
This work considers the problem of maximizing a monotone submodular function subject to a knapsack constraint and proposes an algorithm that achieves a nearly-optimal approximation guarantees for important classes of constraints, which overcomes a fundamental running time bottleneck of the multilinear extension relaxation framework. Expand
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
TLDR
A distributed algorithm for maximizing a monotone submodular function with cardinality constraint $k$ that achieves a $(1-1/e-\varepsilon)$-approximation in expectation that the approximation guarantee and query complexity are optimal, and the adaptivity is nearly optimal. Expand
Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization
TLDR
This paper shows that invoking the classical greedy algorithm O(\sqrt{k})-times leads to the (currently) fastest deterministic algorithm, called Repeated Greedy, for maximizing a general submodular function subject to $k-independent system constraints, and derives an almost matching lower bound. Expand
Non-Monotone Adaptive Submodular Maximization
TLDR
The adaptive random greedy policy for maximizing adaptive submodular functions is proposed, and it is proved that it retains the aforementioned 1 - 1/e approximation ratio for functions that are also adaptive monotone, while it additionally provides a 1/ e approximation ratios for nonmonotone adaptive sub modular functions. Expand
Maximizing Non-monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed and undirected graphs and hypergraphs, certain constraint satisfaction problems, and maximum facilityExpand
A Unified Continuous Greedy Algorithm for Submodular Maximization
TLDR
This work presents a new unified continuous greedy algorithm which finds approximate fractional solutions for both the non-monotone and monotone cases, and improves on the approximation ratio for many applications. Expand
Submodular maximization with matroid and packing constraints in parallel
TLDR
The first algorithms with low adaptivity for submodular maximization with a matroid constraint are obtained, and the first parallel algorithm for non-monotone submodularity maximization subject to packing constraints is obtained. Expand
...
1
2
3
4
5
...