mlsanityData to 14 Oct 2026

Exploiting Pretrained Biochemical Language Models for Targeted Drug Design

arXiv 2209.00981 ↗First posted 2 Sep 2022cs.LG cs.CL q-bio.BMcited by 10

Not on the map. Why?

Abstract (arXiv)

Motivation: The development of novel compounds targeting proteins of interest is one of the most important tasks in the pharmaceutical industry. Deep generative models have been applied to targeted molecular design and have shown promising results. Recently, target-specific molecule generation has been viewed as a translation between the protein language and the chemical language. However, such a model is limited by the availability of interacting protein-ligand pairs. On the other hand, large amounts of unlabeled protein sequences and chemical compounds are available and have been used to train language models that learn useful representations. In this study, we propose exploiting pretrained biochemical language models to initialize (i.e. warm start) targeted molecule generation models. We investigate two warm start strategies: (i) a one-stage strategy where the initialized model is trained on targeted molecule generation (ii) a two-stage strategy containing a pre-finetuning on molecular generation followed by target specific training. We also compare two decoding strategies to generate compounds: beam search and sampling. Results: The results show that the warm-started models perform better than a baseline model trained from scratch. The two proposed warm-start strategies achieve similar results to each other with respect to widely used metrics from benchmarks. However, docking evaluation of the generated compounds for a number of novel proteins suggests that the one-stage strategy generalizes better than the two-stage strategy. Additionally, we observe that beam search outperforms sampling in both docking evaluation and benchmark metrics for assessing compound quality. Availability and implementation: The source code is available at https://github.com/boun-tabi/biochemical-lms-for-drug-design and the materials are archived in Zenodo at https://doi.org/10.5281/zenodo.6832145

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 17 of its 52 references that are in the map. First posted on arXiv 2 Sep 2022.

Builds on

17 of 52 references.

References · 17

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  5. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  6. 2020ChemBERTa: Large-Scale Self-Supervised Pretraining for Molecular Property Predictioncited by 337
  7. 2018Molecular Sets (MOSES): A Benchmarking Platform for Molecular Generation Modelscited by 275
  8. 2018Fr'echet ChemNet Distance: A metric for generative models for molecules in drug discoverycited by 194
  9. 2019Leveraging Pre-trained Checkpoints for Sequence Generation Taskscited by 182
  10. 2020ProtTrans: Towards Cracking the Language of Life's Code Through Self-Supervised Deep Learning and High Performance Computingcited by 162
  11. 2020Is MAP Decoding All You Need? The Inadequacy of the Mode in Neural Machine Translationcited by 138
  12. 2020Molecular representation learning with language models and domain-relevant auxiliary taskscited by 94
5 more
  1. 2021Variational Transformer Networks for Layout Generationcited by 88
  2. 2020Variational Transformers for Diverse Response Generationcited by 36
  3. 2020CogMol: Target-Specific and Selective Drug Design for COVID-19 Using Deep Generative Modelscited by 8
  4. 2018Latent Molecular Optimization for Targeted Therapeutic Designcited by 6
  5. 2020Pre-training Protein Language Models with Label-Agnostic Binding Pairs Enhances Performance in Downstream Taskscited by 4

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 4; 2025: 3.

10 papers.