Result diversification by multi-objective evolutionary algorithms with theoretical guarantees

DOI10.1016/j.artint.2022.103737zbMath1496.68306arXiv2110.09332OpenAlexW3205483249MaRDI QIDQ2152498

Zhi-Hua Zhou, Chao Qian, Dan-Xuan Liu

Publication date: 8 July 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.09332

zbMATH Keywords

cardinality constraintsmulti-objective evolutionary algorithmsrunning time analysisdynamic environmentsexperimental studiesmonotone submodular functionsmatroid constraintsdiversitiesresult diversification

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences

Uses Software

• LETOR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Runtime analysis of ant colony optimization on dynamic shortest path problems
• Approximation algorithms for maximum dispersion
• Reoptimization time analysis of evolutionary algorithms on linear functions under dynamic uniform constraints
• Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
• Approximation Algorithms for Dispersion Problems
• (1+1) EA on Generalized Dynamic OneMax
• Max-sum diversity via convex programming
• An analysis of approximations for maximizing submodular set functions—I
• Heuristic and Special Case Algorithms for Dispersion Problems
• Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
• Finding Subsets Maximizing Minimum Structures
• Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives
• An Improved Analysis of Local Search for Max-Sum Diversification
• Comments on bases in dependence structures

This page was built for publication: Result diversification by multi-objective evolutionary algorithms with theoretical guarantees