First Complexity Results for Evolutionary Knowledge Transfer

DOI10.1145/3594805.3607137MaRDI QIDQ6120982zbMATH OpenOpenAlexFDO

Authors

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

evolutionary algorithms theorymulti-task evolutionno free lunch theoremstransfer optimization

Mathematics Subject Classification ID

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

Cites work

• Cross-task code reuse in genetic programming applied to visual learning
• Paramils: an automatic algorithm configuration framework
• Simple explanation of the no free lunch theorem of optimization
• Simple explanation of the no-free-lunch theorem and its implications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6120982)