Papers › General Binding Affinity Guidance for Diffusion Models in Structure-Based Drug Design

General Binding Affinity Guidance for Diffusion Models in Structure-Based Drug Design

24 Jun 2024arXiv:2406.16821archive 2025-07-28

Yue Jian, Curtis Wu, Danny Reidenbach, Aditi S. Krishnapriyan

Structure-Based Drug Design (SBDD) focuses on generating valid ligands that strongly and specifically bind to a designated protein pocket. Several methods use machine learning for SBDD to generate these ligands in 3D space, conditioned on the structure of a desired protein pocket. Recently, diffusion models have shown success here by modeling the underlying distributions of atomic positions and types. While these methods are effective in considering the structural details of the protein pocket, they often fail to explicitly consider the binding affinity. Binding affinity characterizes how tightly the ligand binds to the protein pocket, and is measured by the change in free energy associated with the binding process. It is one of the most crucial metrics for benchmarking the effectiveness of the interaction between a ligand and protein pocket. To address this, we propose BADGER: Binding Affinity Diffusion Guidance with Enhanced Refinement. BADGER is a general guidance method to steer the diffusion sampling process towards improved protein-ligand binding, allowing us to adjust the distribution of the binding affinity between ligands and proteins. Our method is enabled by using a neural network (NN) to model the energy function, which is commonly approximated by AutoDock Vina (ADV). ADV's energy function is non-differentiable, and estimates the affinity based on the interactions between a ligand and target protein receptor. By using a NN as a differentiable energy function proxy, we utilize the gradient of our learned energy function as a guidance method on top of any trained diffusion model. We show that our method improves the binding affinity of generated ligands to their protein receptors by up to 60\%, significantly surpassing previous machine learning methods. We also show that our guidance method is flexible and can be easily applied to other diffusion-based SBDD frameworks.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2406.16821")

Code

Syntology Ran 2 of 8 code samples harvested from 1 repository linked to this paper; 6 have no recorded run. Of those that ran: 2 ran · honoured contract.

By repository: official repository: 8 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ask-berkeley/badger-sbdd officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 2 ran; 2 honoured the contract we drafted; 6 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · honoured contract
6unverified

Licence: 0 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ask-berkeley/badger-sbdd. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

cosine_beta_schedule ask-berkeley/badger-sbdd/models/classifier_multi.py official repository ran · honoured contract fingerprinted MIT (permissive) · c92a02b48d8fb1c4 · report
get_beta_schedule ask-berkeley/badger-sbdd/models/classifier_multi.py official repository ran · honoured contract MIT (permissive) · ca0cea1ca1eeec89 · report
compose_context ask-berkeley/badger-sbdd/models/common.py official repository unverified MIT (permissive) · 413b017b3368ab8d · report
get_distance ask-berkeley/badger-sbdd/models/classifier_multi.py official repository unverified MIT (permissive) · 5befa7d29d90c70b · report
get_h_dist ask-berkeley/badger-sbdd/models/common.py official repository unverified MIT (permissive) · 3c6858db01947fd5 · report
get_r_feat ask-berkeley/badger-sbdd/models/common.py official repository unverified MIT (permissive) · 27af771ab4cfc179 · report
single_head_attention ask-berkeley/badger-sbdd/models/egtf.py official repository unverified MIT (permissive) · 104b55793b1e0a99 · report
torchify_dict ask-berkeley/badger-sbdd/datasets/pl_data.py official repository unverified MIT (permissive) · 5f7183207256b0a3 · report

Tasks

BenchmarkingDrug Design

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Diffusion

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections