DiscoBAX: Discovery of Optimal Intervention Sets in Genomic Experiment
Design
- URL: http://arxiv.org/abs/2312.04064v1
- Date: Thu, 7 Dec 2023 06:05:39 GMT
- Title: DiscoBAX: Discovery of Optimal Intervention Sets in Genomic Experiment
Design
- Authors: Clare Lyle, Arash Mehrjou, Pascal Notin, Andrew Jesson, Stefan Bauer,
Yarin Gal, Patrick Schwab
- Abstract summary: 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.
- Score: 61.48963555382729
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: The discovery of therapeutics to treat genetically-driven pathologies relies
on identifying genes involved in the underlying disease mechanisms. Existing
approaches search over the billions of potential interventions to maximize the
expected influence on the target phenotype. However, to reduce the risk of
failure in future stages of trials, practical experiment design aims to find a
set of interventions that maximally change a target phenotype via diverse
mechanisms. We propose DiscoBAX, a sample-efficient method for maximizing the
rate of significant discoveries per experiment while simultaneously probing for
a wide range of diverse mechanisms during a genomic experiment campaign. We
provide theoretical guarantees of approximate optimality under standard
assumptions, and conduct a comprehensive experimental evaluation covering both
synthetic as well as real-world experimental design tasks. DiscoBAX outperforms
existing state-of-the-art methods for experimental design, selecting effective
and diverse perturbations in biological systems.
Related papers
- Targeted Sequential Indirect Experiment Design [4.262342157729123]
hypotheses concern specific aspects of complex, imperfectly understood or entirely unknown mechanisms.
Experiments can not be conducted directly on the target variables of interest, but are indirect.
We develop an adaptive strategy to design indirect experiments that optimally inform a targeted query about the ground truth mechanism.
arXiv Detail & Related papers (2024-05-30T12:14:25Z) - 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) - 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) - Optimizing Adaptive Experiments: A Unified Approach to Regret Minimization and Best-Arm Identification [9.030753181146176]
We propose a unified model that simultaneously accounts for within-experiment performance and post-experiment outcomes.
We show that substantial reductions in experiment duration can often be achieved with minimal impact on both within-experiment and post-experiment regret.
arXiv Detail & Related papers (2024-02-16T11:27:48Z) - Machine learning enabled experimental design and parameter estimation
for ultrafast spin dynamics [54.172707311728885]
We introduce a methodology that combines machine learning with Bayesian optimal experimental design (BOED)
Our method employs a neural network model for large-scale spin dynamics simulations for precise distribution and utility calculations in BOED.
Our numerical benchmarks demonstrate the superior performance of our method in guiding XPFS experiments, predicting model parameters, and yielding more informative measurements within limited experimental time.
arXiv Detail & Related papers (2023-06-03T06:19:20Z) - 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) - Targeted active learning for probabilistic models [8.615625517708324]
A fundamental task in science is to design experiments that yield valuable insights about the system under study.
We present PDBAL, a targeted active learning method that adaptively designs experiments to maximize scientific utility.
arXiv Detail & Related papers (2022-10-21T17:22:03Z) - Adaptive Identification of Populations with Treatment Benefit in
Clinical Trials: Machine Learning Challenges and Solutions [78.31410227443102]
We study the problem of adaptively identifying patient subpopulations that benefit from a given treatment during a confirmatory clinical trial.
We propose AdaGGI and AdaGCPI, two meta-algorithms for subpopulation construction.
arXiv Detail & Related papers (2022-08-11T14:27:49Z) - GeneDisco: A Benchmark for Experimental Design in Drug Discovery [41.6425999218259]
In vitro cellular experimentation with genetic interventions is an essential step in early-stage drug discovery.
GeneDisco is a benchmark suite for evaluating active learning algorithms for experimental design in drug discovery.
arXiv Detail & Related papers (2021-10-22T16:01:39Z) - Policy design in experiments with unknown interference [0.0]
We study estimation and inference on policies with spillover effects.
Units are organized into a finite number of large clusters.
We provide strong theoretical guarantees and an implementation in a large-scale field experiment.
arXiv Detail & Related papers (2020-11-16T18:58:54Z)
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.