IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-66515-9_4.html
   My bibliography  Save this book chapter

Quality-Diversity Optimization: A Novel Branch of Stochastic Optimization

In: Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

Author

Listed:
  • Konstantinos Chatzilygeroudis

    (Computer Technology Institute & Press “Diophantus” (CTI))

  • Antoine Cully

    (Imperial College London)

  • Vassilis Vassiliades

    (CYENS Centre of Excellence)

  • Jean-Baptiste Mouret

    (Université de Lorraine, LORIA)

Abstract

Traditional optimization algorithms search for a single global optimum that maximizes (or minimizes) the objective function. Multimodal optimization algorithms search for the highest peaks in the search space that can be more than one. Quality-Diversity algorithms are a recent addition to the evolutionary computation toolbox that do not only search for a single set of local optima, but instead try to illuminate the search space. In effect, they provide a holistic view of how high-performing solutions are distributed throughout a search space. The main differences with multimodal optimization algorithms are that (1) Quality-Diversity typically works in the behavioral space (or feature space), and not in the genotypic (or parameter) space, and (2) Quality-Diversity attempts to fill the whole behavior space, even if the niche is not a peak in the fitness landscape. In this chapter, we provide a gentle introduction to Quality-Diversity optimization, discuss the main representative algorithms, and the main current topics under consideration in the community. Throughout the chapter, we also discuss several successful applications of Quality-Diversity algorithms, including deep learning, robotics, and reinforcement learning.

Suggested Citation

  • Konstantinos Chatzilygeroudis & Antoine Cully & Vassilis Vassiliades & Jean-Baptiste Mouret, 2021. "Quality-Diversity Optimization: A Novel Branch of Stochastic Optimization," Springer Optimization and Its Applications, in: Panos M. Pardalos & Varvara Rasskazova & Michael N. Vrahatis (ed.), Black Box Optimization, Machine Learning, and No-Free Lunch Theorems, pages 109-135, Springer.
  • Handle: RePEc:spr:spochp:978-3-030-66515-9_4
    DOI: 10.1007/978-3-030-66515-9_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-030-66515-9_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.