Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations

DOI10.1145/3594805.3607138OpenAlexW4385438091MaRDI QIDQ6202148

Anna V. Kononova, Kirill Antonov, Thomas Bäck, Unnamed Author

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.3607138

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

• Analyzing evolutionary algorithms. The computer science perspective.
• Niching with derandomized evolution strategies in artificial and real-world landscapes
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
• Multimodal optimization by means of evolutionary algorithms
• Information Theory and Statistical Mechanics
• Handbook of Natural Computing
• Binomial and Poisson distributions as maximum entropy distributions
• A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
• Theory of Evolutionary Computation
• Automated Dynamic Algorithm Configuration
• Unnamed Item
• Unnamed Item

This page was built for publication: Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations