- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper presents MolDeriveX, a multi-objective molecular optimization framework based on adaptive structural inheritance. It identifies property-specific structural anchors by combining isolated-fragment scores with changes in parent-level property scores after fragment deletion. These anchors guide Pareto-based differentiable graph editing through soft retention penalties, while lineage-aware exploration and descendant promotion allow structural references and anchors to evolve during search.
Critical strengths
(1) The paper addresses a relevant challenge of balancing structural preservation and exploration in multi-objective molecular optimization. (2) The framework integrates context-informed anchor selection, soft retention, and lineage updates while keeping protected regions editable. (3) Evaluation spans six tasks and eight baselines, with activity-task improvements supported by hypervolume, elite-candidate quality, and joint-success metrics.
Critical weaknesses
(1) The paper does not sufficiently substantiate its central contribution of adaptive structural inheritance. Why converting heterogeneous property-specific evidence into a shared modification cost is sufficient to provide the context-adaptive guidance motivating the method?
(2) The paper fails to sufficiently justify the optimization properties of its central update rule. EPO weights are computed from the property losses and their gradients, whereas the actual update additionally includes the structural penalty gradient. Consequently, the original EPO coordination properties do not directly carry over. The retention gradient can cancel the property-optimization gradient, producing a stationary point that is not Pareto-stationary for the original property losses. The paper neither analyzes when this cancellation occurs nor provides conditions on the penalty strength, gradient relationships, or step size that characterize how retention changes the optimization behavior.
(3) The notation, definitions of key variables, and update rules are incompletely specified, leaving the mathematical description insufficiently connected. Equation (3) defines A as edge logits and P as the corresponding edge probabilities, whereas Appendix A directly uses A, described as an adjacency matrix, in graph convolution without clarifying the mapping between the two. Equation (8) introduces node weights without adequately explaining how they are constructed or how they change during continuous editing. Equation (11) does not define how population-level feedback updates the base preference or fully report the parameter settings used. Equation (12) does not specify its computation and update rules.
Questions for authors
- What capability distinguishes adaptive structural inheritance from existing graph editing with structural guidance?
- In Equation (5), retaining only the largest connected component can discard additional regions outside the selected fragment. How is their influence distinguished from the selected fragment’s contribution?
- How is ρ selected in Equation (7)?
- Does graph convolution use P = sigmoid(A) or the raw logits A? How are the node weights in Equation (8) constructed and updated during continuous editing?
- Why do MolSearch’s reported final HV values on all four activity tasks match the initial-population values in Table 11 (0.6948, 0.5688, 0.5614, and 0.3597)?
- Why does QED–logP HV differ between Tables 10–11 and Table 20 (0.9470 versus 0.9456), and diversity between Tables 18 and 20 (0.8459 versus 0.8550)?
12 comments
Q2: In Equation (5), retaining only the largest connected component can discard additional regions outside the selected fragment. How is their influence distinguished from the selected fragment’s contribution?
Response:
When fragment deletion leaves multiple connected components, Eq. (5) captures both the effect of deleting the selected fragment and the effect of retaining only the largest remaining component. We examined 400 selected initial anchors from 100 starting molecules in one four-objective run. Retaining only the largest component discarded additional atoms in 313 of 400 cases (78.25%).
Table 14. Frequency and extent of additional atom loss after fragment deletion.
| Anchor objective | Deletions leaving multiple components | Mean share of remaining atoms discarded |
|---|---|---|
| QED | 61/100 | 19.80% |
| SA | 62/100 | 14.00% |
| GSK3β | 94/100 | 39.10% |
| JNK3 | 96/100 | 38.80% |
Means include all 100 anchors per objective. Additional atom loss was counted as zero when the remainder stayed connected.
To quantify the effect on QED, we used RDKit to compare the score of the full disconnected remainder with that of its largest component. Of the 61 QED-anchor deletions that left multiple components, 30 had a full remainder that RDKit could sanitize and an available largest-component score. Across these 30 cases, the median absolute difference between the two QED scores was 0.143, and retaining only the largest component reversed the sign of the deletion effect in 4 of 30 cases. For example, one parent had a QED of 0.732. After deletion, QED rose to 0.790 when all remaining components were retained and fell to 0.640 when only the largest component was retained.
We have clarify that Eq. (5) uses this combined effect as a heuristic for ranking anchors and report the QED sensitivity check in the appendix.
Q3 & Weakness 2: How is ρ selected in Equation (7)?
Response:
Structural penalty settings. We manually set the base value of ρ for each task. A larger ρ increases the cost of edits to matched anchor regions. When enabled, the search-wide stagnation rule lowers ρ if overall search progress stalls. Table 15 lists the settings used in the main experiments.
Table 15. Base structural penalty coefficients and their values under search-wide stagnation.
| Task | Base ρ | ρ when overall search progress stalls |
|---|---|---|
| QED–SA | 2 | 0.5 |
| GSK3β–JNK3 | 1.5 | 0.5 |
| QED–SA–GSK3β | 4 | 0.5 |
| QED–SA–JNK3 | 3 | 3 |
| QED–SA–GSK3β–JNK3 | 0.36 | 0.12 |
When an individual lineage stalls and lineage-level relaxation is enabled, the default rule caps that lineage’s current ρ at 1.0. The four-objective configuration uses 0.12 for the stalled lineage.
EPO computes the property weights from the property losses and their gradients. The editor then adds the weighted structural penalty gradient. We agree that the original EPO guarantee applies to the EPO update alone.
On the editable coordinates, the combined gradient can vanish when
even if . A sufficient condition to rule out exact cancellation at a given step is
This condition concerns the combined gradient at a single editing step. Table 16 reports the paired changes in final hypervolume (HV) across three search seeds after enabling the structural penalty.
Paired penalty ablation. In a follow-up experiment, we held the anchors and decoding rules fixed and compared ρ = 0 with a shared schedule that started at 0.36 and dropped to 0.12 when overall search progress stalled. Under this schedule, the penalty had little effect on final hypervolume (HV) for QED–SA, increased it in all three QED–SA–GSK3β runs, and decreased it in all three four-objective runs.
Table 16. Paired change in final HV, calculated as the HV under the shared penalty schedule minus the HV at ρ = 0 for each seed.
| Task | Mean change ± sample SD | Direction across three seeds |
|---|---|---|
| QED–SA | +0.000002 ± 0.000006 | 1 increase, 1 decrease, 1 tie |
| QED–SA–GSK3β | +0.0081 ± 0.0078 | 3 increases |
| QED–SA–GSK3β–JNK3 | −0.0214 ± 0.0055 | 3 decreases |
We have reported the task-specific settings, stagnation rules, and paired results in the appendix.
Q4 & Weakness 3: Does graph convolution use P = sigmoid(A) or the raw logits A? How are the node weights in Equation (8) constructed and updated during continuous editing?
Response:
Adjacency used during continuous editing. Every graph convolution uses as its adjacency input, where contains the raw edge logits and the sigmoid is applied elementwise. The convolution computes before applying the hidden-layer activation.
Pooling weights. At each editing step, we recompute the pooling weights in Eq. (8) from the current . We first compute the clipped row sum
We then assign node weights according to Table 17. For each original leaf , denotes its original neighbor and denotes its candidate extension node.
Table 17. Node weights used for pooling during continuous editing.
| Editing path | Internal node | Original leaf | Extension node |
|---|---|---|---|
| Fewer than three rings | 1 | 1 | |
| Three or more rings | 1 |
Edge updates and decoding. Only leaf–extension edge logits retain their updates between editing steps. The logits for edges between original leaves and their original neighbors remain at their initial value of zero. In the three-or-more-ring path, each original leaf therefore has a constant pooling weight of 0.5, while its extension node’s weight can change with . The decoder samples leaf deletions after continuous editing is complete.
When population-level feedback is enabled, Eq. (11) computes a deficit for each objective from its score quantile in the evaluated pool. It also measures how often each objective has the lowest score. These signals adjust the fixed reference preference. The algorithm clips and normalizes the resulting weights, then blends them with the previous generation’s preference. The parent-level rule further adjusts this preference using the current parent’s own deficits.
We have corrected the continuous-editing convolution in the appendix from to and explicitly describe the pooling weights and edge mask.
Q5: Why do MolSearch’s reported final HV values on all four activity tasks match the initial-population values in Table 11 (0.6948, 0.5688, 0.5614, and 0.3597)?
Response:
We verified that the archived MolSearch outputs for each of the four activity tasks contained exactly the 100 starting molecules. The hypervolume (HV) of each returned set therefore equaled that of the corresponding starting population.
We reran MolSearch with three search seeds per task using the same starting populations. Each run evaluated 5,000 new molecules, and the 100 starting molecules were scored separately. Stage 1 scores rule-generated proposals before filtering them, so discarded proposals also count toward the evaluation budget. Every rerun exhausted the budget in Stage 1, before Stage 2 began. On the four activity tasks, no newly evaluated molecule had entered the retained set at the cutoff, so the rerun exports again contained only the starting molecules. The archived exports establish what the original runs returned. The evaluation counts and stopping stage come from the reruns.
Table 11. MolSearch HV across three search seeds. Initial HV is computed over the 100 starting molecules. Each seed column reports HV over the 5,000 newly evaluated molecules, excluding the starting molecules.
| Task | Initial HV | Seed 1 HV | Seed 2 HV | Seed 3 HV |
|---|---|---|---|---|
| GSK3β–JNK3 | 0.6948 | 0.7149 | 0.7149 | 0.7149 |
| QED–SA–GSK3β | 0.56881 | 0.44788 | 0.44788 | 0.44788 |
| QED–SA–JNK3 | 0.56138 | 0.45703 | 0.45703 | 0.45703 |
| QED–SA–GSK3β–JNK3 | 0.3597 | 0.13784 | 0.13784 | 0.13784 |
| QED–SA | 0.59251 | 0.94487 | 0.94487 | 0.94487 |
All three seeds evaluated identical sets of molecules on both three-objective tasks and on the four-objective task. On GSK3β–JNK3 and QED–SA, the sets varied across seeds but yielded identical nondominated objective vectors and therefore identical HVs.
We have presented the MolSearch results, evaluation protocol, and diagnostics in the appendix. The main text will focus on the other comparisons.
Thank you for your careful review and constructive feedback. Your comments helped us clarify how MolDeriveX works and strengthen the experimental evaluation. We address each comment below.
Q1 & Weakness 1: What capability distinguishes adaptive structural inheritance from existing graph editing with structural guidance?
Response: MolDeriveX carries property-specific anchors across generations and can update which regions receive protection.Before each edit, MolDeriveX matches inherited anchors to the current parent and applies a soft penalty to changes in the matched regions. When a qualifying descendant is promoted to the lineage root, anchors extracted from that molecule can guide subsequent edits. This allows the search to protect a newly introduced motif associated with higher predicted activity while optimizing other properties.
Single-parent derivatization.F-CReM uses local chemical context to select compatible fragment replacements around a specified parent. We used this configuration for antibiotic derivatization. Applying it to the general benchmark would require an additional policy for selecting and advancing a population across multiple objectives. For each antibiotic parent, we evaluated the trade-off between predicted activity against A. baumannii and similarity to the starting molecule. We also measured diversity within the modified regions after excluding the parent core.
Table 12. Hypervolume (HV) and diversity within modified regions in single-parent derivatization.
Population-based multi-objective optimization. InversionGNN uses property gradients to guide edits to the current molecule. Fixed L1 uses the same soft structural penalty and decoding protection as the full MolDeriveX configuration and retains the initial anchor set throughout the run. On the four-objective task, mean final HV was 0.7064 for MolDeriveX and 0.6514 for Fixed L1, a gain of 0.0550.
Table 13. Final HV across three search seeds, reported as mean ± sample standard deviation.
Property-specific evidence determines which regions are protected. We select anchors separately for each objective, match them to the current parent, and combine the matches into a single mask over editable graph coordinates. The shared modification cost applies to the masked coordinates, while EPO continues to balance the individual property losses. Rematching anchors to each parent and reselecting them after lineage-root promotion allow the protected region to change as the search progresses.
Under the common budget, refreshing property-selected anchors increased the mean match rate for current-root anchors on both tasks relative to the fixed policy. Its effect on final hypervolume (HV) varied by task. The refreshed policy achieved the highest mean final HV on QED–SA–GSK3β, and the fixed policy achieved the highest mean final HV on QED–SA–GSK3β–JNK3.
Table 10. Final HV and full anchor-match rates under a budget of 5,000 online full-evaluation equivalents (FEO) per run. Values are mean ± sample standard deviation across three paired search seeds.