Liquid State Genetic Programming

• URL: http://arxiv.org/abs/2312.14942v1
• Date: Tue, 5 Dec 2023 17:09:21 GMT
• Title: Liquid State Genetic Programming
• Authors: Mihai Oltean
• Abstract summary: A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing the inputs (the liquid) and a Genetic Programming technique used for the problem solving part. Numerical experiments show that LSGP performs similarly and sometimes even better than standard Genetic Programming for the considered test problems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A new Genetic Programming variant called Liquid State Genetic Programming (LSGP) is proposed in this paper. LSGP is a hybrid method combining a dynamic memory for storing the inputs (the liquid) and a Genetic Programming technique used for the problem solving part. Several numerical experiments with LSGP are performed by using several benchmarking problems. Numerical experiments show that LSGP performs similarly and sometimes even better than standard Genetic Programming for the considered test problems.

Related papers

• Genetic Instruct: Scaling up Synthetic Generation of Coding Instructions for Large Language Models [54.51932175059004]
  We introduce a scalable method for generating synthetic instructions to enhance the code generation capability of Large Language Models. The proposed algorithm, Genetic-Instruct, mimics evolutionary processes, utilizing self-instruction to create numerous synthetic samples from a limited number of seeds.
  arXiv  Detail & Related papers  (2024-07-29T20:42:59Z)
• Nonparametric independence tests in high-dimensional settings, with applications to the genetics of complex disease [55.2480439325792]
  We show how defining adequate premetric structures on the support spaces of the genetic data allows for novel approaches to such testing. For each problem, we provide mathematical results, simulations and the application to real data.
  arXiv  Detail & Related papers  (2024-07-29T01:00:53Z)
• Evaluating Genetic Algorithms through the Approximability Hierarchy [55.938644481736446]
  In this paper, we analyze the usefulness of using genetic algorithms depending on the approximation class the problem belongs to. In particular, we use the standard approximability hierarchy, showing that genetic algorithms are especially useful for the most pessimistic classes of the hierarchy.
  arXiv  Detail & Related papers  (2024-02-01T09:18:34Z)
• Natural language processing for clusterization of genes according to their functions [62.997667081978825]
  We propose an approach that reduces the analysis of several thousand genes to analysis of several clusters. The descriptions are encoded as vectors using the pretrained language model (BERT) and some text processing approaches.
  arXiv  Detail & Related papers  (2022-07-17T12:59:34Z)
• Multi Expression Programming for solving classification problems [0.0]
  Multi Expression Programming (MEP) is a Genetic Programming variant which encodes multiple solutions in a single chromosome. This paper introduces and deeply describes several strategies for solving binary and multi-class classification problems within the textitmulti solutions per chromosome paradigm of MEP.
  arXiv  Detail & Related papers  (2022-03-16T13:11:50Z)
• Non-Gaussian Gaussian Processes for Few-Shot Regression [71.33730039795921]
  We propose an invertible ODE-based mapping that operates on each component of the random variable vectors and shares the parameters across all of them. NGGPs outperform the competing state-of-the-art approaches on a diversified set of benchmarks and applications.
  arXiv  Detail & Related papers  (2021-10-26T10:45:25Z)
• Solving classification problems using Traceless Genetic Programming [0.0]
  Traceless Genetic Programming (TGP) is a new Genetic Programming (GP) that may be used for solving difficult real-world problems. In this paper, TGP is used for solving real-world classification problems taken from PROBEN1.
  arXiv  Detail & Related papers  (2021-10-07T06:13:07Z)
• Using Traceless Genetic Programming for Solving Multiobjective Optimization Problems [1.9493449206135294]
  Traceless Genetic Programming (TGP) is a Genetic Programming (GP) variant that is used in cases where the focus is rather the output of the program than the program itself. Two genetic operators are used in conjunction with TGP: crossover and insertion. Numerical experiments show that TGP is able to solve very fast and very well the considered test problems.
  arXiv  Detail & Related papers  (2021-10-07T05:55:55Z)
• Solving even-parity problems using traceless genetic programming [0.0]
  TGP is a hybrid technique combining a technique for building individuals and a technique for representing individuals. Two genetic operators are used in conjunction with TGP: crossover and insertion. TGP is applied for evolving digital circuits for the even-parity problem.
  arXiv  Detail & Related papers  (2021-10-04T13:23:32Z)
• 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)
• Ensemble Genetic Programming [0.0]
  Ensemble GP follows the same steps as other Genetic Programming systems, but with differences in the population structure,fitness evaluation and genetic operators. We have tested this method oneight binary classification problems, achieving results significantly betterthan standard GP, with much smaller models.
  arXiv  Detail & Related papers  (2020-01-21T14:10:37Z)

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.