- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Candidate-Set PASO, a precommit-then-score framework for amortized multi-objective optimization. Instead of predicting a single solution, it generates multiple candidates and selects the best according to the queried preference. The paper provides theoretical analyses of mean collapse, solution coverage, and branch switching, supported by experiments on synthetic and real-world tasks.
Critical strengths
1.The paper provides a clear theoretical analysis of the limitations of single-point prediction and the benefits of candidate-set optimization. 2.The experiments cover multiple optimization scenarios, demonstrating improvements in solution quality and diversity. 3.The unified evaluation protocol effectively separates the effects of supervision, candidate cardinality, and proposal quality.
Critical weaknesses
1.The methodological novelty is somewhat limited, as candidate generation and best-of-k selection have been extensively explored in prior work. Although Figure 1 illustrates the serving procedure, the paper lacks a comprehensive framework architecture diagram, making the overall methodology and interactions between components less intuitive. 2.The experimental comparisons control scoring budgets but do not fully account for differences in training costs and candidate generation overhead. 3.Most experiments involve two objectives, leaving the scalability to higher-dimensional multi-objective problems insufficiently validated.
Questions for authors
1.Could the authors clarify the key methodological novelty compared with existing best-of-k and multimodal optimization approaches? 2.Could the authors provide an overall framework diagram illustrating candidate generation, repair, and selection? 3.How does the proposed framework perform under equal end-to-end computational budgets and with more than two objectives?