Accelerating high-throughput virtual screening through molecular pool-based active learning

• URL: http://arxiv.org/abs/2012.07127v1
• Date: Sun, 13 Dec 2020 19:13:10 GMT
• Title: Accelerating high-throughput virtual screening through molecular pool-based active learning
• Abstract summary: We show how a structure-property model trained on the predicted affinities of a subset of a library can be applied to the remaining library members. We observe significant reductions in computational costs, even when using greedy acquisition strategy.
• Score: 2.17167311150369
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Structure-based virtual screening is an important tool in early stage drug discovery that scores the interactions between a target protein and candidate ligands. As virtual libraries continue to grow (in excess of $10^8$ molecules), so too do the resources necessary to conduct exhaustive virtual screening campaigns on these libraries. However, Bayesian optimization techniques can aid in their exploration: a surrogate structure-property relationship model trained on the predicted affinities of a subset of the library can be applied to the remaining library members, allowing the least promising compounds to be excluded from evaluation. In this study, we assess various surrogate model architectures, acquisition functions, and acquisition batch sizes as applied to several protein-ligand docking datasets and observe significant reductions in computational costs, even when using a greedy acquisition strategy; for example, 87.9% of the top-50000 ligands can be found after testing only 2.4% of a 100M member library. Such model-guided searches mitigate the increasing computational costs of screening increasingly large virtual libraries and can accelerate high-throughput virtual screening campaigns with applications beyond docking.

Related papers

• Target-Aware Bandit Allocation for Scalable Surrogate Optimization in Chemical Space [0.7817813851272347]
  We introduce BOBa, a bandit-guided surrogate optimization framework that eliminates full-library inference.<n>By treating partitions as arms in a multi-armed bandit, BOBa concentrates inference and evaluations on empirically promising partitions.<n>Our findings reveal a tunable tradeoff between screening performance and surrogate inference cost, which supports practical optimization over current libraries.
  arXiv  Detail & Related papers  (2026-06-25T06:44:15Z)
• Beyond Thinking: Imagining in 360$^\circ$ for Humanoid Visual Search [50.04233606482412]
  Humanoid Visual Search (HVS) requires agents to actively explore immersive 360$circ$ environments.<n>We propose Imagining in 360$circ$, a novel framework that decouples the exploration process into a specialized Imaginator and an Actor.<n>We show that explicitly modeling semantic spatial priors drastically improves search efficiency and success rates in complex, in-the-wild environments.
  arXiv  Detail & Related papers  (2026-05-09T20:10:53Z)
• APEX: Approximate-but-exhaustive search for ultra-large combinatorial synthesis libraries [0.28106259549258145]
  Make-on-demand synthesis libraries (CSLs) like Enamine REAL have significantly enabled drug discovery efforts.<n>Currently, a routine virtual screening campaign may be limited to scoring fewer than 0.1% of the available compounds.<n>We propose the approximate-but-exhaustive search protocol for CSLs, or APEX.
  arXiv  Detail & Related papers  (2025-10-28T12:57:59Z)
• Understanding active learning of molecular docking and its applications [0.6554326244334868]
  We investigate how active learning methodologies effectively predict docking scores using only 2D structures. Our findings suggest that surrogate models tend to memorize structural patterns prevalent in high docking scored compounds. Our comprehensive analysis underscores the reliability and potential applicability of active learning methodologies in virtual screening campaigns.
  arXiv  Detail & Related papers  (2024-06-14T05:43:42Z)
• The Power of Resets in Online Reinforcement Learning [73.64852266145387]
  We explore the power of simulators through online reinforcement learning with local simulator access (or, local planning) We show that MDPs with low coverability can be learned in a sample-efficient fashion with only $Qstar$-realizability. We show that the notorious Exogenous Block MDP problem is tractable under local simulator access.
  arXiv  Detail & Related papers  (2024-04-23T18:09:53Z)
• Pareto Optimization to Accelerate Multi-Objective Virtual Screening [11.356174411578515]
  We develop a tool to search a virtual library of over 4M molecules for those predicted to be selective dual inhibitors of EGFR and IGF1R. This workflow and associated open source software can reduce the screening burden of molecular design projects.
  arXiv  Detail & Related papers  (2023-10-16T17:19:46Z)
• DrugCLIP: Contrastive Protein-Molecule Representation Learning for Virtual Screening [16.31607535765497]
  DrugCLIP is a novel contrastive learning framework for virtual screening. It can align representations of binding protein pockets and molecules from a large quantity of pairwise data without explicit binding-affinity scores. It significantly outperforms traditional docking and supervised learning methods on diverse virtual screening benchmarks.
  arXiv  Detail & Related papers  (2023-10-10T07:08:35Z)
• Large-scale Pretraining Improves Sample Efficiency of Active Learning based Molecule Virtual Screening [3.140895145221042]
  Active learning and Bayesian optimization has been proven as effective methods of narrowing down the search space. In this study, we examined the performance of pretrained transformer-based language model and graph neural network in Bayesian optimization active learning framework. The best pretrained models identifies 58.97% of the top-50000 by docking score after screening only 0.6% of an ultra-large library containing 99.5 million compounds, improving 8% over previous state-of-the-art baseline.
  arXiv  Detail & Related papers  (2023-09-20T23:43:42Z)
• Factorization of Multi-Agent Sampling-Based Motion Planning [72.42734061131569]
  Modern robotics often involves multiple embodied agents operating within a shared environment. Standard sampling-based algorithms can be used to search for solutions in the robots' joint space. We integrate the concept of factorization into sampling-based algorithms, which requires only minimal modifications to existing methods. We present a general implementation of a factorized SBA, derive an analytical gain in terms of sample complexity for PRM*, and showcase empirical results for RRG.
  arXiv  Detail & Related papers  (2023-04-01T15:50:18Z)
• An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries [1.5495593104596397]
  Virtual, make-on-demand chemical libraries have transformed early-stage drug discovery by unlocking vast, synthetically accessible regions of chemical space. Recent years have witnessed rapid growth in these libraries from millions to trillions of compounds, hiding undiscovered, potent hits for a variety of therapeutic targets. We propose the Combinatorial Synthesis Library Variational Auto-Encoder (CSLVAE) to overcome these challenges.
  arXiv  Detail & Related papers  (2022-10-19T15:43:13Z)
• Single-Modal Entropy based Active Learning for Visual Question Answering [75.1682163844354]
  We address Active Learning in the multi-modal setting of Visual Question Answering (VQA) In light of the multi-modal inputs, image and question, we propose a novel method for effective sample acquisition. Our novel idea is simple to implement, cost-efficient, and readily adaptable to other multi-modal tasks.
  arXiv  Detail & Related papers  (2021-10-21T05:38:45Z)
• Towards an Automatic Analysis of CHO-K1 Suspension Growth in Microfluidic Single-cell Cultivation [63.94623495501023]
  We propose a novel Machine Learning architecture, which allows us to infuse a neural deep network with human-powered abstraction on the level of data. Specifically, we train a generative model simultaneously on natural and synthetic data, so that it learns a shared representation, from which a target variable, such as the cell count, can be reliably estimated.
  arXiv  Detail & Related papers  (2020-10-20T08:36:51Z)
• A Provably Efficient Sample Collection Strategy for Reinforcement Learning [123.69175280309226]
  One of the challenges in online reinforcement learning (RL) is that the agent needs to trade off the exploration of the environment and the exploitation of the samples to optimize its behavior. We propose to tackle the exploration-exploitation problem following a decoupled approach composed of: 1) An "objective-specific" algorithm that prescribes how many samples to collect at which states, as if it has access to a generative model (i.e., sparse simulator of the environment); 2) An "objective-agnostic" sample collection responsible for generating the prescribed samples as fast as possible.
  arXiv  Detail & Related papers  (2020-07-13T15:17:35Z)
• Bayesian active learning for production, a systematic study and a reusable library [85.32971950095742]
  In this paper, we analyse the main drawbacks of current active learning techniques. We do a systematic study on the effects of the most common issues of real-world datasets on the deep active learning process. We derive two techniques that can speed up the active learning loop such as partial uncertainty sampling and larger query size.
  arXiv  Detail & Related papers  (2020-06-17T14:51:11Z)

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.