{"title":"基于种群的增量学习算法的收敛性证明","authors":"R. Rastegar, A. Hariri, M. Mazoochi","doi":"10.1109/ICTAI.2005.6","DOIUrl":null,"url":null,"abstract":"Here we propose a convergence proof for the population based incremental learning (PBIL). In our approach, first, we model the PBIL by the Markov process and approximate its behavior using Ordinary Differential Equation (ODE). Then we prove that the corresponding ODE doesn’t have any stable stationary points in [0,1]n, n is the number of variables, except the local maxima of the function to be optimized. Finally we show that this ODE and consequently the PBIL converge to one of these stable attractors.","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"A Convergence Proof for the Population Based Incremental Learning Algorithm\",\"authors\":\"R. Rastegar, A. Hariri, M. Mazoochi\",\"doi\":\"10.1109/ICTAI.2005.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Here we propose a convergence proof for the population based incremental learning (PBIL). In our approach, first, we model the PBIL by the Markov process and approximate its behavior using Ordinary Differential Equation (ODE). Then we prove that the corresponding ODE doesn’t have any stable stationary points in [0,1]n, n is the number of variables, except the local maxima of the function to be optimized. Finally we show that this ODE and consequently the PBIL converge to one of these stable attractors.\",\"PeriodicalId\":294694,\"journal\":{\"name\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2005.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Convergence Proof for the Population Based Incremental Learning Algorithm
Here we propose a convergence proof for the population based incremental learning (PBIL). In our approach, first, we model the PBIL by the Markov process and approximate its behavior using Ordinary Differential Equation (ODE). Then we prove that the corresponding ODE doesn’t have any stable stationary points in [0,1]n, n is the number of variables, except the local maxima of the function to be optimized. Finally we show that this ODE and consequently the PBIL converge to one of these stable attractors.