mlsanityData to 14 Oct 2026

Geometry-Informed Parameter-Efficient Fine-Tuning of Pre-trained Molecular GNNs for Blood-Brain Barrier Permeability Prediction

arXiv 2608.04257 ↗First posted 4 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Blood-brain barrier permeability (BBBP) prediction is a critical screening task in central nervous system drug discovery, where candidate molecules must be assessed for whether they can cross, or should be prevented from crossing, the blood-brain barrier. However, this task remains challenging because of limited, class-imbalanced datasets and sensitivity to molecular structure. Recent advances in deep learning have established graph neural networks (GNNs) as a powerful approach for molecular representation learning, while pre-trained molecular GNNs provide transferable knowledge for downstream tasks. However, full fine-tuning is often parameter-inefficient and prone to overfitting, whereas existing parameter-efficient fine-tuning (PEFT) methods mainly adapt node features or the two-dimensional covalent graph, limiting their ability to capture three-dimensional geometry and second-order interactions. To address these limitations, we propose BBBP-GeoPEFT, a geometry-informed PEFT framework for pre-trained molecular GNNs. BBBP-GeoPEFT constructs distance-based graphs at multiple cutoffs and their corresponding line graphs from molecular conformers to capture spatial atom and second-order edge interactions. Lightweight auxiliary geometric graph encoders generate cutoff-specific representations, which are incorporated into each pre-trained layer through node-wise cutoff attention and gated residual connections. This design preserves pre-trained knowledge while incorporating permeability-relevant geometric information with a small trainable-parameter budget. Experiments on a curated BBBP dataset show that BBBP-GeoPEFT achieves competitive performance compared with full fine-tuning and representative PEFT baselines. Under both random and scaffold splitting, BBBP-GeoPEFT achieves competitive or improved ROC-AUC and accuracy in most experiments while updating only 10.1% of the model parameters.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 9 of its 38 references that are in the map. First posted on arXiv 4 Aug 2026.

Builds on

9 of 38 references.

References · 9

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  2. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  3. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  4. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  5. 2019Analyzing Learned Molecular Representations for Property Predictioncited by 375
  6. 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
  7. 2025One Prompt Fits All: Universal Graph Adaptation for Pretrained Modelscited by 11
  8. 2024Molecule Graph Networks with Many-body Equivariant Interactionscited by 3
  9. 2025HLSAD: Hodge Laplacian-based Simplicial Anomaly Detectioncited by 2

Built on by

Not cited yet.