On Multiset Selection With Size Constraints
@inproceedings{Qian2018OnMS, title={On Multiset Selection With Size Constraints}, author={Chao Qian and Y. Zhang and Ke Tang and X. Yao}, booktitle={AAAI}, year={2018} }
This paper considers the multiset selection problem with size constraints, which arises in many real-world applications such as budget allocation. Previous studies required the objective function f to be submodular, while we relax this assumption by introducing the notion of the submodularity ratios (denoted by αf and βf ). We propose an anytime randomized iterative approach POMS, which maximizes the given objective f and minimizes the multiset size simultaneously. We prove that POMS using a… CONTINUE READING
7 Citations
Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions
- Computer Science, Mathematics
- ArXiv
- 2019
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
- Computer Science, Medicine
- Evolutionary Computation
- 2019
- PDF
From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models
- Computer Science, Mathematics
- ICML
- 2020
- PDF
Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization
- Computer Science, Mathematics
- ArXiv
- 2018
- PDF
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
- Mathematics, Computer Science
- ICML
- 2018
- 15
- PDF
Theoretical Analyses of Multi-Objective Evolutionary Algorithms on Multi-Modal Objectives
- Computer Science
- ArXiv
- 2020
- PDF
References
SHOWING 1-10 OF 22 REFERENCES
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
- Mathematics, Computer Science
- ICML
- 2014
- 75
- Highly Influential
- PDF
Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
- Mathematics, Computer Science
- IEEE Transactions on Evolutionary Computation
- 2018
- 16
- PDF
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
- Computer Science, Medicine
- Evolutionary Computation
- 2015
- 29
- PDF
An analysis of approximations for maximizing submodular set functions—I
- Mathematics, Computer Science
- Math. Program.
- 1978
- 3,619
- PDF
Maximizing Monotone Submodular Functions over the Integer Lattice
- Mathematics, Computer Science
- IPCO
- 2016
- 29
- Highly Influential
- PDF
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
- Computer Science, Mathematics
- NIPS
- 2015
- 52
- PDF
SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
- Mathematics, Computer Science
- 2011 IEEE 11th International Conference on Data Mining
- 2011
- 380
- PDF