Skip to content

bisect-group/StructureFree-DTA

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

32 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Structure-Free Drug–Target Affinity Prediction

A sequence-based, language-model-driven framework for drug–target binding regression

License

Table of Contents


Introduction

Accurate drug–target affinity (DTA) prediction is critical for modern drug discovery, replacing costly and slow experimental screening. Most prior models require 3D structures, handcrafted features, or complex graphs, making them hard to generalize or scale.
This project introduces a structure-agnostic, sequence-centric approach that combines pretrained language models (LLMs) for proteins and molecules with a lightweight Residual Inception regressor for end-to-end affinity prediction, using only SMILES and FASTA sequences.

Key features:

  • No need for 3D structures or molecular graphs
  • Efficient fusion via Residual Inception blocks
  • Hybrid loss: regression + ranking
  • SOTA results on Davis, KIBA, and BindingDB datasets

Resources


Method Overview

Model Architecture

The framework consists of:

  1. Sequence Embedding

    • Proteins: ESM2 (t6-8M), transformer-based, pretrained on protein FASTA.
    • Molecules: ChemBERTa, transformer-based, pretrained on SMILES.
    • Both encoders are fine-tuned on the DTA task.
  2. Feature Fusion

    • Residual Inception Blocks:
      • Concatenate protein and molecule embeddings.
      • Pass through two parallel 1D-convolutional branches with residual connections (kernel sizes 1 and 3).
      • Outputs are concatenated, residual projected, and passed through ReLU.
  3. Regression Head

    • Flattened output → 4-layer MLP with Mish activation.
    • Output: single affinity value (e.g., Kd, Ki, or IC50).
  4. Hybrid Loss Function

    • Mean Squared Error (MSE)
    • Cosine Similarity Loss (to encourage correct ranking, i.e., high Concordance Index)
    • Combined as: L = α * L_cos + (1-α) * L_mse (α=0.5 by default)

Model Architecture


Datasets

  • Davis

    • 442 kinase proteins, 68 inhibitors, 30,056 affinity measurements
    • Nearly complete interaction matrix
    • Target: Dissociation constant (Kd)
  • KIBA

    • 229 proteins, 2,111 ligands, 118,254 affinity samples
    • Highly sparse (25% populated)
    • Target: Unified affinity score from Ki/Kd/IC50
  • BindingDB

    • 1,520 proteins, 17,936 ligands, 57,002 affinity samples
    • Extremely sparse (~0.2% populated)
    • Target: Dissociation constant (Kd)
Dataset Proteins Ligands Samples Sparsity
Davis 442 68 30,056 ~0%
KIBA 229 2,111 118,254 ~75%
BindingDB 1,520 17,936 57,002 ~99.8%

Sequence Embedding

  • Protein FASTA:

    • Tokenized with ESM2, capped at 1024 tokens
    • Global mean pooling for embedding
    • Full fine-tuning
  • SMILES:

    • Tokenized with ChemBERTa, capped at 128 tokens
    • Global mean pooling
    • Full fine-tuning
  • Empirical findings:

    • Freezing encoders = worse results
    • Larger encoders = more overfitting on small/sparse datasets

Fusion and Regression

  • Residual Inception Blocks:

    • 2 parallel Conv1d branches (kernel sizes 1 and 3) + residual
    • 2 blocks used (more → overfitting, less → underfitting)
    • Multi-scale feature fusion, low parameter count
  • Feedforward head:

    • Hidden layers: 1024 → 768 → 512 → 256 → 1
    • Mish activations, Dropout, ReLU

Loss Function

  • Hybrid Loss
    • MSE (numerical accuracy)
    • Cosine similarity (ranking, to optimize Concordance Index)
    • Default α = 0.5
# Pseudocode for hybrid loss:
L_mse = ((y_pred - y_true) ** 2).mean()
L_cos = 1 - cosine_similarity(y_pred, y_true)
loss = 0.5 * L_cos + 0.5 * L_mse

Results

All results averaged over 5-fold CV, random split, seed=0.

Performance on Davis

Method MSE CI
Our Method 0.182 0.915
3DProtDTA 0.184 0.917
MGraphDTA 0.207 0.900
BiFormerDTA 0.211 0.901
SSM-DTA 0.219 0.890
GraphDTA 0.229 0.893
MT-DTI 0.245 0.887
DeepCDA 0.248 0.891
DeepDTA 0.262 0.870

Best MSE and CI on Davis
Residual Inception blocks are sample-efficient; full fine-tuning helps the most.


Performance on KIBA

Method MSE CI
MGraphDTA 0.128 0.902
Our Method 0.135 0.902
3DProtDTA 0.138 0.893
GraphDTA 0.139 0.891
MT-DTI 0.152 0.882
SSM-DTA 0.154 0.895
BiFormerDTA 0.174 0.893
DeepCDA 0.176 0.889
DeepDTA 0.196 0.864

Matched the best CI on highly sparse KIBA
Training ~30% faster per epoch than GNN-based baselines.


Performance on BindingDB

Method MSE CI
Our Method 0.467 0.888
BridgeDPI 0.448 0.869
SubMDTA 0.456 0.867
MGraphDTA 0.488 0.864
GraphDTA 0.503 0.857
DeepCDA 0.808 0.822
DeepDTA 0.824 0.812

SOTA CI on the highly sparse BindingDB dataset
Our sequence-based approach maintains strong ranking performance even with ~99.8% sparsity.


Ablation and Negative Results

  • Freezing encoders: Underfits, CI drops <0.90
  • Cross-attention: Overfits, lower CI
  • More than 2 Inception blocks: Overfitting
  • Larger encoders: No improvement, more GPU/memory
  • Self-attention after fusion: Attention weights collapse, worse CI

Limitations

  • Dataset-specific tuning: Current hyperparameters tuned for Davis/KIBA; new datasets may need further tuning
  • Resource constraints: Large-scale/large-encoder experiments limited by hardware; current setup is SOTA on Davis/KIBA size

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages

  • Python 98.7%
  • Other 1.3%