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

DOI10.1145/3594805.3607138MaRDI QIDQ6202148zbMATH OpenOpenAlexFDO

Authors Kirill Antonov, Anna V. Kononova, Thomas Bäck

Publication date 23 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

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

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

• A tight runtime analysis for the (1+(,)) GA on LeadingOnes
• Analyzing evolutionary algorithms. The computer science perspective.
• Automated Dynamic Algorithm Configuration
• Binomial and Poisson distributions as maximum entropy distributions
• Handbook of Natural Computing
• scientific article; zbMATH DE number 1617336 (Why is no real title available?)
• scientific article; zbMATH DE number 5686753 (Why is no real title available?)
• Information Theory and Statistical Mechanics
• Multimodal optimization by means of evolutionary algorithms
• Niching with derandomized evolution strategies in artificial and real-world landscapes
• Static and self-adjusting mutation strengths for multi-valued decision variables
• Theory of evolutionary computation. Recent developments in discrete optimization
• Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs

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

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