- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2(+1)
- Soundness
- 2
Read review
Paper summary
Built on Branching Flows, AtomBloom is a pocket conditional framework that allows for the generation of binders such as small molecules, peptides and antibodies with the possibility of making atoms to split and disappear during the generation trajectory. To make the atoms appear, split and disappear they introduced: a strategy to delete or split atoms (see Eq.15, Eq.16, Eq.18), a dynamic coordinate rescaling (Eq.19) to compress coordinates initially and restore them gradually and a self conditioning strategy to make the model see the lineage of the previous atom state (see Eq.20). The authors benchmark on LNR peptides, RAbD antibodies, and CrossDocked small molecules.
Critical strengths
Finding the right molecule and cardinality of a molecule is difficult and relevant problem to solve. The paper provide an interesting solution treating the cardinality as a jointly generated with the molecular structure (see Summary). The formulation is rigorous, even though inconsistent in some instances and difficult to understand (see Questions and Weaknesses for details). I find the benchmarks relevant even if some relevant metrics seems to be missing (see Questions and Weaknesses for details).
Critical weaknesses
-
The method doesn't have explicit control on the final atom count and atoms emerge during the generative process. This can be a drawback in certain use cases where the size need to be constrained a priori.
-
The related work section is too synthetic and doesn't provide depth and breadth on how the method is positioning. You can see my questions on this point below.
-
The method part is quite hard to read, with some inconsistencies. See my questions related to the method part below.
-
Several relevant metrics in the experiments are missing. This makes it really hard to understand the advantages of the method against competitors. I am listing here some relevant ones missing. For small molecules, chemical validity (RDKit chemically valid), fraction of fragmented molecules, uniqueness (fraction of distinct SMILES among valid outputs), novelty (fraction of not in training set). For peptides, Ramachandran plot, C$\alpha$ chirality correctness.
-
Recent methods for molecular generation are not referenced in the paper ie. [1]. I leave the authors to find others.
-
The paper doesn't provide inference time comparisons against the baselines.
[1]. Cremer et al. (2025) FLOWR: Flow Matching for Structure-Aware De Novo, Interaction-and Fragment-Based Ligand Generation. https://arxiv.org/abs/2504.10564
Questions for authors
-
There are several issues in the reference section, ie inconsistent citations format, missing url. I give here two examples, and the authors can fix the rest.
Example 1
Xiangzhe Kong, Yinjun Jia, Wenbing Huang, and Yang Liu. Full-atom peptide design with geometric latent diffusion. arXiv preprint arXiv:2402.13555, 2024
They cite this paper as arXiv, despite being a NeurIPS 2024 (https://neurips.cc/virtual/2024/poster/95784). Please, always reference to the full pubblication if the paper was accepted.
Example 2
Xiangzhe Kong, Zishen Zhang, Ziting Zhang, Rui Jiao, Jianzhu Ma, Wenbing Huang, Kai Liu, and Yang Liu. Unimomo: Unified generative modeling of 3d molecules for de novo binder design. 2025. URL https://arxiv.org/abs/2503.19300.
Here, another example of a paper accepted at ICML 2024 (https://icml.cc/virtual/2025/poster/45639). Despite both listed references should be linked to where they were pubblished, the point here is different. The two ArXiv you cited follow for some reasons different formats, which should not be the case.
-
Questions method.
-
I think that there is a notation mismatch between Eq. 46 and Eq. 18.
-
Why isn't referenced in the proposition of Eq.18?
-
I would avoid to use in Eq.13 "BCEWithLogits" to refer to the operation.
-
Can you provide more details on how this term Γ is sampled ? Here an illustration referenced in the appendix could really help to understand how is sampled.
-
In several occasion things are explained in the Appendix. For example, Eq.19 uses , and defined in Appendix F.
-
-
Related works questions.
-
The lack of a priori control over output size is a limitation for applications requiring fixed-size binders. Could you expand it in the related works to discuss this?
-
Can you expand the discussion of the different existing methods in the related works? Currently, most of the related works are in the appendix and very little discussion of the paper positioning is provided in the main paper.
-
Can you better highlight the novelty and differences from [1]?
-
Can you discuss how the method position against autoregressive 3D molecule generation models or string based generators + docking like REINVENT4 [2] or PepINVENT [3]?
-
-
Can you add the metrics I mentioned in the weaknesses?
-
Can you provide inference time comparisons against the baselines?
[1]. Billera et al. Branching flows: Discrete, continuous, and manifold flow matching with splits and deletions.
[2]. Loeffler et al. Reinvent 4: Modern AI–driven generative molecule design.
[3]. Geylan et al. PepINVENT: generative peptide design beyond natural amino acids.
11 comments
Response to Reviewer 34zN (2 of 5)
W2: The related work section is too synthetic and doesn't provide depth and breadth on how the method is positioning. You can see my questions on this point below. Can you expand the discussion of the different existing methods in the related works? Currently, most of the related works are in the appendix and very little discussion of the paper positioning is provided in the main paper. Can you better highlight the novelty and differences from [A]? Can you discuss how the method position against autoregressive 3D molecule generation models or string based generators + docking like REINVENT4 [B] or PepINVENT [C]?
Thank you for these questions. We have rewritten Section 2 to explain the central comparisons directly in the main paper. It now covers atom-level and hierarchical binder generation, variable-dimensional generation, and molecular string-based design and optimization. Appendix A expands the mechanisms and modeling trade-offs.
Differences from Branching Flows. AtomBloom inherits the splitting and deletion dynamics and conditional generator-matching objective of Branching Flows [A]. We develop this framework into a pocket-conditioned, all-atom binder-design method that supports adaptive atom and residue counts. The table below distinguishes the inherited framework from the task requirements and our additions.
| What Branching Flows provides | What binder design requires | What AtomBloom adds |
|---|---|---|
| Splitting, deletion, and element-state evolution | Generating atom types and coordinates conditioned on a target pocket | Predicts atom states, splitting, and deletion from the current atom set and target pocket for small-molecule, peptide, and antibody generation (Sec. 3.3) |
| Continuous-time event dynamics | Accurate event probabilities under finite-step sampling | Computes event probabilities over each sampling interval and analyzes the atom-count bias introduced by the original approximation (Sec. 3.4) |
| Continuous-state evolution | Handling different coordinate scales across stages of generation | Adjusts the coordinate scale seen by the predictor, with stronger compression early in generation and the original scale at the endpoint (Sec. 3.5) |
| Ancestor–descendant correspondence | Reusing earlier predictions when the atom set changes | Passes earlier predictions from ancestors to descendants and trains the model on states influenced by its own predictions (Sec. 3.6) |
| Variable-cardinality generation | Determining residue count and types from an evolving atom set | Predicts how atoms are grouped into residues and each residue’s type, then adjusts atom counts and assigns atom identities and connectivity (Sec. 3.3, Appendices E and G) |
Figure 2 and Tables 6–9 provide the sampling, rescaling, and self-conditioning analyses.
Positioning against autoregressive 3D generators. Autoregressive methods such as 3D-SBDD, Pocket2Mol, and GraphBP also support variable-size molecular generation. The distinction is how size and geometry evolve during generation. Autoregressive methods construct molecules through successive decisions conditioned on the preceding structure. AtomBloom jointly updates the evolving atom set while adding or deleting atoms, allowing existing coordinates and molecular size to adapt together to the pocket. These autoregressive baselines are included in Table 3, where AtomBloom achieves the best overall ranking among 15 methods.
Positioning against string-based generation with docking. REINVENT 4 and PepINVENT provide flexible chemical generation and property optimization through string representations. REINVENT 4 supports configurable scoring objectives, including docking, while PepINVENT extends peptide design to non-natural amino acids. In these string-generation-plus-docking workflows, the pocket structure is not explicitly provided as input to the generator, and the final 3D geometry is constructed by a separate component. AtomBloom instead generates atom types and 3D coordinates directly in the target pocket while adapting atom count. These approaches emphasize different capabilities. String-based frameworks facilitate optimization against configurable molecular objectives, whereas AtomBloom focuses on jointly learning composition, size, and geometry from structural data.
[A] Billera et al. Branching Flows: Discrete, Continuous, and Manifold Flow Matching with Splits and Deletions. NeurIPS, 2026.
[B] Loeffler et al. Reinvent 4: Modern AI-driven generative molecule design. Journal of Cheminformatics, 16, 20, 2024.
[C] Geylan et al. PepINVENT: generative peptide design beyond natural amino acids. Chemical Science, 16, 8682–8696, 2025.
Response to Reviewer 34zN (3 of 5)
W3: The method part is quite hard to read, with some inconsistencies. See my questions related to the method part below.
Thank you for the careful reading. We have revised the method section to make the notation consistent and introduce definitions and assumptions where they are first used.
I think that there is a notation mismatch between Eq. 46 and Eq. 18.
The two equations refer to the same quantities. Above Eq. 17, we define
\qquad d_i=d_{\theta,i}(X_s,c,s).$$ Eq. 18 previously used the parameterized symbols, while Eqs. 45–46 used this shorthand. We now use the shorthand consistently throughout Section 3.4 and Appendix B. > **Why isn't $\theta$ referenced in the proposition of Eq. 18?** **The dependence on $\theta$ is already included in the shorthand definitions $\lambda_i=\lambda_{\theta,i}(X_s,c,s)$ and $d_i=d_{\theta,i}(X_s,c,s)$ introduced above Eq. 17.** Proposition 1 uses these abbreviations, so $\theta$ is not written explicitly. > **I would avoid using “BCEWithLogits” in Eq. 13.** **We have replaced the implementation-specific name with the explicit binary cross-entropy**, $$\mathcal L_{\mathrm{del}}=\mathbb E\left[-d_i(\Gamma,t)\log d_{\theta,i}-\bigl(1-d_i(\Gamma,t)\bigr)\log\bigl(1-d_{\theta,i}\bigr)\right],$$ where $d_{\theta,i}=\sigma(\hat d_{t,i})$, as defined in Eq. 8. The loss itself is unchanged. > **Can you provide more details on how Γ is sampled? An illustration could help.** $\Gamma$ specifies a sampled branching history that connects an initial set of particles to the observed ligand atoms. It contains the branching forest, event times, and base-process endpoints needed to construct a training state and its supervision. It is used to generate training examples and is neither provided to the network nor required during inference. **We have added a step-by-step description and an illustration in Appendix C.1.** Given a training ligand, the construction proceeds as follows. 1. *Add auxiliary leaves.* The observed ligand atoms form the terminal leaves. Auxiliary leaves are added near existing atoms and marked for deletion, providing supervision for the deletion process. 2. *Construct the branching forest backward.* Adjacent nodes are repeatedly merged into common ancestors. Full AtomBloom uses one root. AtomBloom-R retains one root per residue, with merging restricted to each residue. A leaf’s anchor contains its coordinate and atom-type encoding. An internal node’s anchor is the average of its descendant leaf anchors, including auxiliary leaves. 3. *Sample split times.* For a forest with $m$ internal nodes, draw $m$ times from the split-time distribution and sort them. 4. *Assign split times to internal nodes.* Assign the sorted times in a sampled topological order, ensuring that each internal node splits after its parent. 5. *Sample deletion times.* Assign deletion times to auxiliary leaves according to the deletion-time schedule. A cut through this history at time $t$ determines both the active particles and their training targets. OU bridges provide the coordinates and continuous atom-type states of the active particles, forming $X_t$. Each active node $v_i(t)$ has three supervision targets, $$b(v_i(t)),\qquad \lambda_i(\Gamma,t)=|D(v_i(t))|-1,\qquad d_i(\Gamma,t)=\mathbf 1\\{v_i(t)\text{ is an auxiliary leaf}\\}.$$ These specify its endpoint anchor, remaining split count, and deletion indicator, where $D(v)$ contains the terminal and auxiliary leaves below $v$. A worked example with four terminal atoms and one auxiliary leaf is given in Appendix C.1 and illustrated in Figure 4. > **Several quantities are defined only in the appendix, including the coefficients in Eq. 19.** **We have moved the definitions of $\alpha_t,\beta_t,\gamma_t$ directly above Eq. 19 in Section 3.5.** > **W4: Several relevant metrics in the experiments are missing. This makes it really hard to understand the advantages of the method against competitors. I am listing here some relevant ones missing. For small molecules, chemical validity (RDKit chemically valid), fraction of fragmented molecules, uniqueness (fraction of distinct SMILES among valid outputs), novelty (fraction of not in training set). For peptides, Ramachandran plot, C chirality correctness.** > **Can you add the metrics I mentioned in the weaknesses?** Thank you for the suggestion. **We have added chemical validity, connectivity, uniqueness, and novelty metrics for small molecules, together with Ramachandran plots and Cα chirality analysis for peptides, to Appendix P.** These metrics provide a more complete assessment of the generated candidates.
Response to Reviewer 34zN (1 of 5)
We thank the reviewer for the valuable comments, and we answer the reviewer's questions as follows.
Thank you for raising this use case. AtomBloom supports both prescribed and adaptive binder sizes. AtomBloom-R already supports a prescribed residue count for peptides and antibodies. In this revision, we additionally provide a constrained sampler for applications requiring an exact atom count.
Prescribed residue counts for peptides and antibodies. AtomBloom-R takes the peptide or CDR length as input and generates residue identities and all-atom structures at that length. This supports applications with specified length requirements and allows direct comparison with existing baselines under the same residue-count constraint. Under this setting, AtomBloom-R achieves strong structural recovery and binding-score improvement, as shown in Tables 1 and 2.
Adaptive size for small molecules. When atom count is not specified in advance, molecular size is itself a design variable that depends on the target pocket. The baselines in Section 4.3 also produce molecules of different sizes. Some select atom count from a size prior before generating the structure, while autoregressive methods determine size through successive additions and a stopping decision. AtomBloom incorporates this choice into the atom-level generation process, allowing atom count to evolve together with atom types and coordinates. Under the shared benchmark protocol, AtomBloom achieves the best overall ranking among the 15 methods in Table 3.
Exact atom-count control added in this revision. To support applications requiring an exact atom count, we additionally provide a constrained sampler that enforces the user-specified count at inference time without retraining. It conditions the sampling of split and deletion events on the requested final count, using the model’s existing predictions without additional network evaluations. We have added the algorithm and its evaluation to Appendix T.
We evaluated the constrained sampler on all 100 CrossDocked2020 test pockets with five attempts per pocket, setting the target heavy-atom count N to that of the reference ligand. The free and constrained runs use the same checkpoint, settings, and random seeds. We also tested user-specified counts of 20, 30, and 40 heavy atoms, with four attempts on each of eight pockets for each count. Validity and single-fragment rates are calculated over all attempts.
The constrained sampler meets the requested atom count in every tested attempt, while maintaining validity and single-fragment rates comparable to free sampling. We have also expanded Section 2 to clarify the distinction between selecting size before generation and adapting it during generation.