The Struggle for Existence: Time, Memory and Bloat
- URL: http://arxiv.org/abs/2302.03096v2
- Date: Tue, 30 May 2023 21:00:56 GMT
- Title: The Struggle for Existence: Time, Memory and Bloat
- Authors: John C Stevenson
- Abstract summary: implicit, endogenous, evolutionary optimization of genetic programs for study of biological systems is tested.
Novel solutions confirm the creativity of the optimization process and provide an unique opportunity to experimentally test the neutral code.
Use of this implicit, genetically, spatially programmed agents is shown to be novel, consistent with biological systems, and effective and efficient in discovering fit and novel solutions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Combining a spatiotemporal, multi-agent based model of a foraging ecosystem
with linear, genetically programmed rules for the agents' behaviors results in
implicit, endogenous, objective functions and selection algorithms based on
"natural selection". Use of this implicit optimization of genetic programs for
study of biological systems is tested by application to an artificial foraging
ecosystem, and compared with established biological, ecological, and stochastic
gene diffusion models. Limited program memory and execution time constraints
emulate real-time and concurrent properties of physical and biological systems,
and stress test the optimization algorithms. Relative fitness of the agents'
programs and efficiency of the resultant populations as functions of these
constraints gauge optimization effectiveness and efficiency. Novel solutions
confirm the creativity of the optimization process and provide an unique
opportunity to experimentally test the neutral code bloating hypotheses. Use of
this implicit, endogenous, evolutionary optimization of spatially interacting,
genetically programmed agents is thus shown to be novel, consistent with
biological systems, and effective and efficient in discovering fit and novel
solutions.
Related papers
- Conformal Prediction in Dynamic Biological Systems [0.6144680854063939]
Uncertainty quantification (UQ) is the process of systematically determining and characterizing the degree of confidence in computational model predictions.
Here, we focus on dynamic models represented by deterministic nonlinear ordinary differential equations.
We propose the use of conformal inference methods, introducing two novel algorithms that, in some instances, offer non-asymptotic guarantees.
arXiv Detail & Related papers (2024-09-04T12:20:27Z) - BioDiscoveryAgent: An AI Agent for Designing Genetic Perturbation Experiments [112.25067497985447]
We introduce BioDiscoveryAgent, an agent that designs new experiments, reasons about their outcomes, and efficiently navigates the hypothesis space to reach desired solutions.
BioDiscoveryAgent can uniquely design new experiments without the need to train a machine learning model.
It achieves an average of 21% improvement in predicting relevant genetic perturbations across six datasets.
arXiv Detail & Related papers (2024-05-27T19:57:17Z) - Simulation-based optimization of a production system topology -- a
neural network-assisted genetic algorithm [0.0]
A novel approach is presented for topology optimization of production systems using a genetic algorithm (GA)
An extension to the GA is presented in which a neural network functions as a surrogate model for simulation.
Both approaches are effective at finding the optimal solution in industrial settings.
arXiv Detail & Related papers (2024-02-02T15:52:10Z) - DiscoBAX: Discovery of Optimal Intervention Sets in Genomic Experiment
Design [61.48963555382729]
We propose DiscoBAX as a sample-efficient method for maximizing the rate of significant discoveries per experiment.
We provide theoretical guarantees of approximate optimality under standard assumptions, and conduct a comprehensive experimental evaluation.
arXiv Detail & Related papers (2023-12-07T06:05:39Z) - Benchmarking Differential Evolution on a Quantum Simulator [0.0]
Differential Evolution (DE) can be used to compute the minima of functions such as the rastrigin function and rosenbrock function.
This work is an attempt to study the result of applying the DE method on these functions with candidate individuals generated on classical Turing modeled computation.
arXiv Detail & Related papers (2023-11-06T14:27:00Z) - An Empirical Evaluation of Zeroth-Order Optimization Methods on
AI-driven Molecule Optimization [78.36413169647408]
We study the effectiveness of various ZO optimization methods for optimizing molecular objectives.
We show the advantages of ZO sign-based gradient descent (ZO-signGD)
We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
arXiv Detail & Related papers (2022-10-27T01:58:10Z) - An Optimal Likelihood Free Method for Biological Model Selection [0.0]
Systems biology seeks to create math models of biological systems to reduce inherent biological complexity.
We present an algorithm for automated biological model selection using mathematical models of systems biology and likelihood free inference methods.
arXiv Detail & Related papers (2022-08-03T21:05:20Z) - Bayesian optimization with known experimental and design constraints for
chemistry applications [0.0]
We extend our experiment planning algorithms Phoenics and Gryffin such that they can handle arbitrary known constraints.
We illustrate their practical utility in two simulated chemical research scenarios.
arXiv Detail & Related papers (2022-03-29T22:16:54Z) - Constrained multi-objective optimization of process design parameters in
settings with scarce data: an application to adhesive bonding [48.7576911714538]
Finding the optimal process parameters for an adhesive bonding process is challenging.
Traditional evolutionary approaches (such as genetic algorithms) are then ill-suited to solve the problem.
In this research, we successfully applied specific machine learning techniques to emulate the objective and constraint functions.
arXiv Detail & Related papers (2021-12-16T10:14:39Z) - Emergent Hand Morphology and Control from Optimizing Robust Grasps of
Diverse Objects [63.89096733478149]
We introduce a data-driven approach where effective hand designs naturally emerge for the purpose of grasping diverse objects.
We develop a novel Bayesian Optimization algorithm that efficiently co-designs the morphology and grasping skills jointly.
We demonstrate the effectiveness of our approach in discovering robust and cost-efficient hand morphologies for grasping novel objects.
arXiv Detail & Related papers (2020-12-22T17:52:29Z) - 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.