Editing
Bayesian Optimization Algorithm: A Promising Approach for Fitness Inheritance
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
Title: Bayesian Optimization Algorithm: A Promising Approach for Fitness Inheritance Abstract: This study explores the concept of fitness inheritance in the Bayesian optimization algorithm (BOA). The goal is to estimate the fitness of some candidate solutions to reduce the number of expensive fitness evaluations. Bayesian networks, which are used in BOA to model promising solutions and generate new ones, are extended to allow for fitness inheritance. The results indicate that this approach is promising, as it leads to accurate fitness estimates even if only a small proportion of candidate solutions are evaluated using the actual fitness function. This can result in a significant reduction in the number of actual fitness evaluations. Introduction: Genetic and evolutionary algorithms (GEAs) often need to maintain a large population of candidate solutions for many iterations to ensure reliable convergence to a global optimum. However, in many real-world problems, evaluating the fitness of candidate solutions can be computationally expensive. This study investigates whether it is possible to make GEAs evolve not only the population of candidate solutions but also a model of fitness, which can be used to evaluate a certain proportion of newly generated candidate solutions (fitness inheritance). Methodology: The study focuses on the Bayesian optimization algorithm (BOA), which is a type of PMBGA. BOA uses Bayesian networks to model promising solutions and generate new ones. Two types of models are considered: (1) traditional Bayesian networks with full conditional probability tables (CPTs) used in BOA and (2) Bayesian networks with local structures used in BOA with decision graphs (dBOA) and the hierarchical BOA (hBOA). The study examines the proposed method for fitness inheritance in BOA on three example problems: onemax, concatenated traps of order 4, and concatenated traps of order 5. Results: The study finds that fitness inheritance is beneficial in BOA, even if only less than 1% of candidate solutions are evaluated using the actual fitness function. It turns out that due to the population sizing requirements for creating a correct model of promising solutions, the more fitness inheritance, the better. Conclusion: The study concludes that fitness inheritance is a promising concept in BOA. The results indicate that using the model in BOA to estimate fitness of newly generated candidate solutions can lead to significant reductions in the number of actual fitness evaluations. This approach seems to be a promising method for reducing the computational complexity of GEAs in real-world problems. Link to Article: https://arxiv.org/abs/0402032v1 Authors: arXiv ID: 0402032v1 [[Category:Computer Science]] [[Category:Fitness]] [[Category:Boa]] [[Category:Solutions]] [[Category:Inheritance]] [[Category:Candidate]]
Summary:
Please note that all contributions to Simple Sci Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Simple Sci Wiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
Edit source
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information