IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i5p779-d1600663.html
   My bibliography  Save this article

BERT Mutation: Deep Transformer Model for Masked Uniform Mutation in Genetic Programming

Author

Listed:
  • Eliad Shem-Tov

    (Department of Software and Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

  • Moshe Sipper

    (Department of Computer Science, Ben-Gurion University, Beer-Sheva 8410501, Israel)

  • Achiya Elyasaf

    (Department of Software and Information Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva 8410501, Israel)

Abstract

We introduce BERT mutation, a novel, domain-independent mutation operator for Genetic Programming (GP) that leverages advanced Natural Language Processing (NLP) techniques to improve convergence, particularly using the Masked Language Modeling approach. By combining the capabilities of deep reinforcement learning and the BERT transformer architecture, BERT mutation intelligently suggests node replacements within GP trees to enhance their fitness. Unlike traditional stochastic mutation methods, BERT mutation adapts dynamically by using historical fitness data to optimize mutation decisions, resulting in more effective evolutionary improvements. Through comprehensive evaluations across three benchmark domains, we demonstrate that BERT mutation significantly outperforms conventional and state-of-the-art mutation operators in terms of convergence speed and solution quality. This work represents a pivotal step toward integrating state-of-the-art deep learning into evolutionary algorithms, pushing the boundaries of adaptive optimization in GP.

Suggested Citation

  • Eliad Shem-Tov & Moshe Sipper & Achiya Elyasaf, 2025. "BERT Mutation: Deep Transformer Model for Masked Uniform Mutation in Genetic Programming," Mathematics, MDPI, vol. 13(5), pages 1-17, February.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:779-:d:1600663
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/5/779/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/5/779/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:5:p:779-:d:1600663. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.