Corpus ID: 19251434

On Multiset Selection With Size Constraints

@inproceedings{Qian2018OnMS,
  title={On Multiset Selection With Size Constraints},
  author={Chao Qian and Y. Zhang and K. 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… Expand
9 Citations
Maximizing DR-submodular+supermodular functions on the integer lattice subject to a cardinality constraint
  • Zhenning Zhang, D. Du, Yanjun Jiang, Chenchen Wu
  • Mathematics
  • 2021
Fast Evolutionary Algorithms for Maximization of Cardinality-Constrained Weakly Submodular Functions
  • PDF
Sequence Selection by Pareto Optimization
  • 2
  • PDF
Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences
  • PDF
Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
  • Chao Qian
  • Computer Science, Medicine
  • Evolutionary Computation
  • 2019
  • 1
  • PDF
From Sets to Multisets: Provable Variational Inference for Probabilistic Integer Submodular Models
  • PDF
Maximizing Monotone DR-submodular Continuous Functions by Derivative-free Optimization
  • PDF
Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice
  • 17
  • PDF

References

SHOWING 1-10 OF 22 REFERENCES
On Subset Selection with General Cost Constraints
  • 28
  • PDF
Optimal Budget Allocation: Theoretical Guarantee and Efficient Algorithm
  • 78
  • Highly Influential
  • PDF
Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
  • 21
  • PDF
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
  • 31
  • PDF
Submodular Optimization with Routing Constraints
  • 63
  • PDF
Online Submodular Welfare Maximization: Greedy is Optimal
  • 59
  • PDF
An analysis of approximations for maximizing submodular set functions—I
  • 3,710
  • PDF
Maximizing Monotone Submodular Functions over the Integer Lattice
  • 31
  • Highly Influential
  • PDF
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice
  • 53
  • PDF
SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model
  • A. Goyal, Wei Lu, L. Lakshmanan
  • Mathematics, Computer Science
  • 2011 IEEE 11th International Conference on Data Mining
  • 2011
  • 391
  • PDF
...
1
2
3
...