An Optimal Likelihood Free Method for Biological Model Selection

• URL: http://arxiv.org/abs/2208.02344v1
• Date: Wed, 3 Aug 2022 21:05:20 GMT
• Title: An Optimal Likelihood Free Method for Biological Model Selection
• Authors: Vincent D. Zaballa and Elliot E. Hui
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Systems biology seeks to create math models of biological systems to reduce inherent biological complexity and provide predictions for applications such as therapeutic development. However, it remains a challenge to determine which math model is correct and how to arrive optimally at the answer. We present an algorithm for automated biological model selection using mathematical models of systems biology and likelihood free inference methods. Our algorithm shows improved performance in arriving at correct models without a priori information over conventional heuristics used in experimental biology and random search. This method shows promise to accelerate biological basic science and drug discovery.

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)
• Boolean matrix logic programming for active learning of gene functions in genome-scale metabolic network models [4.762323642506732]
  We seek to apply logic-based machine learning techniques to facilitate cellular engineering and drive biological discovery. We introduce a new system, $BMLP_active$, which efficiently explores the genomic hypothesis space by guiding informative experimentation. $BMLP_active$ can successfully learn the interaction between a gene pair with fewer training examples than random experimentation.
  arXiv  Detail & Related papers  (2024-05-10T09:51:06Z)
• Seeing Unseen: Discover Novel Biomedical Concepts via Geometry-Constrained Probabilistic Modeling [53.7117640028211]
  We present a geometry-constrained probabilistic modeling treatment to resolve the identified issues. We incorporate a suite of critical geometric properties to impose proper constraints on the layout of constructed embedding space. A spectral graph-theoretic method is devised to estimate the number of potential novel classes.
  arXiv  Detail & Related papers  (2024-03-02T00:56:05Z)
• Phylogeny-informed fitness estimation [58.720142291102135]
  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.
  arXiv  Detail & Related papers  (2023-06-06T19:05:01Z)
• Online simulator-based experimental design for cognitive model selection [74.76661199843284]
  We propose BOSMOS: an approach to experimental design that can select between computational models without tractable likelihoods. In simulated experiments, we demonstrate that the proposed BOSMOS technique can accurately select models in up to 2 orders of magnitude less time than existing LFI alternatives.
  arXiv  Detail & Related papers  (2023-03-03T21:41:01Z)
• The Struggle for Existence: Time, Memory and Bloat [0.0]
  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.
  arXiv  Detail & Related papers  (2023-02-06T19:53:59Z)
• Inference of cell dynamics on perturbation data using adjoint sensitivity [4.606583317143614]
  Data-driven dynamic models of cell biology can be used to predict cell response to unseen perturbations. Recent work had demonstrated the derivation of interpretable models with explicit interaction terms. This work aims to extend the range of applicability of this model inference approach to a diversity of biological systems.
  arXiv  Detail & Related papers  (2021-04-13T19:15:56Z)
• A synthetic biology approach for the design of genetic algorithms with bacterial agents [0.0]
  We introduce as a novelty the designing of evolutionary algorithms where all the steps are conducted by synthetic bacteria. The results obtained open the possibility of conceiving evolutionary algorithms inspired by principles, mechanisms and genetic circuits from synthetic biology.
  arXiv  Detail & Related papers  (2021-01-19T09:59:33Z)
• 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)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)

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.