The Effect of Epigenetic Blocking on Dynamic Multi-Objective Optimisation Problems

• URL: http://arxiv.org/abs/2211.14222v1
• Date: Fri, 25 Nov 2022 16:33:05 GMT
• Title: The Effect of Epigenetic Blocking on Dynamic Multi-Objective Optimisation Problems
• Authors: Sizhe Yuen, Thomas H.G. Ezard, Adam J. Sobey
• Abstract summary: Epigenetic mechanisms allow quick non- or partially-genetic adaptations to environmental changes. This paper asks if the advantages that epigenetic inheritance provide in the natural world are replicated in dynamic multi-objective problems.
• Score: 1.4502611532302039
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hundreds of Evolutionary Computation approaches have been reported. From an evolutionary perspective they focus on two fundamental mechanisms: cultural inheritance in Swarm Intelligence and genetic inheritance in Evolutionary Algorithms. Contemporary evolutionary biology looks beyond genetic inheritance, proposing a so-called ``Extended Evolutionary Synthesis''. Many concepts from the Extended Evolutionary Synthesis have been left out of Evolutionary Computation as interest has moved toward specific implementations of the same general mechanisms. One such concept is epigenetic inheritance, which is increasingly considered central to evolutionary thinking. Epigenetic mechanisms allow quick non- or partially-genetic adaptations to environmental changes. Dynamic multi-objective optimisation problems represent similar circumstances to the natural world where fitness can be determined by multiple objectives (traits), and the environment is constantly changing. This paper asks if the advantages that epigenetic inheritance provide in the natural world are replicated in dynamic multi-objective optimisation problems. Specifically, an epigenetic blocking mechanism is applied to a state-of-the-art multi-objective genetic algorithm, MOEA/D-DE, and its performance is compared on three sets of dynamic test functions, FDA, JY, and UDF. The mechanism shows improved performance on 12 of the 16 test problems, providing initial evidence that more algorithms should explore the wealth of epigenetic mechanisms seen in the natural world.

Related papers

• 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)
• Lamarckian Inheritance Improves Robot Evolution in Dynamic Environments [2.111420195774799]
  This study explores the integration of Lamarckian system into evolutionary robotics (ER) By adopting Lamarckian principles, robots inherit learned traits, alongside Darwinian learning without inheritance, we investigate adaptation in dynamic settings. Our research, conducted in six distinct environmental setups, demonstrates that Lamarckian systems outperform Darwinian ones in adaptability and efficiency.
  arXiv  Detail & Related papers  (2024-03-28T16:27:20Z)
• When large language models meet evolutionary algorithms [48.213640761641926]
  Pre-trained large language models (LLMs) have powerful capabilities for generating creative natural text. Evolutionary algorithms (EAs) can discover diverse solutions to complex real-world problems. Motivated by the common collective and directionality of text generation and evolution, this paper illustrates the parallels between LLMs and EAs.
  arXiv  Detail & Related papers  (2024-01-19T05:58:30Z)
• Causal machine learning for single-cell genomics [94.28105176231739]
  We discuss the application of machine learning techniques to single-cell genomics and their challenges. We first present the model that underlies most of current causal approaches to single-cell biology. We then identify open problems in the application of causal approaches to single-cell data.
  arXiv  Detail & Related papers  (2023-10-23T13:35:24Z)
• A Neuro-mimetic Realization of the Common Model of Cognition via Hebbian Learning and Free Energy Minimization [55.11642177631929]
  Large neural generative models are capable of synthesizing semantically rich passages of text or producing complex images. We discuss the COGnitive Neural GENerative system, such an architecture that casts the Common Model of Cognition.
  arXiv  Detail & Related papers  (2023-10-14T23:28:48Z)
• Role of Morphogenetic Competency on Evolution [0.0]
  In Evolutionary Computation, the inverse relationship (impact of intelligence on evolution) is approached from the perspective of organism level behaviour. We focus on the intelligence of a minimal model of a system navigating anatomical morphospace. We evolve populations of artificial embryos using a standard genetic algorithm in silico.
  arXiv  Detail & Related papers  (2023-10-13T11:58:18Z)
• Epigenetics Algorithms: Self-Reinforcement-Attention mechanism to regulate chromosomes expression [0.0]
  This paper proposes a new epigenetics algorithm that mimics the epigenetics phenomenon known as methylation. The novelty of our epigenetics algorithms lies primarily in taking advantage of attention mechanisms and deep learning, which fits well with the genes/silencing concept.
  arXiv  Detail & Related papers  (2023-03-15T21:33:21Z)
• Unsupervised ensemble-based phenotyping helps enhance the discoverability of genes related to heart morphology [57.25098075813054]
  We propose a new framework for gene discovery entitled Un Phenotype Ensembles. It builds a redundant yet highly expressive representation by pooling a set of phenotypes learned in an unsupervised manner. These phenotypes are then analyzed via (GWAS), retaining only highly confident and stable associations.
  arXiv  Detail & Related papers  (2023-01-07T18:36:44Z)
• 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)
• Epigenetic opportunities for Evolutionary Computation [0.0]
  Evolutionary Computation is a group of biologically inspired algorithms used to solve complex optimisation problems. It can be split into Evolutionary Algorithms, which take inspiration from genetic inheritance, and Swarm Intelligence algorithms, that take inspiration from cultural inheritance. This paper breaks down successful bio-inspired algorithms under a contemporary biological framework based on the Extended Evolutionary Synthesis.
  arXiv  Detail & Related papers  (2021-08-10T09:44:53Z)
• Semantic Neighborhood Ordering in Multi-objective Genetic Programming based on Decomposition [0.0]
  We show how we can promote semantic diversity in Evolutionary Multi-objective Optimization (EMO) using Multi-objective Evolutionary Algorithms Based on Decomposition (MOEA/D) We show, for the first time, how we can promote semantic diversity in MOEA/D in Genetic Programming.
  arXiv  Detail & Related papers  (2021-02-28T12:18: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.