Semantic Neighborhood Ordering in Multi-objective Genetic Programming based on Decomposition

• URL: http://arxiv.org/abs/2103.00480v2
• Date: Tue, 13 Apr 2021 18:03:09 GMT
• Title: Semantic Neighborhood Ordering in Multi-objective Genetic Programming based on Decomposition
• Authors: Fergal Stapleton and Edgar Galv\'an
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semantic diversity in Genetic Programming has proved to be highly beneficial in evolutionary search. We have witnessed a surge in the number of scientific works in the area, starting first in discrete spaces and moving then to continuous spaces. The vast majority of these works, however, have focused their attention on single-objective genetic programming paradigms, with a few exceptions focusing on Evolutionary Multi-objective Optimization (EMO). The latter works have used well-known robust algorithms, including the Non-dominated Sorting Genetic Algorithm II and the Strength Pareto Evolutionary Algorithm, both heavily influenced by the notion of Pareto dominance. These inspiring works led us to make a step forward in EMO by considering 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.

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)
• Towards Multi-Objective High-Dimensional Feature Selection via Evolutionary Multitasking [63.91518180604101]
  This paper develops a novel EMT framework for high-dimensional feature selection problems, namely MO-FSEMT. A task-specific knowledge transfer mechanism is designed to leverage the advantage information of each task, enabling the discovery and effective transmission of high-quality solutions.
  arXiv  Detail & Related papers  (2024-01-03T06:34:39Z)
• DARLEI: Deep Accelerated Reinforcement Learning with Evolutionary Intelligence [77.78795329701367]
  We present DARLEI, a framework that combines evolutionary algorithms with parallelized reinforcement learning. We characterize DARLEI's performance under various conditions, revealing factors impacting diversity of evolved morphologies. We hope to extend DARLEI in future work to include interactions between diverse morphologies in richer environments.
  arXiv  Detail & Related papers  (2023-12-08T16:51:10Z)
• The Effect of Epigenetic Blocking on Dynamic Multi-Objective Optimisation Problems [1.4502611532302039]
  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.
  arXiv  Detail & Related papers  (2022-11-25T16:33:05Z)
• Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
  We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm. We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
  arXiv  Detail & Related papers  (2022-09-15T07:22:58Z)
• Highlights of Semantics in Multi-objective Genetic Programming [0.0]
  This research expands upon the current understanding of semantics in Genetic programming (GP) by proposing a new approach: Semantic-based Distance as an additional criteriOn (SDO) Our work included an expansive analysis of the GP in terms of performance and diversity metrics, using two additional semantic-based approaches, namely Semantic Similarity-based Crossover ( SCC) and Semantic-based Crowding Distance (SCD) Using highly-unbalanced binary classification datasets, we demonstrated that the newly proposed approach of SDO consistently generated more non-dominated solutions, with better diversity and improved hypervolume results.
  arXiv  Detail & Related papers  (2022-06-10T11:49:45Z)
• Consistency and Diversity induced Human Motion Segmentation [231.36289425663702]
  We propose a novel Consistency and Diversity induced human Motion (CDMS) algorithm. Our model factorizes the source and target data into distinct multi-layer feature spaces. A multi-mutual learning strategy is carried out to reduce the domain gap between the source and target data.
  arXiv  Detail & Related papers  (2022-02-10T06:23:56Z)
• Diversity Enhancement via Magnitude [7.005458308454871]
  We use the recently developed theory of magnitude to construct a gradient flow and similar notions that systematically manipulate finite subsets of Euclidean space to enhance their diversity. We demonstrate diversity enhancement on benchmark problems using leading algorithms, and discuss extensions of the framework.
  arXiv  Detail & Related papers  (2022-01-25T01:38:53Z)
• 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)
• cMLSGA: A Co-Evolutionary Multi-Level Selection Genetic Algorithm for Multi-Objective Optimization [0.0]
  Multi-Level Selection Genetic Algorithm (MLSGA) already shows good performance on range of problems. This paper proposes a distinct set of co-evolutionary mechanisms, which defines co-evolution as competition between collectives rather than individuals.
  arXiv  Detail & Related papers  (2021-04-22T13:52:21Z)
• Promoting Semantics in Multi-objective Genetic Programming based on Decomposition [0.0]
  We show how Semantic Similarity-based Crossover (SSC) in Evolutionary Algorithms based on Decomposition (MOEA/D) promotes semantic diversity yielding better results compared to when this is not present in canonical MOEA/D.
  arXiv  Detail & Related papers  (2020-12-08T20:07:47Z)

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.