Effective Mutation Rate Adaptation through Group Elite Selection

• URL: http://arxiv.org/abs/2204.04817v1
• Date: Mon, 11 Apr 2022 01:08:26 GMT
• Title: Effective Mutation Rate Adaptation through Group Elite Selection
• Authors: Akarsh Kumar, Bo Liu, Risto Miikkulainen, Peter Stone
• Abstract summary: 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.
• Score: 50.88204196504888
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Evolutionary algorithms are sensitive to the mutation rate (MR); no single value of this parameter works well across domains. Self-adaptive MR approaches have been proposed but they tend to be brittle: Sometimes they decay the MR to zero, thus halting evolution. To make self-adaptive MR robust, 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. The resulting best mutational change in the group, instead of average mutational change, is used for MR selection during evolution, thus avoiding the vanishing MR problem. With the same number of function evaluations and with almost no overhead, GESMR converges faster and to better solutions than previous approaches on a wide range of continuous test optimization problems. GESMR also scales well to high-dimensional neuroevolution for supervised image-classification tasks and for reinforcement learning control tasks. Remarkably, GESMR produces MRs that are optimal in the long-term, as demonstrated through a comprehensive look-ahead grid search. Thus, GESMR and its theoretical and empirical analysis demonstrate how self-adaptation can be harnessed to improve performance in several applications of evolutionary computation.

Related papers

• The Informed Elastic Net for Fast Grouped Variable Selection and FDR Control in Genomics Research [9.6703621796624]
  We propose a new base selector that significantly reduces computation time while retaining the grouped variable selection property. The proposed T-Rex+GVS (IEN) exhibits the desired grouping effect, reduces time, and achieves the same TPR as T-Rex+GVS (EN) but with lower FDR.
  arXiv  Detail & Related papers  (2024-10-07T17:18:25Z)
• 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)
• Towards a Complete Metamorphic Testing Pipeline [56.75969180129005]
  Metamorphic Testing (MT) addresses the test oracle problem by examining the relationships between input-output pairs in consecutive executions of the System Under Test (SUT) These relations, known as Metamorphic Relations (MRs), specify the expected output changes resulting from specific input changes. Our research aims to develop methods and tools that assist testers in generating MRs, defining constraints, and providing explainability for MR outcomes.
  arXiv  Detail & Related papers  (2023-09-30T10:49:22Z)
• Towards Self-adaptive Mutation in Evolutionary Multi-Objective Algorithms [10.609857097723266]
  We study how self-adaptation influences multi-objective evolutionary algorithms. We show that adapting the mutation rate based on single-objective optimization and hypervolume can speed up the convergence of GSEMO. We propose a GSEMO with self-adaptive mutation, which considers optimizing for single objectives and adjusts the mutation rate for each solution individually.
  arXiv  Detail & Related papers  (2023-03-08T14:26:46Z)
• Structured mutation inspired by evolutionary theory enriches population performance and diversity [2.3577368017815705]
  Grammar-Guided Genetic Programming employs a variety of insights from evolutionary theory to autonomously design solutions for a given task. Recent insights from evolutionary biology can lead to further improvements in GGGP algorithms. We term this new method of variation Facilitated Mutation (FM)
  arXiv  Detail & Related papers  (2023-02-01T16:25:03Z)
• Coefficient Mutation in the Gene-pool Optimal Mixing Evolutionary Algorithm for Symbolic Regression [0.0]
  GP-GOMEA is a top-performing algorithm for symbolic regression. We show how simple approaches for optimizing coefficients can be integrated into GP-GOMEA. We find that coefficient mutation can help re-discover the underlying equation by a substantial amount.
  arXiv  Detail & Related papers  (2022-04-26T08:58:47Z)
• Harnessing Heterogeneity: Learning from Decomposed Feedback in Bayesian Modeling [68.69431580852535]
  We introduce a novel GP regression to incorporate the subgroup feedback. Our modified regression has provably lower variance -- and thus a more accurate posterior -- compared to previous approaches. We execute our algorithm on two disparate social problems.
  arXiv  Detail & Related papers  (2021-07-07T03:57:22Z)
• Permutation Invariant Policy Optimization for Mean-Field Multi-Agent Reinforcement Learning: A Principled Approach [128.62787284435007]
  We propose the mean-field proximal policy optimization (MF-PPO) algorithm, at the core of which is a permutation-invariant actor-critic neural architecture. We prove that MF-PPO attains the globally optimal policy at a sublinear rate of convergence. In particular, we show that the inductive bias introduced by the permutation-invariant neural architecture enables MF-PPO to outperform existing competitors.
  arXiv  Detail & Related papers  (2021-05-18T04:35:41Z)
• Reinforcement Learning for Adaptive Mesh Refinement [63.7867809197671]
  We propose a novel formulation of AMR as a Markov decision process and apply deep reinforcement learning to train refinement policies directly from simulation. The model sizes of these policy architectures are independent of the mesh size and hence scale to arbitrarily large and complex simulations.
  arXiv  Detail & Related papers  (2021-03-01T22:55:48Z)
• Modal Regression based Structured Low-rank Matrix Recovery for Multi-view Learning [70.57193072829288]
  Low-rank Multi-view Subspace Learning has shown great potential in cross-view classification in recent years. Existing LMvSL based methods are incapable of well handling view discrepancy and discriminancy simultaneously. We propose Structured Low-rank Matrix Recovery (SLMR), a unique method of effectively removing view discrepancy and improving discriminancy.
  arXiv  Detail & Related papers  (2020-03-22T03:57:38Z)

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.