• Corpus ID: 239016088

Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees

  title={Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees},
  author={Chao Qian and Danqin Liu and Zhi-Hua Zhou},
Given a ground set of items, the result diversification problem aims to select a subset with high “quality” and “diversity” while satisfying some constraints. It arises in various real-world artificial intelligence applications, such as web-based search, document summarization and feature selection, and also has applications in other areas, e.g., computational geometry, databases, finance and operations research. Previous algorithms are mainly based on greedy or local search. In this paper, we… 

Figures and Tables from this paper


Max-Sum diversification, monotone submodular functions and dynamic updates
This paper considers the setting where the authors are given a set of elements in a metric space and a set valuation function f defined on every subset and shows that a natural single swap local search algorithm provides a 2-approximation in this more general setting.
A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints
The first coreset-based algorithms for diversity maximization under matroid constraints for various diversity functions are devise, together with efficient sequential, MapReduce, and Streaming implementations, and are capable of dealing with the large input instances typical of the big data scenario.
Linear Relaxations for Finding Diverse Elements in Metric Spaces
This paper studies an objective known as {\em sum-min} diversity, which is known to be effective in many applications, and gives the first constant factor approximation algorithm, and compares the quality of the solutions produced by the method with other popular diversity maximization algorithms.
Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
It is proved that a simple multi-objective EA called GSEMO-C can generally achieve good approximation guarantees in polynomial expected running time.
Max-Sum Diversity Via Convex Programming
This paper presents a PTAS for the max-sum diversification problem under a matroid constraint for distances d(\cdot,\cdot) of negative type, which are popular similarity metrics in web and image search.
Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
  • Chao Qian
  • Computer Science, Medicine
    Evolutionary Computation
  • 2021
It is proved that by optimizing the original objective function (g-c) and the size simultaneously, the GSEMO fails to achieve a good polynomial-time approximation guarantee, but it is also proven that by optimized a distorted objective function and thesize simultaneous, theGSEMO can still achieve the best-known polynometric- time approximation guarantee.
Diversity maximization under matroid constraints
A combinatorial proof technique for maximizing diversity under matroid constraints uses the existence of a family of Latin squares which may also be of independent interest, and the first constant-factor approximation algorithm for this problem, using a new technique.
Constrained Monotone $k$ -Submodular Function Maximization Using Multiobjective Evolutionary Algorithms With Theoretical Guarantee
This paper proposes a new approach which employs a multiobjective evolutionary algorithm to maximize the given objective and minimize the size simultaneously and proves that the proposed method can obtain the asymptotically tight approximation guarantee.
Reoptimization Time Analysis of Evolutionary Algorithms on Linear Functions Under Dynamic Uniform Constraints
This article presents a dynamic model of optimizing linear functions under uniform constraints, and investigates the runtimes that different evolutionary algorithms need to recompute an optimal solution when the constraint bound changes by a certain amount.
Maximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
This paper investigates the runtime of a simple single objective evolutionary algorithm called () EA and a multiobjective evolutionary algorithms called GSEMO until they have obtained a good approximation for submodular functions.