TOP
Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Seminars
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Publishing
Within this website:
External resources:
dblp
Within this website:
External resources:
  • the dblp Computer Science Bibliography


Dagstuhl Seminar 20472

Estimation-of-Distribution Algorithms: Theory and Applications Cancelled

( Nov 15 – Nov 20, 2020 )

Permalink
Please use the following short url to reference this page: https://www.dagstuhl.de/20472

Replacement
Dagstuhl Seminar 22182: Estimation-of-Distribution Algorithms: Theory and Applications (2022-05-01 - 2022-05-06) (Details)

Organizers

Contact

Motivation

Estimation-of-distribution algorithms (EDAs) are a relatively recent type of randomized optimization heuristics that iteratively develop a probabilistic model of good solutions in the underlying search space. They thus differ from classical randomized heuristics such as local search, simulated annealing, or genetic algorithms in that they are not restricted to sets of search points as the only mean of carrying information from one iteration to the next. EDAs are successfully applied in various engineering areas. In the last five years, they received increasing attention also in theoretical research, pointing out critical influences of their main parameters and rigorously demonstrating situations in which EDAs are superior to many classical approaches, among others, in leaving local optima and in dealing with noise. So far almost all theoretical efforts in EDAs have been done for understanding univariate probabilistic models. The benefits of EDAs, however, are likely to stand out even more if one considers multivariate EDAs, which empirically have been shown to outperform classical evolutionary algorithms on several classes of problems where learning dependencies among decision variables reveals itself to be crucial.

The purpose of this Dagstuhl seminar is to bring together researchers from the theory and the applications of EDAs. In a small number of survey talks, they will summarize the state of the art in the sub-disciplines with significant recent progress. There will also be a small number of talks discussing in depth recent breakthrough results. A large proportion of the time will be devoted to discussions, both plenary and in small groups. In these, we shall try to clarify how the recent theoretical findings can be used to make EDAs more successful in practice, what experience in practice would be worth making rigorous via theoretical works, and what are the most interesting directions for future research, ideally via combined theoretical and applied approaches.

Copyright Josu Ceberio Uribe, Benjamin Doerr, Fernando Lobo, and Carsten Witt

Participants
  • Josu Ceberio Uribe (University of the Basque Country - Donostia, ES) [dblp]
  • Benjamin Doerr (Ecole Polytechnique - Palaiseau, FR) [dblp]
  • Fernando Lobo (University of Algarve, PT) [dblp]
  • Carsten Witt (Technical University of Denmark - Lyngby, DK) [dblp]

Classification
  • Artificial Intelligence
  • Data Structures and Algorithms
  • Neural and Evolutionary Computing

Keywords
  • heuristic search and optimization
  • estimation-of-distribution algorithms
  • probabilistic model building
  • machine learning