Solving classification problems using Traceless Genetic Programming

• URL: http://arxiv.org/abs/2111.14790v1
• Date: Thu, 7 Oct 2021 06:13:07 GMT
• Title: Solving classification problems using Traceless Genetic Programming
• Authors: Mihai Oltean
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Traceless Genetic Programming (TGP) is a new Genetic Programming (GP) that may be used for solving difficult real-world problems. The main difference between TGP and other GP techniques is that TGP does not explicitly store the evolved computer programs. In this paper, TGP is used for solving real-world classification problems taken from PROBEN1. Numerical experiments show that TGP performs similar and sometimes even better than other GP techniques for the considered test problems.

Related papers

• 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)
• Liquid State Genetic Programming [0.0]
  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.
  arXiv  Detail & Related papers  (2023-12-05T17:09:21Z)
• Weighted Ensembles for Active Learning with Adaptivity [60.84896785303314]
  This paper presents an ensemble of GP models with weights adapted to the labeled data collected incrementally. Building on this novel EGP model, a suite of acquisition functions emerges based on the uncertainty and disagreement rules. An adaptively weighted ensemble of EGP-based acquisition functions is also introduced to further robustify performance.
  arXiv  Detail & Related papers  (2022-06-10T11:48:49Z)
• Taylor Genetic Programming for Symbolic Regression [5.371028373792346]
  Genetic programming (GP) is a commonly used approach to solve symbolic regression (SR) problems. We propose Taylor genetic programming (TaylorGP) to approximate the symbolic equation that fits the dataset. TaylorGP not only has higher accuracy than the nine baseline methods, but also is faster in finding stable results.
  arXiv  Detail & Related papers  (2022-04-28T13:43:39Z)
• Scaling Gaussian Process Optimization by Evaluating a Few Unique Candidates Multiple Times [119.41129787351092]
  We show that sequential black-box optimization based on GPs can be made efficient by sticking to a candidate solution for multiple evaluation steps. We modify two well-established GP-Opt algorithms, GP-UCB and GP-EI to adapt rules from batched GP-Opt.
  arXiv  Detail & Related papers  (2022-01-30T20:42:14Z)
• 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)
• Incremental Ensemble Gaussian Processes [53.3291389385672]
  We propose an incremental ensemble (IE-) GP framework, where an EGP meta-learner employs an it ensemble of GP learners, each having a unique kernel belonging to a prescribed kernel dictionary. With each GP expert leveraging the random feature-based approximation to perform online prediction and model update with it scalability, the EGP meta-learner capitalizes on data-adaptive weights to synthesize the per-expert predictions. The novel IE-GP is generalized to accommodate time-varying functions by modeling structured dynamics at the EGP meta-learner and within each GP learner.
  arXiv  Detail & Related papers  (2021-10-13T15:11:25Z)
• 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)
• Learning Structures in Earth Observation Data with Gaussian Processes [67.27044745471207]
  This paper reviews the main theoretical GP developments in the field. New algorithms that respect the signal and noise characteristics, that provide feature rankings automatically, and that allow applicability of associated uncertainty intervals are discussed.
  arXiv  Detail & Related papers  (2020-12-22T10:46:37Z)
• 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.