This work uses genetic programming to explore the space of continuous optimisers, with the goal of discovering novel ways of doing optimisation. In order to keep the search space broad, the optimisers are evolved from scratch using Push, a Turing-complete, general-purpose, language. The resulting optimisers are found to be diverse, and explore their optimisation landscapes using a variety of interesting, and sometimes unusual, strategies. Significantly, when applied to problems that were not seen during training, many of the evolved optimisers generalise well, and often outperform existing optimisers. This supports the idea that novel and effective forms of optimisation can be discovered in an automated manner. This paper also shows that pools of evolved optimisers can be hybridised to further increase their generality, leading to optimisers that perform robustly over a broad variety of problem types and sizes.
翻译:这项工作利用基因编程来探索连续的选美者空间,目的是发现实现优化的新方式。 为了保持搜索空间的广度,选美者从头开始使用普什(Push)这个图灵完整、通用、通用的语言来演化。结果发现,选美者具有多样性,利用各种有趣的、有时是不寻常的战略来探索其优化景观。重要的是,许多进化的选美者在应用到培训期间未见的问题时,广泛概括,而且往往优于现有的选美者。这支持这样的观点,即新颖和有效的选美形式可以自动地发现。本文还表明,进化的选美者组合可以混合起来,进一步增加其总体性,导致选美者在广泛的问题类型和规模上表现有力。