REVIEW 6 major objections 5 minor 12 references
Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks
T0 review · 6 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash
Pith's one-line read MolJO guides molecule optimization on the Bayesian belief space of a flow network, jointly steering continuous coordinates and discrete atom types, and reports state-of-the-art success on CrossDocked2020.
desk verdict Solid new guidance mechanism for BFN-based molecule optimization; the SOTA claim hinges on an unstated regressor train/test split that must be fixed before believing it. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the Bayesian belief θ, the receiver's posterior parameters over continuous coordinates θ^x and discrete atom-type logits θ^v, updated through the Bayesian update function h(θ_{i-1}, y, α_i). Guidance is exerted on θ via the score ∇_θ log p_E(θ) with p_E ∝ exp[-sE(θ,p,t)], and Proposition 4.1 reduces the guided transition kernel to shifting the Gaussian of θ^x by σ^x g_{θx} and the Gaussian of y^v by σ^v g_{yv}, where the gradients come from a learned SE(3)-equivariant energy regressor. The second mechanism is backward correction: rather than sampling θ_i only from θ_{i-1}, the update aggregates accuracy over a window of k past steps, p_U(θ_n | θ_{n-k}, x̂_n; Σ_{i=n-k+1}^n α_i), so the optimized reconstruction x̂_n replaces earlier, suboptimal estimates. Together, these two mechanisms, belief-space gradient guidance and windowed backward correction, constitute MolJO.
What would settle it
Replace the learned regressor with the exact oracle (Vina docking score, QED, and SA computed on decoded molecules) at each guidance step, or measure the gradient-field smoothness of the learned regressor on beliefs sampled from the guided trajectory at scales 50–100; if the success rate collapses or the gradient field is demonstrably non-smooth on those out-of-distribution beliefs, the guidance mechanism is the bottleneck.
Extended reading notes
Core claim
The central claim is that the correct object to guide in a Bayesian Flow Network is not the noisy latent y nor the clean molecule, but the aggregated Bayesian posterior belief θ, which lives in continuous space for coordinates and on the probability simplex for atom types. Proposition 4.1 derives, via a first-order Taylor expansion of an energy function E(θ,p,t), a guided transition kernel in which the Gaussian mean of the coordinate belief shifts by the coordinate gradient and the Gaussian latent for discrete counts shifts by the type gradient, so both modalities are steered simultaneously while keeping the discrete belief on the simplex. Proposition 4.4 shows that this guided sampling is SE(3)-equivariant whenever the backbone and energy function are equivariant and the protein is centered. The paper further claims that a backward-correction update, which aggregates the accuracy over a sliding window of past steps and conditions the current belief on the optimized reconstruction, unifies previous BFN sampling strategies and empirically improves both unguided sampling and the effectiveness of guidance. On CrossDocked2020, MolJO reports the best success rate (51.3%), Vina Dock (-9.05), and SA (0.78) among compared optimization methods, with 39.8% of generated molecules improving affinity, QED, and SA simultaneously.
Load-bearing premise
The load-bearing premise is that the learned property regressor E(θ,p,t), trained on noised BFN beliefs from CrossDocked, gives accurate and smooth gradients across the whole guided trajectory, including out-of-distribution beliefs reached at guidance scale 50; if the regressor is inaccurate or non-smooth there, the first-order Taylor approximation in Proposition 4.1 will steer sampling incorrectly.
Editorial extensions
If this is right
- If the reported numbers hold, gradient guidance becomes a viable plug-and-play optimizer for structure-based drug design without per-target oracle simulations or RL fine-tuning of the backbone.
- Joint guidance over coordinates and atom types resolves the modality imbalance that limited coordinate-only guidance, so optimized molecules can improve drug-likeness and synthesizability rather than affinity alone.
- The backward-correction window size k gives a single knob that interpolates between exploration and exploitation, letting practitioners trade sample diversity against optimization intensity.
- The framework extends to constrained settings such as R-group optimization, fragment growing, and scaffold hopping through infilling, meaning the same gradient-guided sampler handles lead-optimization tasks beyond de novo design.
- Equipping MolJO with top-of-N oracle selection raises success rate to 70.3% on the same benchmark, indicating that the gradient signal and a small screening budget are complementary.
Reading between the lines
- The paper leaves implicit that the same belief-space guidance recipe should transfer to other BFN-based generative models beyond molecules, since the derivation only uses the Gaussian or simplex structure of θ and an energy function; materials, graphs, or unified 3D models trained as BFNs could inherit MolJO-style joint guidance by swapping in a suitable regressor.
- A testable extension is to penalize the learned regressor for non-smooth gradients on out-of-distribution beliefs reached at guidance scales 50–100; if the first-order Taylor approximation is the bottleneck, such a penalty should push the reported success rate higher.
- The backward-correction update can be read as a sliding-window proximal optimizer over the belief chain, suggesting that the window size k tunes a bias-variance trade-off between error accumulation (small k) and stale, over-smoothed updates (large k), which would predict an optimal window near the value 130 used here.
- If joint θ-guidance is the causal driver of the 2x 'me-better' ratio, then coordinate-only guidance applied to the same backbone should reproduce the failure mode of good Vina but poor SA/QED, while type-only guidance should produce the opposite, a contrast the ablations hint at but do not fully disentangle.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proposes MolJO, a gradient-based structure-based molecule optimization framework built on Bayesian Flow Networks (BFNs). The method derives a joint guidance signal over continuous atomic coordinates and discrete atom types by applying product-of-experts sampling with a first-order Taylor expansion of a learned property energy function (Prop. 4.1), and introduces a 'backward correction' sampling strategy that updates the current belief from a sliding window of past history rather than only the previous step. The authors claim state-of-the-art results on CrossDocked2020 (Success Rate 51.3%, Vina Dock -9.05, SA 0.78), a 4x improvement over the gradient-based TAGMol baseline, a 2x 'Me-Better' ratio relative to 3D baselines, and additional results for multi-objective optimization, R-group optimization, and scaffold hopping.
Significance. If the empirical claims hold, MolJO would be a strong contribution: it extends classifier-guidance ideas to the continuous-discrete belief space of BFNs, provides an equivariance proof, and demonstrates broad applicability beyond unconstrained optimization. The paper includes useful empirical safeguards: 95% confidence intervals for the main metrics (Table 6), paired t-tests for the backward-correction ablation (Table 12), an inference-time comparison (Table 16), and a thoughtful analysis of molecular-size confounds (Appendix E). The backward-correction ablation is informative and shows a clear performance gain. However, the central SOTA and comparison claims rest on several details that are either underspecified or framed in a way that overstates the contribution, notably the training split of the property regressor, the backbone mismatch in the 4x claim, and the lack of algorithmic detail for constrained optimization. These issues are fixable but are load-bearing for the paper's headline conclusions.
major comments (6)
- [Appendix D.1 / Eq. (20)] The training split for the property regressor E(theta,p,t) is not specified: Eq. (20) trains on 'the molecules and their properties ... in CrossDocked dataset' without stating that p_data is restricted to the 100,000 training poses and excludes the 100 test proteins and their reference ligands. If the regressor saw test-pocket ligand complexes, the guidance gradients could steer toward test-reference-like solutions, and the reported Success Rate 51.3% and Vina Dock -9.05 would not demonstrate generalization. Please state the split explicitly and release MolJO-specific code (the current link points to the MolCRAFT repository) so this can be verified.
- [Abstract, Sec. 5.2, Table 1] The headline 'more than 4x improvement in Success Rate compared to the gradient-based counterpart' compares MolJO (51.3%) with TAGMol (11.1%), but the two methods use different generative backbones (MolCRAFT vs TargetDiff). The within-backbone gain is 26.8% (MolCRAFT) to 51.3% (MolJO), i.e., 1.9x, so the 4x framing overstates the contribution of the guidance method itself. Please either restrict the claim to a same-backbone comparison or clearly state that the comparison is across different generative backbones.
- [Sec. 4.1-4.2, Prop. 4.1, Algorithm 1] There is a mismatch between the derived guidance and the implemented guidance for the discrete modality. Prop. 4.1 defines g_yv = g_theta_v * d(theta_v)/d(y_v), but Sec. 4.2 states that 'We further bypass the derivative d(theta_v)/d(y_v) = theta_v(1-theta_v) to stabilize the gradient flow.' Algorithm 1 line 9 then samples y_v using Eq. 5 without the Jacobian term. Please clarify whether Eq. 5 is intended to include the chain-rule gradient or the bypassed gradient, and adjust the proposition or the algorithm accordingly.
- [Sec. 5.2, Fig. 1B] The claim that MolJO is '2x as effective' in proposing 'me-better' candidates (39.8% vs below 17% for other baselines) is not backed by a table. Please define the exact criterion for 'all-better' (which properties must improve, and compared against which reference), report the ratio for every baseline, and provide confidence intervals.
- [Sec. 5.3, Appendix D.2] The constrained optimization experiments are said to be 'achieved by infilling (details in Appendix D.2)', but Appendix D.2 only describes R-group and scaffold hopping task definitions and RDKit fragmentation; it does not explain how the masked or infilled regions are integrated into the guided BFN sampling of Algorithm 1. Please provide the algorithmic details (masking, conditional update of theta, and any changes to backward correction) needed to reproduce these results.
- [Appendix D.1] No validation accuracy or gradient sanity check is reported for the learned property regressor E(theta,p,t). Since guidance scale 50 can drive samples outside the training distribution of theta, the first-order Taylor expansion in Prop. 4.1 may be inaccurate in those regions; please report held-out regression error (e.g., R^2 or MAE on a validation split of noised BFN beliefs) and, ideally, an analysis of how the surrogate gradient behaves under large guidance.
minor comments (5)
- [Algorithm 1, line 8] The instruction 'Sample theta_x according to Eq. 4 and 13' is ambiguous; Eq. 4 is the guided one-step transition while Eq. 13 is the backward-corrected update. Please clarify how the two equations combine in the sampling loop.
- [Eq. 4, Prop. 4.1, Eq. 13] The notation sigma_x is used inconsistently: in Eq. 4 and Prop. 4.1 it appears as a variance parameter, while Eq. 13 gives the variance as Delta_beta / rho_n^2. Please define sigma_x and sigma_v unambiguously in terms of the BFN schedules.
- [Throughout] There are several typos and infelicities, including 'optimziation' in the Impact Statement, 'synthesizeability' in Sec. 1, 'utlizing' and 'unsatifactory' in Appendix G, and 'Cummulative' in the Fig. 9 caption. A careful proofread is recommended.
- [Table 1 vs Table 6] The FLAG row reports Vina Score 45.85 in Table 1 but 45.978 in Table 6; please reconcile these numbers or explain the difference in evaluation.
- [Appendix D.1] Please specify whether the property regressor uses the same atom featurization and kNN graph construction as TargetDiff, and how the noised BFN belief theta is featurized before being passed to that network.
Circularity Check
No circular derivation found: the guided-sampling update is a standard product-of-experts Taylor expansion and headline metrics are computed by external Vina/RDKit oracles; score 2 reflects only the non-load-bearing reuse of the authors' MolCRAFT backbone.
full rationale
MolJO's core guidance law (Prop. 4.1, Eqs. 4-5) is derived in-paper from a first-order Taylor expansion of log p_E under the product-of-experts kernel, with the BFN transition forms taken from Graves et al. (2023); this is a standard classifier-guidance construction and does not define E in terms of the reported metrics. The backward-correction update (Eqs. 11-14) follows from the BFN additive-accuracy property and interpolates between the k=1 sampler of Graves et al. and the k=n sampler of the authors' own MolCRAFT (Qu et al. 2024); its benefit is tested empirically by ablations and t-tests rather than assumed. The headline results (Table 1) are computed with AutoDock Vina, RDKit QED/SA and the standard CrossDocked Success Rate threshold, i.e., with external oracles, not with the learned energy E, so no fitted parameter is renamed as a prediction. Reuse of the MolCRAFT pretrained checkpoint is a same-group citation, but MolCRAFT is an externally published ICML model and is itself listed as a baseline (row 9 vs row 14), so the joint-guidance contribution is independently checkable. Two non-circularity caveats remain: Appendix D.1 (Eq. 20) does not explicitly state whether the property-regressor training set is restricted to the 100,000 training poses or includes the 100 test proteins, and the code URL points to the MolCRAFT repository rather than to MolJO artifacts; these are reproducibility/leakage risks that would not, even if true, make the derivation circular by construction.
Assumptions & free parameters
free parameters (3)
- guidance scale s =
50
- backward correction window k =
130
- sampling steps n =
200
assumptions (5)
- domain assumption BFN posterior update rules (Eq. 6 and 8) as defined by Graves et al. (2023)
- domain assumption Pretrained MolCRAFT backbone Phi is SE(3)-equivariant
- domain assumption Energy function E is SE(3)-equivariant and differentiable
- standard math First-order Taylor expansion of E (Eq. 18) is a good approximation
- standard math Additive accuracy property of BFN updates (used in Eq. 11-12)
Cite this review
Pith. "Pith review of Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks." pith.science (2026). https://pith.science/paper/5ZJFWMGO
@misc{pith2026241113280,
author = {Pith},
title = {Pith review of: Empower Structure-Based Molecule Optimization with Gradient Guided Bayesian Flow Networks},
year = {2026},
howpublished = {\url{https://pith.science/paper/5ZJFWMGO}},
note = {Machine review of arXiv:2411.13280}
}
read the original abstract
Structure-Based molecule optimization (SBMO) aims to optimize molecules with both continuous coordinates and discrete types against protein targets. A promising direction is to exert gradient guidance on generative models given its remarkable success in images, but it is challenging to guide discrete data and risks inconsistencies between modalities. To this end, we leverage a continuous and differentiable space derived through Bayesian inference, presenting Molecule Joint Optimization (MolJO), the gradient-based SBMO framework that facilitates joint guidance signals across different modalities while preserving SE(3)-equivariance. We introduce a novel backward correction strategy that optimizes within a sliding window of the past histories, allowing for a seamless trade-off between explore-and-exploit during optimization. MolJO achieves state-of-the-art performance on CrossDocked2020 benchmark (Success Rate 51.3%, Vina Dock -9.05 and SA 0.78), more than 4x improvement in Success Rate compared to the gradient-based counterpart, and 2x "Me-Better" Ratio as much as 3D baselines. Furthermore, we extend MolJO to a wide range of optimization settings, including multi-objective optimization and challenging tasks in drug design such as R-group optimization and scaffold hopping, further underscoring its versatility. Code is available at https://github.com/AlgoMole/MolCRAFT.
Figures
Figures from the paper (13 more)
Reference graph
Works this paper leans on
-
[2]
Han, X., Shan, C., Shen, Y ., Xu, C., Yang, H., Li, X., and Li, D
enrichment factors in database screening.Journal of medicinal chemistry, 47(7):1750–1759, 2004. Han, X., Shan, C., Shen, Y ., Xu, C., Yang, H., Li, X., and Li, D. Training-free multi-objective diffusion model for 3d molecule generation. InThe Twelfth International Conference on Learning Representations, 2023. Harris, C., Didi, K., Jamasb, A. R., Joshi, C....
arXiv 2004
-
[3]
ISSN 0959440X. doi: 10.1016/j.sbi.2023. 102548. URL https://linkinghub.elsevier. com/retrieve/pii/S0959440X23000222. Jin, W., Barzilay, R., and Jaakkola, T. Junction tree vari- ational autoencoder for molecular graph generation. In International conference on machine learning, pp. 2323–
-
[5]
URL https://proceedings.mlr.press/ v202/kong23b.html. Kong, L., Du, Y ., Mu, W., Neklyudov, K., De Bortol, V ., Wang, H., Wu, D., Ferber, A., Ma, Y .-A., Gomes, C. P., et al. Diffusion models as constrained samplers for op- timization with unknown constraints.arXiv preprint arXiv:2402.18012, 2024. Lin, H., Huang, Y ., Liu, M., Li, X., Ji, S., and Li, S. Z...
arXiv 2024
-
[8]
Qu, Y ., Qiu, K., Song, Y ., Gong, J., Han, J., Zheng, M., Zhou, H., and Ma, W.-Y
URL https://openreview.net/forum? id=192L9cr-8HU. Qu, Y ., Qiu, K., Song, Y ., Gong, J., Han, J., Zheng, M., Zhou, H., and Ma, W.-Y . MolCRAFT: Structure-based drug design in continuous parameter space. InForty- first International Conference on Machine Learning,
-
[1000]
Table 12.P-values for pairwise t-tests
for our proposed strategy. Table 12.P-values for pairwise t-tests. p-value Vina Score Vina Min Vina Dock SA QED Ours vs. Vanilla 2.63E-13 3.31E-31 2.79E-35 8.10E-115 1.98E-26 Ours vs. SDE 2.55E-19 6.48E-19 7.84E-4 2.10E-50 1.82E-12 Effect of Scales.We conduct a grid search of guidance scales, and report the full results of ablation studies on different gu...
-
[2020]
Olivecrona, M., Blaschke, T., Engkvist, O., and Chen, H
URL https://openreview.net/forum? id=H1lmyRNFvr. Olivecrona, M., Blaschke, T., Engkvist, O., and Chen, H. Molecular de-novo design through deep reinforcement learning.Journal of cheminformatics, 9(1):1–14, 2017. Peng, X., Luo, S., Guan, J., Xie, Q., Peng, J., and Ma, J. Pocket2Mol: Efficient molecular sampling based on 3D protein pockets. In Chaudhuri, K....
work page 2017
-
[2021]
and QED, SA calculated by RDKit, we elaborate other metrics as follows: • Diversitymeasures the diversity of generated molecules for each binding site. Following SBDD convention (Luo et al., 2021), it is based on Tanimoto similarity over Morgan fingerprints, and averaged across 100 test proteins. •Connected Ratiois the ratio of complete molecules overall,...
work page 2023
-
[2022]
URL https://proceedings.mlr.press/ v162/peng22b.html. Pinheiro, P. O., Jamasb, A., Mahmood, O., Sresht, V ., and Saremi, S. Structure-based drug design by denoising voxel grids. InICML, 2024. Polykovskiy, D., Zhebrak, A., Sanchez-Lengeling, B., Golo- vanov, S., Tatanov, O., Belyaev, S., Kurbanov, R., Arta- monov, A., Aladinskiy, V ., Veselov, M., et al. M...
work page 2024
Show all 12 references
-
[2023]
Halgren, T
URL https://proceedings.mlr.press/ v202/guan23a.html. Halgren, T. A., Murphy, R. B., Friesner, R. A., Beard, H. S., Frye, L. L., Pollard, W. T., and Banks, J. L. Glide: a new approach for rapid, accurate docking and scoring
-
[2024]
Schneuing, A., Du, Y ., Harris, C., Jamasb, A., Igashov, I., Du, W., Blundell, T., Lió, P., Gomes, C., Welling, M., Bronstein, M., and Correia, B
URL https://openreview.net/forum? id=KaAQu5rNU1. Schneuing, A., Du, Y ., Harris, C., Jamasb, A., Igashov, I., Du, W., Blundell, T., Lió, P., Gomes, C., Welling, M., Bronstein, M., and Correia, B. Structure-based Drug Design with Equivariant Diffusion Models, Oc- tober 2022. UR...
2022 arXiv
-
[2025]
sender” and a “receiver
URL https://openreview.net/forum? id=Lz0XW99tE0. Xie, Y ., Shi, C., Zhou, H., Yang, Y ., Zhang, W., Yu, Y ., and Li, L. {MARS}: Markov molecular sampling for multi- objective drug discovery. InInternational Conference on Learning Representations, 2021. URL https:// openreview....
2023 arXiv
-
[2332]
Kong, L., Cui, J., Sun, H., Zhuang, Y ., Prakash, B
PMLR, 2018. Kong, L., Cui, J., Sun, H., Zhuang, Y ., Prakash, B. A., and Zhang, C. Autoregressive diffusion model for graph generation. In Krause, A., Brunskill, E., Cho, K., En- gelhardt, B., Sabato, S., and Scarlett, J. (eds.),Pro- ceedings of the 40th International Conferen...
2018
Reviewed August 12, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.