Papers › Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery

Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery

4 Jun 2021ICLR 2022 4arXiv:2106.02190archive 2025-07-28

Yulun Wu, Mikaela Cashman, Nicholas Choma, Érica T. Prates, Verónica G. Melesse Vergara, Manesh Shah, Andrew Chen, Austin Clyde, Thomas S. Brettin, Wibe A. de Jong, Neeraj Kumar, Martha S. Head, Rick L. Stevens, Peter Nugent, Daniel A. Jacobson, James B. Brown

We developed Distilled Graph Attention Policy Network (DGAPN), a reinforcement learning model to generate novel graph-structured chemical representations that optimize user-defined objectives by efficiently navigating a physically constrained domain. The framework is examined on the task of generating molecules that are designed to bind, noncovalently, to functional sites of SARS-CoV-2 proteins. We present a spatial Graph Attention (sGAT) mechanism that leverages self-attention over both node and edge attributes as well as encoding the spatial structure -- this capability is of considerable interest in synthetic biology and drug discovery. An attentional policy network is introduced to learn the decision rules for a dynamic, fragment-based chemical environment, and state-of-the-art policy gradient techniques are employed to train the network with stability. Exploration is driven by the stochasticity of the action space design and the innovation reward bonuses learned and proposed by random network distillation. In experiments, our framework achieved outstanding results compared to state-of-the-art algorithms, while reducing the complexity of paths to chemical synthesis.

PaperPDFConference PDFCodeCode 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="2106.02190")

Code

Syntology Ran 0 of 14 code samples harvested from 2 repositories linked to this paper; 14 have no recorded run.

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

njchoma/DGAPN officialmentioned in papermentioned on GitHubpytorchMIT report
yulun-rayn/dgapn officialmentioned in papermentioned on GitHubpytorchMIT report
yulun-rayn/SGAnCP4ADD officialmentioned in paperMIT report
njchoma/exaLearnMol mentioned 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

14 samples harvested; 0 ran; 0 honoured the contract we drafted; 14 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.

14unverified

Licence: 0 of the 14 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

batched_expand njchoma/DGAPN/src/dgapn/gapn_policy.py official repository unverified MIT (permissive) · 4e566ed17e45c6b6 · report
batched_expand yulun-rayn/dgapn/dgapn/model/gapn_policy.py official repository unverified MIT (permissive) · 9e6703e2b65561b1 · report
batched_sample njchoma/DGAPN/src/dgapn/gapn_policy.py official repository unverified MIT (permissive) · 1a487a9d169c71fa · report
batched_sample yulun-rayn/dgapn/dgapn/model/gapn_policy.py official repository unverified MIT (permissive) · c5018328336db254 · report
batched_softmax njchoma/DGAPN/src/dgapn/gapn_policy.py official repository unverified MIT (permissive) · feafdd257791f6d0 · report
batched_softmax yulun-rayn/dgapn/dgapn/model/gapn_policy.py official repository unverified MIT (permissive) · 1f76293ee65bdb43 · report
get_largest_ring_size yulun-rayn/dgapn/dgapn/reward/logp/get_score.py official repository unverified MIT (permissive) · 4291ed1c781509d8 · report
get_main_reward njchoma/DGAPN/src/reward/get_main_reward.py official repository unverified MIT (permissive) · afb1971c85947f64 · report
get_reward yulun-rayn/dgapn/dgapn/reward/get_reward.py official repository unverified MIT (permissive) · d7caa82df22437b8 · report
main njchoma/DGAPN/src/dataset/preprocess.py official repository unverified MIT (permissive) · f050755aee6bf591 · report
read_2col njchoma/DGAPN/src/dataset/preprocess.py official repository unverified MIT (permissive) · cf327c9b704f12fd · report
read_4col njchoma/DGAPN/src/dataset/preprocess.py official repository unverified MIT (permissive) · ff8edfb59d13caa6 · report
read_data yulun-rayn/dgapn/dgapn/dataset/preprocess.py official repository unverified MIT (permissive) · c38a474680f6cdd6 · report
unpack_dataset njchoma/DGAPN/src/dataset/get_dataset.py official repository unverified MIT (permissive) · 2a4bfb02209e2e2f · report

Tasks

Drug DiscoveryGraph Attention

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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