Interpreting GFlowNets for Drug Discovery: What probes can and cannot show
Not on the map. Why?
Abstract (arXiv)
Generative Flow Networks (GFlowNets) construct molecules through sequential decisions, but their internal policies remain opaque, limiting adoption in drug discovery, where chemists need interpretable rationales for proposed structures. We present a control-validated interpretability study of SynFlowNet, a synthesis-aware GFlowNet trained with a drug-likeness (QED) reward. Our framework combines gradient saliency and counterfactual edits, an undercomplete factor analysis, and an overcomplete BatchTopK sparse autoencoder, evaluated with shuffled-label controls, RDKit-descriptor baselines, a scaffold-disjoint split, cross-seed stability, and an architecture-matched untrained network. These controls materially change the interpretation. Physicochemical properties and functional groups are highly decodable from SynFlowNet embeddings, but an untrained network with the same architecture performs essentially as well as the trained policy (drug-likeness within 0.005 and marginally better molecular-size decoding). Thus, this decodability reflects graph architecture and atom featurization rather than representations acquired through policy training. The surviving conclusions are narrower: the overcomplete autoencoder reconstructs embeddings better than a matched undercomplete baseline at comparable sparsity; chemically enriched substructure detectors, including per-halogen and boron features, emerge in individual runs, although only a small subset of dictionary directions is stable across seeds; and zeroing individual features produces property-specific effects on probe decoding. Beyond SynFlowNet, this study provides a reusable control protocol for molecular-model interpretability, separating learned structure from signals supplied by architecture and input representation. High probe scores alone should not be treated as evidence of learned chemistry.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 22 references that are in the map. First posted on arXiv 24 Nov 2025.
Builds on
15 of 22 references.
References · 15
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2022Toy Models of Superpositioncited by 928
- 2019GNNExplainer: Generating Explanations for Graph Neural Networkscited by 735
- 2017Network Dissection: Quantifying Interpretability of Deep Visual Representationscited by 703
- 2019Designing and Interpreting Probes with Control Taskscited by 608
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 384
- 2020Algorithmic Recourse: from Counterfactual Explanations to Interventionscited by 250
- 2022Learning GFlowNets from partial episodes for improved convergence and stabilitycited by 129
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2020Drug discovery with explainable artificial intelligencecited by 118
Built on by
Not cited yet.