- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Hypervolume Fine-Tuning (HVFT), which fine-tunes a pretrained generator to improve the expected hypervolume of the set of independently generated candidates. The paper's central observation is that the first variation of this hypervolume objective can be expressed as an expected marginal hypervolume contribution. The authors estimate this quantity via Monte Carlo, using samples from the current generator. Then they apply Flow Density Control to construct successive scalar-reward fine-tuning subproblems. The paper also derives theoretical properties (e.g., convergence) of the distributional objective and evaluates the method on peptide and small-molecule design tasks using discrete diffusion and continuous flow-matching models.
Critical strengths
- The distributional formulation is a simple and intuitive way to value complementary candidates. The marginal-hypervolume reward bridges the full distributional objective to existing scalar-reward fine-tuning methods which is useful and tractable.
- The empirical hypervolume improvements are consistent across tested tasks and model families. HVFT also retains more diversity than several fine-tuning baselines.
Critical weaknesses
- A weakness regarding evaluation metrics is that the evaluation does not establish candidate-set quality under a fixed computational budget (e.g., fixed number of generation attempts). Hypervolume and design-space metrics are computed from pools of valid designs obtained through repeated generation (L324-327), while validity is reported separately. HVFT's peptide validity is only approximately 24-34%, and HVFT’s molecular results involve mixed trade-offs in validity and coverage. These conditional metrics are informative, but they leave uncertain whether HVFT provides better candidate sets when failed generation attempts consume the same total budget.
- Computational advantage is unclear. The motivation emphasizes amortizing the cost of inference-time search, but the end-to-end computational advantage remains unclear. Appendix B.2 reports execution times against fine-tuning counterparts, without quantifying the generation volume needed to recover the training cost relative to inference-time steering. The molecular experiments also lack a training-free search or guidance comparator; DiffusionBlend instead combines separately aligned models at sampling time.
Questions for authors
- How do the methods compare when hypervolume is evaluated under a fixed number of generation attempts, counting invalid designs as contributing no dominated volume? Would the principal rankings remain unchanged?
- Including training, objective evaluation, and generation costs, at approximately what number of valid outputs does HVFT become cheaper than inference-time steering?
- Which changes in the individual task properties account for the hypervolume improvements? Property distributions or success rates under jointly specified thresholds would help establish the practical significance of the gains.
3 comments
I thank the authors for their detailed response and new experiments. Tables 9 and 10 sufficiently address my concern for fixed generation budget, although HVFT shows lower validity and coverage than Base and PepTune on GLP-1R. Tables 11 and 12 also persuasively show that HVFT is effective at matched budget. I also appreciate Figures 4-8, where the joint plots help visualize the practicality of HVFT. I have no further questions, and my concerns are sufficiently addressed in the revision. Hence, I raise my score.
Thank you sincerely for taking the time to review the additional results and for raising your rating. We are glad that the new evidence addresses your questions, and we will incorporate these results and clarifications into the revised manuscript. Thank you again for your contribution to the review process and for helping us strengthen our work.
Response to Reviewer RaPD
Thank you for the thoughtful review and constructive suggestions. We appreciate the recognition that our marginal-hypervolume reward is “useful and tractable” and that the empirical improvements are “consistent across tested tasks and model families.” In response to the reviewer’s requests, we added evaluations accounting for invalid generation attempts, as well as matched time- and sampling-budget comparisons on both evaluated peptide tasks. HVFT retains its advantage in these evaluations. We also provide joint-property plots clarifying the gains.
To keep this response concise while making the additional evidence easy to find, we have collected the supporting tables and plots in Appendix E. We will carefully incorporate the feedback, additional results, and clarifications into the revised manuscript. If the responses address your concerns, we would sincerely appreciate an increase in your scores to reflect this updated assessment.
1. Fixed generation budget
Response.
Thank you for this helpful suggestion. Our original evaluation compares equal-sized sets of valid designs, reflecting downstream use after validity filtering. Following your suggestion, we additionally evaluated all methods under a fixed generation budget, accounting for unsuccessful attempts. Encouragingly, HVFT retains the highest 100-HV on all four evaluated tasks.
We evaluated each method using 1,000 generation attempts, without replacing invalid outputs. To compute 100-HV, we sampled subsets of 100 attempts and measured the hypervolume contributed by their valid members; invalid outputs contributed no volume.
HVFT achieves 100-HV of 11.04 versus 7.46 for the strongest baseline on GLAST, 10.34 versus 8.11 on GLP-1R, 3.39 versus 3.30 on Topology, and 4.65 versus 4.09 on Geometry. Results are averaged over two seeds. Full results, including standard errors, validity rates, and the remaining metrics, appear in Appendix E.1, Tables 9 and 10.
2. Computational cost and candidate quality
Response.
Thank you for this helpful suggestion. In some applications, the goal of fine-tuning is the adapted model itself, rather than a particular set of designs. Nonetheless, we agree that comparing the cost of producing candidate sets provides useful practical evidence. Because a break-even count based only on valid outputs does not account for quality differences, we compare candidate-set quality at equal total computational cost.
In Appendix E.2, we compare HVFT, PepTune, and pretrained-model sampling with greedy hypervolume selection (Base+Greedy) on GLAST and GLP-1R under matched wall-clock budgets (3,000–30,000 seconds) and sampling budgets (10,000–90,000 samples). The wall-clock budgets include training, objective evaluation, and generation until the final candidate set is obtained. HVFT achieves higher 100-HV than both baselines at every evaluated budget on both tasks. Results are averaged over two seeds, with full 100-HV results in Tables 11 and 12.
3. Property improvements and practical significance
Response.
Thank you for this helpful suggestion. We added joint-property visualizations in Appendix E.3, Figures 4–8, to clarify which properties and trade-offs drive the hypervolume gains. These reveal notable improvements in non-fouling for peptides and QED for small molecules. We use joint plots rather than separate marginal distributions to show whether desirable property values occur in the same candidates.
Joint-threshold success rates would also be useful given application-specific acceptance criteria. Our benchmarks do not specify established joint acceptance thresholds. Without such criteria, choosing thresholds would introduce an additional preference over trade-offs that could affect the comparison. The joint-property plots provide complementary evidence without imposing a particular acceptance criterion.