Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3319619.3321994acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

To adapt or not to adapt, or the beauty of random settings

Published: 13 July 2019 Publication History

Abstract

This work concerns the automatic adaptation of the probabilities of occurrence of the genetic operators in Genetic Programming. We experiment with different adaptation methods, different types of problems, and different tree-based Genetic Programming flavors with a variable number of genetic operators. Based on the published literature and on our own results, we claim that operator probabilities should be neither fixed nor carefully adapted, but instead they should be constantly and randomly changed during the evolution.

References

[1]
N. Al-Madi and S. A. Ludwig. 2012. Adaptive genetic programming applied to classification in data mining. In Proceedings of NaBIC 2012. IEEE Press, 79--85. https://doi.org/
[2]
Lawrence Davis. 1989. Adapting Operator Probabilities in Genetic Algorithms. In Proceedings of ICGA 1989. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 61--69. http://dl.acm.org/citation.cfm?id=645512.657242
[3]
Jeannie Fitzgerald and Conor Ryan. 2013. Individualized self-adaptive genetic operators with adaptive selection in Genetic Programming. In Proceedings of NaBIC 2013. IEEE Press, 232--237. https://doi.org/
[4]
Luis Muñoz, Sara Silva, and Leonardo Trujillo. 2015. M3GP: Multiclass Classification with GP. In Proceedings of EuroGP 2015 (LNCS), Vol. 9025. Springer, Copenhagen, 78--91. https://doi.org/

Index Terms

  1. To adapt or not to adapt, or the beauty of random settings

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion
    July 2019
    2161 pages
    ISBN:9781450367486
    DOI:10.1145/3319619
    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 the author(s) 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: 13 July 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. automatic adaptation
    2. negative results
    3. operator probabilities

    Qualifiers

    • Research-article

    Conference

    GECCO '19
    Sponsor:
    GECCO '19: Genetic and Evolutionary Computation Conference
    July 13 - 17, 2019
    Prague, Czech Republic

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 57
      Total Downloads
    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media