- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper argues that Tchebycheff-based Pareto set learning (PSL) suffers from a "reference trap": when the ideal point is estimated from a local archive, global scalarized optima stay inside an archive-induced box. The proposed AdaRevTche replaces the ideal point with a worse-side (nadir) reference in a reverse Tchebycheff (max-min margin) scalarization. The reference is shifted outward by a bounded, softmax-parameterized offset that is learned jointly with the PSL model and reused for greedy HVI batch selection.
Critical strengths
- Reference-point sensitivity in Tchebycheff scalarization-based PSL is a real, under-discussed practical issue, and the paper states it precisely.
- The ablations are useful: Tche vs. RevTche vs. AdaRevTche, the range , and adapting the reference in PSL training vs. HVI selection. They come with paired confidence intervals.
Critical weaknesses
- Missing key related work; limited novelty of the scalarization. Without , Eq. (6) is a monotone transform of the hypervolume scalarization (Golovin & Zhang, 2020). That scalarization is already used for PSL in "Hypervolume Maximization: A Geometric View of Pareto Set Learning" (Zhang et al., 2023). What remains new is the bounded adaptive offset, which is a modest contribution.
- Missing simple baselines. The decisive missing baselines are (a) Tchebycheff with a utopian/ideal offset, i.e., , and (b) reverse/HV scalarization with a fixed offset, e.g., or the standard HV reference rule, where is the archive nadir. Without these, the benefit of learning the reference is not established.
- Overclaimed results. Contribution 3 says AdaRevTche "consistently achieves lower hypervolume differences … across all considered tasks," and the conclusion makes a similar claim. Table 2 and Section 4.2 contradict this: it is not best on F2, RE21, or convex polar, and RE31, RE35, and RE37 are statistically tied.
References
Daniel Golovin and Qiuyi Zhang. Random hypervolume scalarizations for provable multi-objective black box optimization. In International Conference on Machine Learning (ICML), 2020.
Xiaoyuan Zhang, Xi Lin, Bo Xue, Yifan Chen, and Qingfu Zhang. Hypervolume maximization: A geometric view of Pareto set learning. In Advances in Neural Information Processing Systems (NeurIPS), 2023.
Questions for authors
Please see weaknesses.
2 comments
Following Up on Our Responses — Reviewer 3sQv
Dear Reviewer 3sQv,
Thank you again for your helpful comments. We have provided detailed responses, clarified our contribution and its relationship to prior work, and added the requested fixed-margin comparisons.
We look forward to hearing your thoughts and would be glad to address any outstanding concerns.
Best regards, The Authors
We appreciate your time and consideration in reviewing our work. We provide our responses to your comments below.
Response. Thank you for pointing out these relevant works. We have added both references to the “Scalarization methods” paragraph in Section 2 and acknowledged the connection to prior hypervolume scalarizations.
Comparing to those two paper, our novelty lies in identifying the reference trap and developing adaptive reference geometry for PSL, instead to claim the scalarization itself as novel. We theoretically characterize how archive-estimated references can restrict Pareto-front exploration, even with exact objectives and globally solved subproblems. We then jointly learn a worse-side reference and the PSL map to alleviate this restriction and enable exploration beyond the observed front.
Response. We have added fixed-margin comparisons in Section 4.3 (Figure 6), testing δ∈{0.01,0.1,0.2} for Tchebycheff training, RevTche training, and HVI selection. AdaRevTche achieves lower final mean HV differences than all tested fixed-margin variants on RE41, RE42, RE61, and ZDT1, while fixed margins perform slightly better on Convex Polar. The benefit of a fixed margin varies across problems, and larger margins do not necessarily improve performance, supporting adaptive reference adjustment.
Table A. Final log HVD, ln(HV∗−HVˉ), where HVˉ is the mean final HV over ten runs; lower is better. Each fixed-offset variant reports its best tested δ in parentheses; bold marks the best per task.
Response. We have revised the wording to reflect the task-level results. AdaRevTche wins or ties in 90 of 93 Holm-adjusted comparisons and significantly outperforms every available baseline on RE41, RE42, and RE61, the more challenging, higher-dimensional engineering tasks (Appendix D, Table 3 and Figure 11).
We appreciate the opportunity to clarify our approach and hope the additional evidence answers your questions.