Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 5:00 PM ET (12:00 - 21:00 UTC). We apologize for the inconvenience.
By Topic

On the Scalability of Real-Coded Bayesian Optimization Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang Wook Ahn ; Dept. of Inf. & Commun., Gwangju Inst. of Sci. & Technol., Gwangju ; Ramakrishna, R.S.

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.

Published in:

Evolutionary Computation, IEEE Transactions on  (Volume:12 ,  Issue: 3 )