Probabilistic Grammatical Evolution

• URL: http://arxiv.org/abs/2103.08389v1
• Date: Mon, 15 Mar 2021 13:54:26 GMT
• Title: Probabilistic Grammatical Evolution
• Authors: Jessica M\'egane, Nuno Louren\c{c}o, Penousal Machado
• Abstract summary: We propose Probabilistic Grammatical Evolution (PGE) to address some of its main issues and improve its performance. We resort to a Probabilistic Context-Free Grammar (PCFG) where its probabilities are adapted during the evolutionary process. We evaluate the performance of PGE in two regression problems and compare it with GE and Structured Grammatical Evolution (SGE)
• Score: 0.6445605125467573
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Grammatical Evolution (GE) is one of the most popular Genetic Programming (GP) variants, and it has been used with success in several problem domains. Since the original proposal, many enhancements have been proposed to GE in order to address some of its main issues and improve its performance. In this paper we propose Probabilistic Grammatical Evolution (PGE), which introduces a new genotypic representation and new mapping mechanism for GE. Specifically, we resort to a Probabilistic Context-Free Grammar (PCFG) where its probabilities are adapted during the evolutionary process, taking into account the productions chosen to construct the fittest individual. The genotype is a list of real values, where each value represents the likelihood of selecting a derivation rule. We evaluate the performance of PGE in two regression problems and compare it with GE and Structured Grammatical Evolution (SGE). The results show that PGE has a a better performance than GE, with statistically significant differences, and achieved similar performance when comparing with SGE.

Related papers

• VQDNA: Unleashing the Power of Vector Quantization for Multi-Species Genomic Sequence Modeling [60.91599380893732]
  VQDNA is a general-purpose framework that renovates genome tokenization from the perspective of genome vocabulary learning. By leveraging vector-quantized codebooks as learnable vocabulary, VQDNA can adaptively tokenize genomes into pattern-aware embeddings.
  arXiv  Detail & Related papers  (2024-05-13T20:15:03Z)
• GARA: A novel approach to Improve Genetic Algorithms' Accuracy and Efficiency by Utilizing Relationships among Genes [1.7226572355808027]
  We propose Gene Regulatory Genetic Algorithm (GRGA), which is the first time to utilize relationships among genes for improving GA's accuracy and efficiency. We use a directed multipartite graph encapsulating the solution space, called RGGR, where each node corresponds to a gene in the solution and the edge represents the relationship between adjacent nodes. The obtained RGGR is then employed to determine appropriate loci of crossover and mutation operators, thereby directing the evolutionary process toward faster and better convergence.
  arXiv  Detail & Related papers  (2024-04-28T08:33:39Z)
• GE-AdvGAN: Improving the transferability of adversarial samples by gradient editing-based adversarial generative model [69.71629949747884]
  Adversarial generative models, such as Generative Adversarial Networks (GANs), are widely applied for generating various types of data. In this work, we propose a novel algorithm named GE-AdvGAN to enhance the transferability of adversarial samples.
  arXiv  Detail & Related papers  (2024-01-11T16:43:16Z)
• From the One, Judge of the Whole: Typed Entailment Graph Construction with Predicate Generation [69.91691115264132]
  Entailment Graphs (EGs) are constructed to indicate context-independent entailment relations in natural languages. In this paper, we propose a multi-stage method, Typed Predicate-Entailment Graph Generator (TP-EGG) to tackle this problem. Experiments on benchmark datasets show that TP-EGG can generate high-quality and scale-controllable entailment graphs.
  arXiv  Detail & Related papers  (2023-06-07T05:46:19Z)
• Context Matters: Adaptive Mutation for Grammars [2.3577368017815705]
  This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation method for Structured Grammatical Evolution (SGE) In our proposed mutation, each individual contains an array with a different, self-adaptive mutation rate for each non-terminal. Experiments were conducted on three symbolic regression benchmarks using Probabilistic Structured Grammatical Evolution (PSGE), a variant of SGE.
  arXiv  Detail & Related papers  (2023-03-25T17:26:20Z)
• Probabilistic Structured Grammatical Evolution [0.5156484100374059]
  We propose Probabilistic Structured Grammatical Evolution (PSGE) PSGE combines the Structured Grammatical Evolution (SGE) and Probabilistic Grammatical Evolution (PGE) representation variants and mapping mechanisms. PSGE statistically outperformed Grammatical Evolution (GE) on all six benchmark problems studied.
  arXiv  Detail & Related papers  (2022-05-21T22:29:10Z)
• Co-evolutionary Probabilistic Structured Grammatical Evolution [0.5156484100374059]
  This work proposes an extension to Structured Grammatical Evolution (SGE) called Co-evolutionary Probabilistic Structured Grammatical Evolution (Co-PSGE) In Co-PSGE each individual in the population is composed by a grammar and a genotype, which is a list of dynamic lists. The performance of the proposed approach is compared to 3 different methods, namely, Grammatical Evolution (GE), Probabilistic Grammatical Evolution (PGE), and SGE on four different benchmark problems.
  arXiv  Detail & Related papers  (2022-04-19T16:35:22Z)
• Initialisation and Grammar Design in Grammar-Guided Evolutionary Computation [0.0]
  We show that genetic programming (CFG-GP) is less sensitive to initialisation and grammar design than random search and GE. We also demonstrate that observed cases of poor performance by CFG-GP are managed through simple adjustment of tuning parameters.
  arXiv  Detail & Related papers  (2022-04-15T10:15:40Z)
• Result Diversification by Multi-objective Evolutionary Algorithms with Theoretical Guarantees [94.72461292387146]
  We propose to reformulate the result diversification problem as a bi-objective search problem, and solve it by a multi-objective evolutionary algorithm (EA) We theoretically prove that the GSEMO can achieve the optimal-time approximation ratio, $1/2$. When the objective function changes dynamically, the GSEMO can maintain this approximation ratio in running time, addressing the open question proposed by Borodin et al.
  arXiv  Detail & Related papers  (2021-10-18T14:00:22Z)
• Top-N: Equivariant set and graph generation without exchangeability [61.24699600833916]
  We consider one-shot probabilistic decoders that map a vector-shaped prior to a distribution over sets or graphs. These functions can be integrated into variational autoencoders (VAE), generative adversarial networks (GAN) or normalizing flows. Top-n is a deterministic, non-exchangeable set creation mechanism which learns to select the most relevant points from a trainable reference set.
  arXiv  Detail & Related papers  (2021-10-05T14:51:19Z)
• Permutation-equivariant and Proximity-aware Graph Neural Networks with Stochastic Message Passing [88.30867628592112]
  Graph neural networks (GNNs) are emerging machine learning models on graphs. Permutation-equivariance and proximity-awareness are two important properties highly desirable for GNNs. We show that existing GNNs, mostly based on the message-passing mechanism, cannot simultaneously preserve the two properties. In order to preserve node proximities, we augment the existing GNNs with node representations.
  arXiv  Detail & Related papers  (2020-09-05T16:46:56Z)

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.