arrow
返回

The population-based incremental learning algorithm converges to local optima

delete2006-08-01
delete16
PRE
AI
R
Reza Rastegar *
A
Arash Hariri
DOI:10.1016/j.neucom.2005.12.116delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Here, we propose a convergence proof for the Population-Based Incremental Learning (PBIL). First, we model the PBIL by a Markov process and approximate its behavior using an Ordinary Differential Equation (ODE). Then we prove that the corresponding ODE does not have any stable stationary point in the configuration space except the local maxima of the function to be optimized. Finally, we show that the ODE and consequently the PBIL converge to one of these stable points. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
PBIL
Markov process
ODE
stationary points
stability
convergence
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

暂无机构信息
引用论文

引用论文

暂无论文信息