Abstract
We present a comparison of step size adaptation methods for evolution strategies, covering recent developments in the field. Following recent work by Hansen et al. we formulate a concise list of performance criteria: a) fast convergence of the mean, b) near-optimal fixed point of the normalized step size dynamics, and c) invariance to adding constant dimensions of the objective function. Our results show that algorithms violating these principles tend to underestimate the step size or are unreliable when the function does not fit to the algorithm's tuned hyperparameters. In contrast, we find that cumulative step size adaptation (CSA) and twopoint adaptation (TPA) provide reliable estimates of the optimal step size. We further find that removing the evolution path of CSA still leads to a reliable algorithm without the computational requirements of CSA.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms |
Antal sider | 10 |
Forlag | Association for Computing Machinery |
Publikationsdato | 2017 |
Sider | 139-148 |
ISBN (Elektronisk) | 978-1-4503-4651-1 |
DOI | |
Status | Udgivet - 2017 |
Begivenhed | 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms - København, Danmark Varighed: 12 jan. 2017 → 15 jan. 2017 Konferencens nummer: 14 |
Konference
Konference | 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms |
---|---|
Nummer | 14 |
Land/Område | Danmark |
By | København |
Periode | 12/01/2017 → 15/01/2017 |