Context Matters: Adaptive Mutation for Grammars
- URL: http://arxiv.org/abs/2303.14522v1
- Date: Sat, 25 Mar 2023 17:26:20 GMT
- Title: Context Matters: Adaptive Mutation for Grammars
- Authors: Pedro Carvalho and Jessica M\'egane and Nuno Louren\c{c}o and Penousal
Machado
- Abstract summary: 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.
- Score: 2.3577368017815705
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This work proposes Adaptive Facilitated Mutation, a self-adaptive mutation
method for Structured Grammatical Evolution (SGE), biologically inspired by the
theory of facilitated variation. In SGE, the genotype of individuals contains a
list for each non-terminal of the grammar that defines the search space. In our
proposed mutation, each individual contains an array with a different,
self-adaptive mutation rate for each non-terminal. We also propose Function
Grouped Grammars, a grammar design procedure, to enhance the benefits of the
proposed mutation. Experiments were conducted on three symbolic regression
benchmarks using Probabilistic Structured Grammatical Evolution (PSGE), a
variant of SGE. Results show our approach is similar or better when compared
with the standard grammar and mutation.
Related papers
- Effective Adaptive Mutation Rates for Program Synthesis [3.2228025627337864]
Problem-solving performance of evolutionary algorithms depends on mutation rates.
We propose an adaptive bandit-based mutation scheme that removes the need to specify a mutation rate.
Results on software synthesis and symbolic regression problems validate the effectiveness of our approach.
arXiv Detail & Related papers (2024-06-23T00:56:37Z) - Predicting Genetic Mutation from Whole Slide Images via Biomedical-Linguistic Knowledge Enhanced Multi-label Classification [119.13058298388101]
We develop a Biological-knowledge enhanced PathGenomic multi-label Transformer to improve genetic mutation prediction performances.
BPGT first establishes a novel gene encoder that constructs gene priors by two carefully designed modules.
BPGT then designs a label decoder that finally performs genetic mutation prediction by two tailored modules.
arXiv Detail & Related papers (2024-06-05T06:42:27Z) - 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) - Efficient and Scalable Fine-Tune of Language Models for Genome
Understanding [49.606093223945734]
We present textscLingo: textscLanguage prefix ftextscIne-tuning for textscGentextscOmes.
Unlike DNA foundation models, textscLingo strategically leverages natural language foundation models' contextual cues.
textscLingo further accommodates numerous downstream fine-tune tasks by an adaptive rank sampling method.
arXiv Detail & Related papers (2024-02-12T21:40:45Z) - Self-Supervised Learning for Group Equivariant Neural Networks [75.62232699377877]
Group equivariant neural networks are the models whose structure is restricted to commute with the transformations on the input.
We propose two concepts for self-supervised tasks: equivariant pretext labels and invariant contrastive loss.
Experiments on standard image recognition benchmarks demonstrate that the equivariant neural networks exploit the proposed self-supervised tasks.
arXiv Detail & Related papers (2023-03-08T08:11:26Z) - 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) - Effective Mutation Rate Adaptation through Group Elite Selection [50.88204196504888]
This paper introduces the Group Elite Selection of Mutation Rates (GESMR) algorithm.
GESMR co-evolves a population of solutions and a population of MRs, such that each MR is assigned to a group of solutions.
With the same number of function evaluations and with almost no overhead, GESMR converges faster and to better solutions than previous approaches.
arXiv Detail & Related papers (2022-04-11T01:08:26Z) - Commutative Lie Group VAE for Disentanglement Learning [96.32813624341833]
We view disentanglement learning as discovering an underlying structure that equivariantly reflects the factorized variations shown in data.
A simple model named Commutative Lie Group VAE is introduced to realize the group-based disentanglement learning.
Experiments show that our model can effectively learn disentangled representations without supervision, and can achieve state-of-the-art performance without extra constraints.
arXiv Detail & Related papers (2021-06-07T07:03:14Z) - A Rank based Adaptive Mutation in Genetic Algorithm [0.0]
This paper presents an alternate approach of mutation probability generation using chromosome rank to avoid any susceptibility to fitness distribution.
Experiments are done to compare results of simple genetic algorithm (SGA) with constant mutation probability and adaptive approaches within a limited resource constraint.
arXiv Detail & Related papers (2021-04-18T12:41:33Z) - Probabilistic Grammatical Evolution [0.6445605125467573]
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)
arXiv Detail & Related papers (2021-03-15T13:54:26Z)
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.