Pareto Optimization for Subset Selection with Dynamic Cost Constraints

@inproceedings{Roostapour2019ParetoOF,
  title={Pareto Optimization for Subset Selection with Dynamic Cost Constraints},
  author={Vahid Roostapour and Aneta Neumann and Frank Neumann and Tobias Friedrich},
  booktitle={AAAI},
  year={2019}
}
  • Vahid Roostapour, Aneta Neumann, +1 author Tobias Friedrich
  • Published in AAAI 2019
  • Computer Science, Mathematics
  • In this paper, we consider the subset selection problem for function $f$ with constraint bound $B$ which changes over time. We point out that adaptive variants of greedy approaches commonly used in the area of submodular optimization are not able to maintain their approximation quality. Investigating the recently introduced POMC Pareto optimization approach, we show that this algorithm efficiently computes a $\phi= (\alpha_f/2)(1-\frac{1}{e^{\alpha_f}})$-approximation, where $\alpha_f$ is the… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 15 CITATIONS

    Subset Selection by Pareto Optimization with Recombination

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 20 REFERENCES

    On Subset Selection with General Cost Constraints

    VIEW 21 EXCERPTS
    HIGHLY INFLUENTIAL

    Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms

    VIEW 2 EXCERPTS

    Submodular Optimization with Routing Constraints

    VIEW 11 EXCERPTS
    HIGHLY INFLUENTIAL

    Subset Selection by Pareto Optimization

    VIEW 1 EXCERPT

    Subset Selection under Noise

    VIEW 13 EXCERPTS
    HIGHLY INFLUENTIAL