Phylogeny-informed fitness estimation

• URL: http://arxiv.org/abs/2306.03970v1
• Date: Tue, 6 Jun 2023 19:05:01 GMT
• Title: Phylogeny-informed fitness estimation
• Authors: Alexander Lalejini, Matthew Andres Moreno, Jose Guadalupe Hernandez, Emily Dolson
• Abstract summary: We propose phylogeny-informed fitness estimation, which exploits a population's phylogeny to estimate fitness evaluations. Our results indicate that phylogeny-informed fitness estimation can mitigate the drawbacks of down-sampled lexicase. This work serves as an initial step toward improving evolutionary algorithms by exploiting runtime phylogenetic analysis.
• Score: 58.720142291102135
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Phylogenies (ancestry trees) depict the evolutionary history of an evolving population. In evolutionary computing, a phylogeny can reveal how an evolutionary algorithm steers a population through a search space, illuminating the step-by-step process by which any solutions evolve. Thus far, phylogenetic analyses have primarily been applied as post-hoc analyses used to deepen our understanding of existing evolutionary algorithms. Here, we investigate whether phylogenetic analyses can be used at runtime to augment parent selection procedures during an evolutionary search. Specifically, we propose phylogeny-informed fitness estimation, which exploits a population's phylogeny to estimate fitness evaluations. We evaluate phylogeny-informed fitness estimation in the context of the down-sampled lexicase and cohort lexicase selection algorithms on two diagnostic analyses and four genetic programming (GP) problems. Our results indicate that phylogeny-informed fitness estimation can mitigate the drawbacks of down-sampled lexicase, improving diversity maintenance and search space exploration. However, the extent to which phylogeny-informed fitness estimation improves problem-solving success for GP varies by problem, subsampling method, and subsampling level. This work serves as an initial step toward improving evolutionary algorithms by exploiting runtime phylogenetic analysis.

Related papers

• A Guide to Tracking Phylogenies in Parallel and Distributed Agent-based Evolution Models [0.0]
  In silico work with agent-based models provides an opportunity to collect high-quality records of ancestry relationships among simulated agents. Existing work generally tracks lineages directly, yielding an exact phylogenetic record of evolutionary history. Post hoc estimation is akin to how bioinformaticians build phylogenies by assessing genetic similarities between organisms.
  arXiv  Detail & Related papers  (2024-05-16T15:27:51Z)
• Phylogeny-Informed Interaction Estimation Accelerates Co-Evolutionary Learning [42.642008092347986]
  We introduce phylogeny-informed interaction estimation, which uses phylogenetic analysis to estimate interaction outcomes. We find that phylogeny-informed estimation can substantially reduce the computation required to solve problems.
  arXiv  Detail & Related papers  (2024-04-09T19:29:19Z)
• Runtime phylogenetic analysis enables extreme subsampling for test-based problems [42.642008092347986]
  We introduce phylogeny-informed subsampling, a new class of subsampling methods that exploit runtime phylogenetic analyses for solving test-based problems. We find that phylogeny-informed subsampling methods enable problem-solving success at extreme subsampling levels where other subsampling methods fail. Our diagnostic experiments show that phylogeny-informed subsampling improves diversity maintenance relative to random subsampling, but its effects on a selection scheme's capacity to rapidly exploit fitness gradients varied by selection scheme.
  arXiv  Detail & Related papers  (2024-02-02T18:14:33Z)
• PhyloGFN: Phylogenetic inference with generative flow networks [57.104166650526416]
  We introduce the framework of generative flow networks (GFlowNets) to tackle two core problems in phylogenetics: parsimony-based and phylogenetic inference. Because GFlowNets are well-suited for sampling complex structures, they are a natural choice for exploring and sampling from the multimodal posterior distribution over tree topologies. We demonstrate that our amortized posterior sampler, PhyloGFN, produces diverse and high-quality evolutionary hypotheses on real benchmark datasets.
  arXiv  Detail & Related papers  (2023-10-12T23:46:08Z)
• Biophysical Cybernetics of Directed Evolution and Eco-evolutionary Dynamics [0.0]
  We introduce a duality which maps the complexity of accounting for both ecology and individual genotypic/phenotypic types. We attack the problem of "directed evolution" in the form of a Partially Observable Markov Decision Process. This provides a tractable case of studying eco-evolutionary trajectories of a highly general type.
  arXiv  Detail & Related papers  (2023-05-05T07:45:28Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Epigenetic evolution of deep convolutional models [81.21462458089142]
  We build upon a previously proposed neuroevolution framework to evolve deep convolutional models. We propose a convolutional layer layout which allows kernels of different shapes and sizes to coexist within the same layer. The proposed layout enables the size and shape of individual kernels within a convolutional layer to be evolved with a corresponding new mutation operator.
  arXiv  Detail & Related papers  (2021-04-12T12:45:16Z)
• Population-Based Evolution Optimizes a Meta-Learning Objective [0.6091702876917279]
  We propose that meta-learning and adaptive evolvability optimize for high performance after a set of learning iterations. We demonstrate this claim with a simple evolutionary algorithm, Population-Based Meta Learning.
  arXiv  Detail & Related papers  (2021-03-11T03:45:43Z)
• AdaLead: A simple and robust adaptive greedy search algorithm for sequence design [55.41644538483948]
  We develop an easy-to-directed, scalable, and robust evolutionary greedy algorithm (AdaLead) AdaLead is a remarkably strong benchmark that out-competes more complex state of the art approaches in a variety of biologically motivated sequence design challenges.
  arXiv  Detail & Related papers  (2020-10-05T16:40: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.