Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions.
Aneta NeumannJakob BossekFrank NeumannPublished in: GECCO (2021)
Keyphrases
- submodular functions
- greedy algorithm
- search result diversification
- genetic algorithm
- objective function
- facility location problem
- diminishing returns
- evolutionary process
- dynamic programming
- sample size
- combinatorial optimization
- energy function
- worst case
- neural network
- active learning
- graph cuts
- linear program
- convex optimization
- federated search
- search algorithm