.png){kind=icon}
返回
A Simple Yet Efficient Evolution Strategy for Large-Scale Black-Box Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2017.2765682.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an evolution strategy algorithm using a sparse plus low rank model for large-scale optimization in this paper. We first develop a rank one evolution strategy using a single principal search direction. It is of linear complexity. Then we extend it to multiple search directions, and develop a rank-m evolution strategy. We illustrate that the principal search direction accumulates the natural gradients with respect to the distribution mean, and acts as a momentum term. Further, we analyze the optimal low rank approximation to the covariance matrix, and experimentally show that the principal search direction can effectively learn the long valley of the function with predominant search direction. Then we investigate the effects of Hessian on the algorithm performance. We conduct experiments on a class of test problems and the CEC'2010 LSGO benchmarks. The experimental results validate the effectiveness of our proposed algorithms.
Keyword:
Evolution path
evolution strategy
low rank model
principal search direction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method.png)
NEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAI分享收藏分享收藏Transcranial direct current stimulation on prefrontal and parietal areas enhances motor imageryNeuroReport
NeuroReportIF0
PREAI
分享收藏分享收藏
查看更多内容