Tag-based regulation of modules in genetic programming improves context-dependent problem solving

• URL: http://arxiv.org/abs/2012.09229v3
• Date: Sat, 10 Jul 2021 00:44:12 GMT
• Title: Tag-based regulation of modules in genetic programming improves context-dependent problem solving
• Authors: Alexander Lalejini, Matthew Andres Moreno, and Charles Ofria
• Abstract summary: We introduce and experimentally demonstrate tag-based genetic regulation. Tag-based genetic regulation extends existing tag-based naming schemes. We find that tag-based regulation improves problem-solving performance on context-dependent problems.
• Score: 62.997667081978825
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce and experimentally demonstrate the utility of tag-based genetic regulation, a new genetic programming (GP) technique that allows programs to dynamically adjust which code modules to express. Tags are evolvable labels that provide a flexible mechanism for referencing code modules. Tag-based genetic regulation extends existing tag-based naming schemes to allow programs to "promote" and "repress" code modules in order to alter expression patterns. This extension allows evolution to structure a program as a gene regulatory network where modules are regulated based on instruction executions. We demonstrate the functionality of tag-based regulation on a range of program synthesis problems. We find that tag-based regulation improves problem-solving performance on context-dependent problems; that is, problems where programs must adjust how they respond to current inputs based on prior inputs. Indeed, the system could not evolve solutions to some context-dependent problems until regulation was added. Our implementation of tag-based genetic regulation is not universally beneficial, however. We identify scenarios where the correct response to a particular input never changes, rendering tag-based regulation an unneeded functionality that can sometimes impede adaptive evolution. Tag-based genetic regulation broadens our repertoire of techniques for evolving more dynamic genetic programs and can easily be incorporated into existing tag-enabled GP systems.

Related papers

• Fine-Tuning LLMs for Code Mutation: A New Era of Cyber Threats [0.9208007322096533]
  This paper explores the application of Large Language Models in the context of code mutation. Traditionally, code mutation has been employed to increase software robustness in mission-critical applications. We propose a novel definition of code mutation training tailored for pre-trained LLM-based code synthesizers.
  arXiv  Detail & Related papers  (2024-10-29T17:43:06Z)
• Comments as Natural Logic Pivots: Improve Code Generation via Comment Perspective [85.48043537327258]
  We propose MANGO (comMents As Natural loGic pivOts), including a comment contrastive training strategy and a corresponding logical comment decoding strategy. Results indicate that MANGO significantly improves the code pass rate based on the strong baselines. The robustness of the logical comment decoding strategy is notably higher than the Chain-of-thoughts prompting.
  arXiv  Detail & Related papers  (2024-04-11T08:30:46Z)
• DECIDER: A Dual-System Rule-Controllable Decoding Framework for Language Generation [57.07295906718989]
  Constrained decoding approaches aim to control the meaning or style of text generated by a Pre-trained Language Model (PLM) using specific target words during inference. We propose a novel decoding framework, DECIDER, which enables us to program rules on how we complete tasks to control a PLM.
  arXiv  Detail & Related papers  (2024-03-04T11:49:08Z)
• Toward Unified Controllable Text Generation via Regular Expression Instruction [56.68753672187368]
  Our paper introduces Regular Expression Instruction (REI), which utilizes an instruction-based mechanism to fully exploit regular expressions' advantages to uniformly model diverse constraints. Our method only requires fine-tuning on medium-scale language models or few-shot, in-context learning on large language models, and requires no further adjustment when applied to various constraint combinations.
  arXiv  Detail & Related papers  (2023-09-19T09:05:14Z)
• regulAS: A Bioinformatics Tool for the Integrative Analysis of Alternative Splicing Regulome using RNA-Seq data [0.0]
  regulAS is a bioinformatics tool designed to support computational biology researchers in investigating regulatory mechanisms of splicing alterations. The core functionality of regulAS enables the automation of computational experiments, efficient results storage and processing, and streamlined workflow management. Integrated basic modules extend regulAS with features such as RNA-Seq data retrieval from the public multi-omics UCSC Xena data repository, predictive modeling and feature ranking capabilities.
  arXiv  Detail & Related papers  (2023-07-17T19:33:49Z)
• Genetic Programming with Local Scoring [0.0]
  We present several new techniques for evolving code through sequences of mutations. Among these are (1) a method of local scoring assigning a score to each expression in a program, (2) suppose-expressions which act as an intermediate step to evolving if-conditionals, and (3) cyclic evolution in which we evolve programs through phases of expansion and reduction.
  arXiv  Detail & Related papers  (2022-11-30T18:36:42Z)
• Matchmaker, Matchmaker, Make Me a Match: Geometric, Variational, and Evolutionary Implications of Criteria for Tag Affinity [68.8204255655161]
  We show that tag-matching criteria can influence the rate of adaptive evolution and the quality of evolved solutions. By showing that tag-matching criteria influence connectivity patterns and evolutionary dynamics, our findings also raise fundamental questions about the properties of tag-matching systems in nature.
  arXiv  Detail & Related papers  (2021-08-10T08:21:45Z)
• SignalGP-Lite: Event Driven Genetic Programming Library for Large-Scale Artificial Life Applications [62.997667081978825]
  Event-driven genetic programming representations have been shown to outperform traditional imperative representations on interaction-intensive problems. Event-driven approach organizes genome content into modules that are triggered in response to environmental signals. SignalGP library caters to traditional program synthesis applications.
  arXiv  Detail & Related papers  (2021-08-01T07:20:49Z)
• Code Building Genetic Programming [0.0]
  We introduce Code Building Genetic Programming (CBGP) as a framework within which this can be done. CBGP produces a computational graph that can be executed or translated into source code of a host language.
  arXiv  Detail & Related papers  (2020-08-09T04:33:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.