skip to main content
10.1145/2598394.2598471acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

Predict the success or failure of an evolutionary algorithm run

Published:12 July 2014Publication History

ABSTRACT

The quality of candidate solutions in evolutionary computation (EC) depend on multiple independent runs and a large number of them fail to guarantee optimal result. These runs consume more or less equal or sometimes higher amount of computational resources on par the runs that produce desirable results.

This research work addresses these two issues (run quality, execution time), Run Prediction Model (RPM), in which undesirable quality evolutionary runs are identified to discontinue from their execution. An Ant Colony Optimization (ACO) based classifier that learns to discover a prediction model from the early generations of an EC run.

We consider Grammatical Evolution (GE) as our EC technique to apply RPM that is evaluated on four symbolic regression problems. We establish that the RPM applied GE produces a significant improvement in the success rate while reducing the execution time.

References

  1. G. Chennupati, C. Ryan, and R. M. A. Azad. An empirical analysis through the time complexity of GE problems. In R. Matousek, editor, 19th International Conference on Soft Computing, MENDEL'13, pages 37--44, Brno, Czech Republic, jun, 26-28 2013.Google ScholarGoogle Scholar
  2. D. Costelloe and C. Ryan. On improving generalisation in genetic programming. In L. Vanneschi, S. Gustafson, A. Moraglio, I. Falco, and M. Ebner, editors, Genetic Programming, volume 5481 of LNCS, pages 61--72. Springer, Berlin, Heidelberg, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. M. Dorigo and T. Stützle. Ant colony optimization. MIT Press, 2004. Google ScholarGoogle ScholarCross RefCross Ref
  4. M. Keijzer. Improving symbolic regression with interval arithmetic and linear scaling. In C. Ryan, T. Soule, M. Keijzer, E. Tsang, R. Poli, and E. Costa, editors, Genetic Programming, volume 2610 of LNCS, pages 70--82. Springer, Berlin, Heidelberg, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. Martens, B. Baesens, and T. Fawcett. Editorial survey: swarm intelligence for data mining. Machine Learning, 82(1):1--42, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Medland and F. E. B. Otero. A study of different quality evaluation functions in the cant-miner(pb) classification algorithm. In GECCO, pages 49--56, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. U.-M. O'Reilly, M. Wagy, and B. Hodjat. Ec-star: A massive-scale, hub and spoke, distributed genetic programming system. In R. Riolo, E. Vladislavleva, M. D. Ritchie, and J. H. Moore, editors, Genetic Programming Theory and Practice X, Genetic and Evolutionary Computation, pages 73--85. Springer New York, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  8. C. Ryan, M. Keijzer, and M. Cattolico. Favourable biasing of function sets using run transferable libraries. In U.-M. O'Reilly, T. Yu, R. Riolo, and B. Worzel, editors, Genetic Programming Theory and Practice II, volume 8 of Genetic Programming, pages 103--120. Springer US, 2005.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Predict the success or failure of an evolutionary algorithm run

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation
      July 2014
      1524 pages
      ISBN:9781450328814
      DOI:10.1145/2598394

      Copyright © 2014 Owner/Author

      Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 July 2014

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      GECCO Comp '14 Paper Acceptance Rate180of544submissions,33%Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader