First Complexity Results for Evolutionary Knowledge Transfer

DOI10.1145/3594805.3607137OpenAlexW4385438065MaRDI QIDQ6120982

No author found.

Publication date: 23 February 2024

Published in: Proceedings of the 17th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3594805.3607137

zbMATH Keywords

no free lunch theoremsevolutionary algorithms theorymulti-task evolutiontransfer optimization

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)

Cites Work

• Simple explanation of the no free lunch theorem of optimization
• Simple explanation of the no-free-lunch theorem and its implications
• ParamILS: An Automatic Algorithm Configuration Framework
• Cross-task code reuse in genetic programming applied to visual learning

This page was built for publication: First Complexity Results for Evolutionary Knowledge Transfer