TerraBind: Fast and Accurate Binding Affinity Prediction through Coarse Structural Representations
Matteo Rossi, Ryan Pederson, Miles Wang-Henderson, Benjamin Kaufman, Edward Williams, Carl Underkoffler, Owen Howell, Adrian Layer, Stephan Thaler, Narbe Mardirossian, John Parkhill
摘要
We present TerraBind, a foundation model for protein-ligand structure and binding affinity prediction that achieves 26-fold faster inference than state-of-the-art methods while improving affinity prediction accuracy by ∼20%. Current deep learning approaches to structure-based drug design rely on expensive allatom diffusion to generate 3D coordinates, creating inference bottlenecks that render large-scale compound screening computationally intractable. We challenge this paradigm with a critical hypothesis: full all-atom resolution is unnecessary for accurate small molecule pose and binding affinity prediction. TerraBind tests this hypothesis through a coarse pocket-level representation (protein C β atoms and ligand heavy atoms only) within a multimodal architecture combining COATI-3 molecular encodings and ESM-2 protein embeddings that learns rich structural representations, which are used in a diffusion-free optimization module for pose generation and a binding affinity likelihood prediction module. On structure prediction benchmarks (FoldBench, PoseBusters, Runs N' Poses), TerraBind matches diffusion-based baselines in ligand pose accuracy. Crucially, TerraBind outperforms Boltz-2 by ∼20% in Pearson correlation for binding affinity prediction on both a public benchmark (CASP16) and a diverse proprietary dataset (18 biochemical/cell assays). We show that the affinity prediction module also provides well-calibrated affinity uncertainty estimates, addressing a critical gap in reliable compound prioritization for drug discovery. Furthermore, this module enables a continual learning framework and a hedged batch selection strategy that, in simulated drug discovery cycles, achieves 6× greater affinity improvement of selected molecules over greedy-based approaches.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper3
- Efficiently sampling functions from Gaussian process posteriorsJames T. Wilson, Viacheslav Borovitskiy, Alexander Terenin, Peter Mostowsky 等ICML 2020 · 被引用 186 次
- Epistemic Neural NetworksIan Osband, Zheng Wen, Seyed Mohammad Asghari, Vikranth Dwaracherla 等NeurIPS 2023 · 被引用 142 次
- NeuralPLexer3: Accurate Biomolecular Complex Structure Prediction with Flow ModelsJarren Zhuoran Qiao, Feizhi Ding, Thomas Dresselhaus, Mia A. Rosenfeld 等NeurIPS 2025 · 被引用 23 次
相关 Paper
- E3Bind: An End-to-End Equivariant Network for Protein-Ligand DockingYangtian Zhang, Huiyu Cai, Chence Shi, Jian TangICLR 2023 · 被引用 13 次
- 3D Equivariant Diffusion for Target-Aware Molecule Generation and Affinity PredictionJiaqi Guan, Wesley Wei Qian, Xingang Peng, Yufeng Su 等ICLR 2023 · 被引用 79 次
- DiffDock: Diffusion Steps, Twists, and Turns for Molecular DockingGabriele Corso, Hannes Stärk, Bowen Jing, Regina Barzilay 等ICLR 2023 · 被引用 331 次
- EquiBind: Geometric Deep Learning for Drug Binding Structure PredictionHannes Stärk, Octavian Ganea, Lagnajit Pattanaik, Regina Barzilay 等ICML 2022 · 被引用 360 次
- Towards All-Atom Foundation Models for Biomolecular Binding Affinity PredictionLiang Shi, Zuobai Zhang, Huiyu Cai, Santiago Miret 等ICLR 2026
