On the scalability of real-coded Bayesian optimization algorithm
Estimation of distribution algorithms (EDAs) are major tools in evolutionary optimization. They have the ability to uncover the hidden regularities of problems and then exploit them for effective search. Real-coded Bayesian optimization algorithm (rBOA) which brings the power of discrete BOA to bear upon the continuous domain has been regarded as a milestone in the field of numerical optimization. It has been empirically observed that the rBOA solves, with subquadratic scaleup behavior, numerical optimization problems of bounded difficulty. This underlines the scalability of rBOA (at least) in practice. However, there is no firm theoretical basis for this scalability. The aim of this paper is to carry out a theoretical analysis of the scalability of rBOA in the context of additively decomposable problems with real-valued variables. The scalability is measured by the growth of the number of fitness function evaluations (in order to reach the optimum) with the size of the problem. The total number of evaluations is computed by multiplying the population size for learning a correct probabilistic model (i.e., population complexity) and the number of generations before convergence, (i.e., convergence time complexity). Experimental results support the scalability model of rBOA. The rBOA shows a subquadratic (in problem size) scalability for uniformly scaled decomposable problems.
scalability estimation of distribution algorithms (edas) real-coded bayesian optimization algorithm (rboa) decomposable problems probabilistic models