Transfer Learning Bayesian Optimization to Design Competitor DNA Molecules for Use in Diagnostic Assays

• URL: http://arxiv.org/abs/2402.17704v2
• Date: Tue, 22 Oct 2024 13:19:36 GMT
• Title: Transfer Learning Bayesian Optimization to Design Competitor DNA Molecules for Use in Diagnostic Assays
• Authors: Ruby Sedgwick, John P. Goertz, Molly M. Stevens, Ruth Misener, Mark van der Wilk,
• Abstract summary: We show how the total number of experiments can be reduced by sharing information between optimization tasks. We demonstrate the reduction in the number of experiments using data from the development of DNA competitors.
• Score: 11.72580324398892
• License:
• Abstract: With the rise in engineered biomolecular devices, there is an increased need for tailor-made biological sequences. Often, many similar biological sequences need to be made for a specific application meaning numerous, sometimes prohibitively expensive, lab experiments are necessary for their optimization. This paper presents a transfer learning design of experiments workflow to make this development feasible. By combining a transfer learning surrogate model with Bayesian optimization, we show how the total number of experiments can be reduced by sharing information between optimization tasks. We demonstrate the reduction in the number of experiments using data from the development of DNA competitors for use in an amplification-based diagnostic assay. We use cross-validation to compare the predictive accuracy of different transfer learning models, and then compare the performance of the models for both single objective and penalized optimization tasks.

Related papers

• 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)
• Improving Biomedical Entity Linking with Retrieval-enhanced Learning [53.24726622142558]
  $k$NN-BioEL provides a BioEL model with the ability to reference similar instances from the entire training corpus as clues for prediction. We show that $k$NN-BioEL outperforms state-of-the-art baselines on several datasets.
  arXiv  Detail & Related papers  (2023-12-15T14:04:23Z)
• Bayesian Optimization for Robust State Preparation in Quantum Many-Body Systems [0.0]
  We apply Bayesian optimization to a state-preparation protocol recently implemented in an ultracold-atom system. Compared to manual ramp design, we demonstrate the superior performance of our optimization approach in a numerical simulation. The proposed protocol and workflow will pave the way toward the realization of more complex many-body quantum states in experiments.
  arXiv  Detail & Related papers  (2023-12-14T18:59:55Z)
• Human Comprehensible Active Learning of Genome-Scale Metabolic Networks [7.838090421892651]
  A comprehensible machine learning approach that efficiently explores the hypothesis space and guides experimental design is urgently needed. We introduce a novel machine learning framework ILP-iML1515 based on Inductive Logic Programming (ILP) ILP-iML1515 is built on comprehensible logical representations of a genome-scale metabolic model and can update the model by learning new logical structures from auxotrophic mutant trials.
  arXiv  Detail & Related papers  (2023-08-24T12:42:00Z)
• 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)
• Trustworthiness of Laser-Induced Breakdown Spectroscopy Predictions via Simulation-based Synthetic Data Augmentation and Multitask Learning [4.633997895806144]
  We consider quantitative analyses of spectral data using laser-induced breakdown spectroscopy. We address the small size of training data available, and the validation of the predictions during inference on unknown data.
  arXiv  Detail & Related papers  (2022-10-07T18:00:09Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• Knowledge transfer across cell lines using Hybrid Gaussian Process models with entity embedding vectors [62.997667081978825]
  A large number of experiments are performed to develop a biochemical process. Could we exploit data of already developed processes to make predictions for a novel process, we could significantly reduce the number of experiments needed.
  arXiv  Detail & Related papers  (2020-11-27T17:38:15Z)
• Design of Experiments for Verifying Biomolecular Networks [12.788443087394239]
  A growing trend in molecular and synthetic biology is to use mechanistic (non machine learning) models to design biomolecular networks. These networks need to be validated by experimental results to ensure the theoretical network correctly models the true system. We propose a design of experiments approach for validating these networks efficiently.
  arXiv  Detail & Related papers  (2020-11-20T13:39:45Z)
• A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention [96.77554122595578]
  We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference. Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
  arXiv  Detail & Related papers  (2020-06-22T08:35:58Z)

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.