Multi-objective quality diversity optimization

@article{Pierrot2022MultiobjectiveQD,
  title={Multi-objective quality diversity optimization},
  author={Thomas Pierrot and Guillaume Richard and Karim Beguir and Antoine Cully},
  journal={Proceedings of the Genetic and Evolutionary Computation Conference},
  year={2022}
}
In this work, we consider the problem of Quality-Diversity (QD) optimization with multiple objectives. QD algorithms have been proposed to search for a large collection of both diverse and high-performing solutions instead of a single set of local optima. Searching for diversity was shown to be useful in many industrial and robotics applications. On the other hand, most real-life problems exhibit several potentially conflicting objectives to be optimized. Hence being able to optimize for… 

Figures and Tables from this paper

T-DominO: Exploring Multiple Criteria with Quality-Diversity and the Tournament Dominance Objective

TLDR
T-DominO ranks individuals relative to other solutions in the archive, favoring individuals with balanced performance over those which excel at a few objectives at the cost of the others, to maintain the visual accessibility of the archive.

References

SHOWING 1-10 OF 41 REFERENCES

Quality diversity for multi-task optimization

TLDR
This paper proposes an extension of the MAP-Elites algorithm, called Multi-task MAP-elites, that solves multiple tasks when the fitness function depends on the task, and shows that in both cases the algorithm outperforms the optimization of each task separately with the CMA-ES algorithm.

Quality and Diversity Optimization: A Unifying Modular Framework

TLDR
A unifying framework of QD optimization algorithms is presented that covers the two main algorithms of this family (multidimensional archive of phenotypic elites and the novelty search with local competition), and that highlights the large variety of variants that can be investigated within this family.

Quality-Diversity Optimization: a novel branch of stochastic optimization

TLDR
This chapter provides a gentle introduction to Quality-Diversity optimization, discusses the main representative algorithms, and the main current topics under consideration in the community.

Diversity policy gradient for sample efficient quality-diversity optimization

TLDR
A novel algorithm, qd-pg, which combines the strength of Policy Gradient algorithms and Quality Diversity approaches to produce a collection of diverse and high-performing neural policies in continuous control environments and is significantly more sample-eficient than its evolutionary competitors.

Multi-Emitter MAP-Elites: Improving quality, diversity and convergence speed with heterogeneous sets of emitters

TLDR
Comparisons against MAP-Elite and existing approaches using emitters show that ME-MAP-Elites is faster at providing collections of solutions that are significantly more diverse and higher performing and is equivalent to the best of the compared algorithms.

Evolutionary Algorithms for Multiobjective Optimization

TLDR
A multi-objective evolutionary algorithm with aggregate surrogate model, its newer version, which also uses a surrogate model for the pre-selection of individuals and a framework which combines surrogate modeling with meta-learning is presented.

Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach

TLDR
The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.

MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition

TLDR
Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.

Differentiable Quality Diversity

TLDR
This work presents MAP-Elites via a Gradient Arborescence (MEGA), a DQD algorithm that leverages gradient information to efficiently explore the joint range of the objective and measure functions.

Covariance matrix adaptation for the rapid illumination of behavior space

TLDR
The proposed Covariance Matrix Adaptation MAP-Elites algorithm combines the self-adaptation techniques of CMA-ES with archiving and mapping techniques for maintaining diversity in QD to suggest that QD algorithms augmented by operators from state-of-the-art optimization algorithms can yield high-performing methods for simultaneously exploring and optimizing continuous search spaces.