Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

14284155 · Jun 202019922001200920172026
48 results for virtual drug screening

Deep learning uses ROC cost functions to improve virtual screening accuracy.

problem Challenges in training deep learning models for virtual screening, especially class imbalance and lack of ground truth labels.
method Proposes using ROC cost functions to optimize deep learning models for virtual screening, introduces new training schemes and cost functions.
result Demonstrates improved performance of ROC-based approaches on PubChem datasets.

Unified model learns from proteins and ligands for drug design.

problem Disjoint data sources and modeling assumptions limit joint use of structure- and ligand-based drug design.
method Contrastive Geometric Learning for Unified Computational Drug Design (ConGLUDe)
result Unified model achieves competitive zero-shot virtual screening performance and state-of-the-art ligand-conditioned pocket selection.

Computational approaches to drug discovery can reduce the time and cost associated with experimental assays and enable the screening of novel chemotypes. Structure-based drug design methods rely on scoring functions to rank and predict binding affinities and poses. The ever-expanding amount of protein-ligand binding an…

2016-12-08abs ↗pdf ↗

Understanding the phenotypic drug response on cancer cell lines plays a vital rule in anti-cancer drug discovery and re-purposing. The Genomics of Drug Sensitivity in Cancer (GDSC) database provides open data for researchers in phenotypic screening to test their models and methods. Previously, most research in these ar…

2018-12-28abs ↗pdf ↗

Efficiently allocate budgets for LLM-assisted virtual screening to reduce costs.

problem Reducing the cost of evaluating alternatives in large-scale screening tasks.
method Propose a top-mm greedy evaluation mechanism and the EFG-mm algorithm for efficient budget allocation.
result Prove that EFG-mm is both sample-optimal and consistent in large-scale virtual screening.

RAMBO optimizes multi-regime problems by discovering and modeling distinct energy basins.

problem Multi-regime problems in molecular conformation and drug discovery.
method Dirichlet Process Mixture of Gaussian Processes with adaptive hyperparameters and concentration parameters.
result Consistent improvements over state-of-the-art on multi-regime objectives.

Co-Diffusion predicts drug-target affinity by learning latent manifolds and diffusion, improving generalization.

problem Cold-start regimes in drug-target affinity prediction due to label scarcity and domain shifts.
method Two-stage framework: latent manifold alignment and latent diffusion regularization.
result Significantly outperforms state-of-the-art baselines, especially in zero-shot generalization.

KANEL combines models for early hit enrichment in virtual screening.

problem Assessing model accuracy in chemical bioactivity predictions.
method Ensemble workflow using Kolmogorov-Arnold Networks (KANs) and other models.
result Improves early hit enrichment metrics like PPV@N.

Study improves reliability of neural models for virtual screening.

problem Reliability issues in neural models for molecular property prediction.
method Investigated model architectures, regularization, and loss functions.
result Correct choice of regularization and inference methods improves reliability.

ChemCPA predicts cellular responses to novel drugs using transfer learning.

problem Scaling high-throughput screens to measure cellular responses for many drugs is costly and challenging.
method ChemCPA, a new encoder-decoder architecture combined with transfer learning.
result Training on existing bulk RNA HTS datasets improves generalization performance, reducing the need for extensive single-cell screens.

DOCKSTRING simplifies docking simulations for better drug design benchmarks.

problem Lack of meaningful benchmarks for ligand design.
method Open-source Python package for docking scores, extensive dataset, and pharmaceutically-relevant tasks.
result Docking scores are more appropriate benchmarks than simple physicochemical properties.

Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…

2016-06-06abs ↗pdf ↗

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-d…

2016-03-02abs ↗pdf ↗

Deep learning methods such as multitask neural networks have recently been applied to ligand-based virtual screening and other drug discovery applications. Using a set of industrial ADMET datasets, we compare neural networks to standard baseline models and analyze multitask learning effects with both random cross-valid…

2016-06-28abs ↗pdf ↗

Bayesian methods improve drug discovery experiment design.

problem Optimizing drug screening experiments in high-dimensional data.
method Bayesian inference and optimisation with upper confidence bound algorithms, Thompson sampling, and sparse tree search.
result Sparse tree search techniques outperform other methods in drug toxicity screening.

Bayesian learning improves reliability of molecular predictions for hit compound discovery.

problem Improving reliability of machine learning predictions for virtual screening.
method Bayesian learning algorithms applied to graph neural networks.
result Bayesian learning leads to well-calibrated predictions and higher hit compound success.

One of the promising methods for the treatment of complex diseases such as cancer is combinational therapy. Due to the combinatorial complexity, machine learning models can be useful in this field, where significant improvements have recently been achieved in determination of synergistic combinations. In this study, we…

2020-01-07abs ↗pdf ↗

PDBAL targets experiments for probabilistic models to maximize insights.

problem Designing experiments to yield valuable insights efficiently.
method Combines user-specified risk function with probabilistic model to adaptively choose designs.
result PDBAL consistently outperforms standard approaches in simulations and real-world drug screen data.

We propose a novel transfer learning approach for orphan screening called corresponding projections. In orphan screening the learning task is to predict the binding affinities of compounds to an orphan protein, i.e., one for which no training data is available. The identification of compounds with high affinity is a ce…

2018-11-30abs ↗pdf ↗

Complex or co-existing diseases are commonly treated using drug combinations, which can lead to higher risk of adverse side effects. The detection of polypharmacy side effects is usually done in Phase IV clinical trials, but there are still plenty which remain undiscovered when the drugs are put on the market. Such acc…

2019-05-02abs ↗pdf ↗

Develops a scalable model for drug combination prediction in cancer.

problem Accurate prediction of drug combinations for cancer treatment.
method Permutation invariant multi-output Gaussian Processes with variational approximation and deep generative model.
result Model efficiently borrows information across drug combinations and provides uncertainty quantification.

Protein-ligand scoring is an important step in a structure-based drug design pipeline. Selecting a correct binding pose and predicting the binding affinity of a protein-ligand complex enables effective virtual screening. Machine learning techniques can make use of the increasing amounts of structural data that are beco…

2018-03-06abs ↗pdf ↗

A method selects candidates based on predictions with statistical control.

problem Screening candidates for resource-intensive steps like hiring or drug discovery.
method Wraps around any prediction model to produce a subset of candidates with controlled false selection rate.
result Empirically demonstrates selection of candidates whose predictions exceed a data-dependent threshold.

FlowMO uses Gaussian Processes for molecular property prediction with uncertainty.

problem Predicting molecular properties with uncertainty for small datasets.
method Gaussian Processes implemented in FlowMO, built on GPflow and RDKit.
result Comparable predictive performance to deep learning but superior uncertainty calibration.

Network medicine predicts repurposable drugs for COVID-19.

problem Identifying effective drugs for SARS-CoV-2 infections quickly.
method Artificial intelligence, network diffusion, and network proximity algorithms.
result A multimodal approach combining predictions from multiple algorithms outperforms individual methods.

Conformal prediction fails to cover minority classes in imbalanced datasets, but a class-conditional fix improves coverage.

problem Conformal prediction fails to cover minority classes in imbalanced datasets, leading to poor performance on rare labels.
method Class-conditional conformal prediction to improve coverage of minority classes.
result Class-conditional conformal prediction restores minority coverage to target with a modest increase in prediction-set size.

Excellent ranking power along with well calibrated probability estimates are needed in many classification tasks. In this paper, we introduce a technique, Calibrated Boosting-Forest that captures both. This novel technique is an ensemble of gradient boosting machines that can support both continuous and binary labels. …

2017-10-16abs ↗pdf ↗