Multi Expression Programming for solving classification problems

• URL: http://arxiv.org/abs/2203.13202v1
• Date: Wed, 16 Mar 2022 13:11:50 GMT
• Title: Multi Expression Programming for solving classification problems
• Authors: Mihai Oltean
• Abstract summary: Multi Expression Programming (MEP) is a Genetic Programming variant which encodes multiple solutions in a single chromosome. This paper introduces and deeply describes several strategies for solving binary and multi-class classification problems within the textitmulti solutions per chromosome paradigm of MEP.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi Expression Programming (MEP) is a Genetic Programming variant which encodes multiple solutions in a single chromosome. This paper introduces and deeply describes several strategies for solving binary and multi-class classification problems within the \textit{multi solutions per chromosome} paradigm of MEP. Extensive experiments on various classification problems are performed. MEP shows similar or better performances than other methods used for comparison (namely Artificial Neural Networks and Linear Genetic Programming).

Related papers

• UCB-driven Utility Function Search for Multi-objective Reinforcement Learning [75.11267478778295]
  In Multi-objective Reinforcement Learning (MORL) agents are tasked with optimising decision-making behaviours. We focus on the case of linear utility functions parameterised by weight vectors w. We introduce a method based on Upper Confidence Bound to efficiently search for the most promising weight vectors during different stages of the learning process.
  arXiv  Detail & Related papers  (2024-05-01T09:34:42Z)
• 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)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Numerical Methods for Convex Multistage Stochastic Optimization [86.45244607927732]
  We focus on optimisation programming (SP), Optimal Control (SOC) and Decision Processes (MDP) Recent progress in solving convex multistage Markov problems is based on cutting planes approximations of the cost-to-go functions of dynamic programming equations. Cutting plane type methods can handle multistage problems with a large number of stages, but a relatively smaller number of state (decision) variables.
  arXiv  Detail & Related papers  (2023-03-28T01:30:40Z)
• Multi-Objective GFlowNets [59.16787189214784]
  We study the problem of generating diverse candidates in the context of Multi-Objective Optimization. In many applications of machine learning such as drug discovery and material design, the goal is to generate candidates which simultaneously optimize a set of potentially conflicting objectives. We propose Multi-Objective GFlowNets (MOGFNs), a novel method for generating diverse optimal solutions, based on GFlowNets.
  arXiv  Detail & Related papers  (2022-10-23T16:15:36Z)
• Improving the Search by Encoding Multiple Solutions in a Chromosome [0.0]
  We investigate the possibility of encoding multiple solutions of a problem in a single chromosome. In order to obtain some benefits the chromosome decoding process must have the same complexity as in the case of a single solution in a chromosome. Numerical experiments show that encoding multiple solutions in a chromosome greatly improves the search process.
  arXiv  Detail & Related papers  (2021-10-13T09:38:50Z)
• Gated recurrent units and temporal convolutional network for multilabel classification [122.84638446560663]
  This work proposes a new ensemble method for managing multilabel classification. The core of the proposed approach combines a set of gated recurrent units and temporal convolutional neural networks trained with variants of the Adam gradients optimization approach.
  arXiv  Detail & Related papers  (2021-10-09T00:00:16Z)
• Multi Expression Programming -- an in-depth description [0.0]
  MEP individuals are strings of genes encoding complex computer programs. A unique MEP feature is the ability to store multiple solutions of a problem in a single chromosome.
  arXiv  Detail & Related papers  (2021-09-29T01:57:18Z)
• Evolving Digital Circuits for the Knapsack Problem [0.0]
  Multi Expression Programming (MEP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. In this paper we use Multi Expression Programming for evolving digital circuits for a well-known NP-Complete problem: the knapsack (subset sum) problem.
  arXiv  Detail & Related papers  (2021-08-21T15:48:50Z)
• Adversarial Multi-Binary Neural Network for Multi-class Classification [19.298875915675502]
  We use a multi-task framework to address multi-class classification. We employ adversarial training to distinguish the class-specific features and the class-agnostic features.
  arXiv  Detail & Related papers  (2020-03-25T02:19:17Z)
• GACEM: Generalized Autoregressive Cross Entropy Method for Multi-Modal Black Box Constraint Satisfaction [69.94831587339539]
  We present a modified Cross-Entropy Method (CEM) that uses a masked auto-regressive neural network for modeling uniform distributions over the solution space. Our algorithm is able to express complicated solution spaces, thus allowing it to track a variety of different solution regions.
  arXiv  Detail & Related papers  (2020-02-17T20:21:20Z)

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.