.png){kind=icon}
.png){kind=icon}
返回
Robust evolution strategies
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1011234912985.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Evolution Strategies (ES) are an approach to numerical optimization that shows good optimization performance. However, it is found through our computer simulations that the performance changes with the lower bound of strategy parameters, although it has been overlooked in the ES community. We demonstrate that a population cannot practically move to other better points, because strategy parameters attain minute values at an early stage, when too small a lower bound is adopted. This difficulty is called the lower bound problem in this paper. In order to improve the self-adaptive property of strategy parameters, a new extended ES called RES is proposed. RES has redundant neutral strategy parameters and adopts new mutation mechanisms in order to utilize selectively neutral mutations so as to improve the adaptability of strategy parameters. Computer simulations of the proposed approach are conducted using several test functions.
Keyword:
evolution strategies
numerical optimization
strategy parameters
selectively neutral mutations
robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。