An inference model for analyzing termination conditions of Evolutionary Algorithms
David Roche
author
Debora Gil
author
Jesus Giraldo
author
2011
In real-world problems, it is mandatory to design a termination condition for Evolutionary Algorithms (EAs) ensuring stabilization close to the unknown optimum. Distribution-based quantities are good candidates as far as suitable parameters are used. A main limitation for application to real-world problems is that such parameters strongly depend on the topology of the objective function, as well as, the EA paradigm used.
We claim that the termination problem would be fully solved if we had a model measuring to what extent a distribution-based quantity asymptotically behaves like the solution accuracy. We present a regression-prediction model that relates any two given quantities and reports if they can be statistically swapped as termination conditions. Our framework is applied to two issues. First, exploring if the parameters involved in the computation of distribution-based quantities influence their asymptotic behavior. Second, to what extent existing distribution-based quantities can be asymptotically exchanged for the accuracy of the EA solution.
Evolutionary Computation Convergence
Termination Conditions
Statistical Inference
IAM
exported from refbase (http://refbase.cvc.uab.es/show.php?record=1677), last updated on Thu, 17 May 2012 09:45:54 +0200
text
http://ccia2011.udl.cat/?lng=ca&sec=pro
http://refbase.cvc.uab.es/files/RGG2011.pdf
http://ccia2011.udl.cat/?lng=ca&sec=pro
IAM @ iam @ RGG2011a
14th Congrès Català en Intel·ligencia Artificial
Associació Catalana Intel·ligència Artificial
author
CCIA
2011
conference publication
216
225
978-1-60750-841-0