[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1276958.1277066acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
Article

SDR: a better trigger for adaptive variance scaling in normal EDAs

Published: 07 July 2007 Publication History

Abstract

Recently, advances have been made in continuous, normal-distribution-based Estimation-of-DistributionAlgorithms (EDAs) by scaling the variance upfrom the maximum-likelihood estimate. When doneproperly, such scaling has been shown to preventpremature convergence on slope-like regions ofthe search space. In this paper we specificallyfocus on one way of scaling that was previouslyintroduced as Adaptive Variance Scaling (AVS). It wasfound that when using AVS, the average number offitness evaluations grows subquadratically withthe dimensionality on a wide range of unimodaltest-problems, competitively with the CMA-ES.Still, room for improvement exists because thevariance doesn't always have to be scaled. Apreviously introduced trigger based on correlationthat determines when to apply scaling was shownto fail on higher dimensional problems. Here weprovide a new solution called the Standard-DeviationRatio (SDR) trigger that is integrated with theIterated Density-Estimation Evolutionary Algorithm(IDEA). Intuitively put, scaling istriggered with SDR only if improvements are foundto be far away from the mean. SDR works even inhigh dimensions as a result of factorizing thedecision rule behind the trigger according to theestimated Bayesian factorization. We evaluateSDR-AVS-IDEA on the same set ofbenchmark problems and compare it with AVS-IDEAand CMA-ES. We find that the addition of SDR givesAVS-IDEA an important extra edgefor it to be used in future research and inapplications both in single-objective optimizationas well as in multi-objective and dynamicoptimization. In addition, we provide practical rulesof thumb for parameter settings for usingSDR-AVS-IDEA that result in anasymptotic scale-up behavior that is sublinearfor the population size (O(l^{0.85})) andsubquadratic (O(l^{1.85})) for thenumber of evaluations.

References

[1]
M. Abramowitz and I. Stegun. Handbook of Mathematical Functions with Formulas, Graphs and Mathematical Tables. Dover Publications, New York, New York, 1972.
[2]
Th. Bäck and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation, 1(1):1--23, 1993.
[3]
P. A. N. Bosman and D. Thierens. Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In M. Schoenauer et al., editors, Parallel Problem Solving from Nature - PPSN VI, pages 767--776, Berlin, 2000. Springer-Verlag.
[4]
P. A. N. Bosman and D. Thierens. Advancing continuous IDEAs with mixture distributions and factorization selection metrics. In M. Pelikan and K. Sastry, editors, Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference GECCO-2001, pages 208--212, San Francisco, California, 2001. Morgan Kaufmann.
[5]
P. A. N. Bosman and D. Thierens. Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms. International Journal of Approximate Reasoning, 31:259--289, 2002.
[6]
P. A. N. Bosman and D. Thierens. Learning probabilistic models for enhanced evolutionary computation. In Y. Jin, editor, Knowledge Incorporation in Evolutionary Computation, pages 147--176. Springer-Verlag, Berlin, 2004.
[7]
J. Branke, T. Kaußler, C. Schmidt, and H. Schmeck. A multi-population approach to dynamic optimization problems. In I. C. Parmee, editor, Adaptive Computing in Design and Manufacture - ACDM 2000, pages 299--308, Berlin, 2000. Springer Verlag.
[8]
C. Gonzlez, J. A. Lozano, and P. Larraaga. Mathematical modelling of UMDAc algorithm with tournament selection. Behaviour on linear and quadratic functions. International Journal of Approximate Reasoning, 31(3):313--340, 2002.
[9]
J. Grahl, P. A. N. Bosman, and F. Rothlauf. The correlation-triggered adaptive variance scaling idea. In M. Keijzer et al., editors, Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2006, pages 397--404, New York, New York, 2006. ACM Press.
[10]
J. Grahl, S. Minner, and F. Rothlauf. Behaviour of UMDAc with truncation selection on monotonous functions. In Proc. of the Congress on Evolutionary Computation - CEC-2005, pages 2553-2559, Piscataway, New Jersey, 2005. IEEE Press.
[11]
J. Grahl, S. Minner, and F. Rothlauf. Behaviour of UMDAc with truncation selection on monotonous functions. In The 2005 IEEE Congress on Evolutionary Computation. IEEE CEC 2005, 2005.
[12]
N. Hansen, S. D. Müller, and P. Koumoutsakos. Reducing the time complexiy of the derandomized evolution strategy with covariance matrix adaption. Evolutionary Computation, 11(1):1--18, 2003.
[13]
N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159--195, 2001.
[14]
G. Harik, E. Cant-Paz, and D. E. Goldberg. The gambler's ruin problem, genetic algorithms, and the sizing of populations. In Proceedings of the International Conference on Evolutionary Computation 1997 (ICEC '97), pages 7--12, Piscataway, NJ, 1997. IEEE Press.
[15]
P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic, London, 2001.
[16]
J. A. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea. Towards a New Evolutionary Computation. Advances in Estimation of Distribution Algorithms. Springer-Verlag, Berlin, 2006.
[17]
H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. binary parameters. In A. E. Eiben et al., editors, Parallel Problem Solving from Nature - PPSN V, pages 178--187. Springer, 1996.
[18]
J. Ocenasek, S. Kern, N. Hansen, and P. Koumoutsakos. A mixed bayesian optimization algorithm with variance adaptation. In X. Yao et al., editors, Parallel Problem Solving from Nature - PPSN VIII, pages 352--361, Berlin, 2004. Springer-Verlag.
[19]
M. Pelikan, D. E., Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5--20, 2002.
[20]
M. Pelikan, K. Sastry, and E. Cantó-Paz. Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications. Springer, Berlin, 2006.
[21]
Y.-W. Shang. A note on the extended Rosenbrock function. Evolutionary Computation, 14(1):119--126, 2006.
[22]
D. Thierens and D.E. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Proceedings of the fifth conference on Genetic Algorithms, pages 38--45. Morgan Kaufmann, 1993.

Cited By

View all
  • (2024)Evolutionary Deep Reinforcement Learning via Hybridizing Estimation-of-Distribution Algorithms with Policy Gradients2024 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC60901.2024.10611765(1-8)Online publication date: 30-Jun-2024
  • (2023)A novel ensemble estimation of distribution algorithm with distribution modification strategiesComplex & Intelligent Systems10.1007/s40747-023-00975-y9:5(5377-5416)Online publication date: 20-Mar-2023
  • (2022)A layered learning estimation of distribution algorithmProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3520304.3528904(399-402)Online publication date: 9-Jul-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation
July 2007
2313 pages
ISBN:9781595936974
DOI:10.1145/1276958
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 July 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. adaptive variance scaling
  2. estimation of distribution algorithms
  3. evolutionary algorithms
  4. numerical optimization

Qualifiers

  • Article

Conference

GECCO07
Sponsor:

Acceptance Rates

GECCO '07 Paper Acceptance Rate 266 of 577 submissions, 46%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Evolutionary Deep Reinforcement Learning via Hybridizing Estimation-of-Distribution Algorithms with Policy Gradients2024 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC60901.2024.10611765(1-8)Online publication date: 30-Jun-2024
  • (2023)A novel ensemble estimation of distribution algorithm with distribution modification strategiesComplex & Intelligent Systems10.1007/s40747-023-00975-y9:5(5377-5416)Online publication date: 20-Mar-2023
  • (2022)A layered learning estimation of distribution algorithmProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3520304.3528904(399-402)Online publication date: 9-Jul-2022
  • (2021)An Adaptive Covariance Scaling Estimation of Distribution AlgorithmMathematics10.3390/math92432079:24(3207)Online publication date: 11-Dec-2021
  • (2020)Enhancing Gaussian Estimation of Distribution Algorithm by Exploiting Evolution Direction With ArchiveIEEE Transactions on Cybernetics10.1109/TCYB.2018.286956750:1(140-152)Online publication date: Jan-2020
  • (2019)A Gaussian Estimation of Distribution Algorithm With Random Walk Strategies and Its Application in Optimal Missile Guidance Handover for Multi-UCAV in Over-the-Horizon Air CombatIEEE Access10.1109/ACCESS.2019.29082627(43298-43317)Online publication date: 2019
  • (2016)Enhance continuous estimation of distribution algorithm by variance enlargement and reflecting sampling2016 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2016.7744225(3441-3447)Online publication date: Jul-2016
  • (2013)Benchmarking parameter-free amalgam on functions with and without noiseEvolutionary Computation10.1162/EVCO_a_0009421:3(445-469)Online publication date: 1-Sep-2013
  • (2013)Scaling Up Estimation of Distribution Algorithms for Continuous OptimizationIEEE Transactions on Evolutionary Computation10.1109/TEVC.2013.224740417:6(797-822)Online publication date: 1-Dec-2013
  • (2013)Adequate Variance Maintenance in a Normal EDA via the Potential-Selection MethodEVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II10.1007/978-3-642-31519-0_14(221-235)Online publication date: 2013
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media