- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper introduces an approach for reallocating conditioning targets used to guide diffusion and flow models during inference. More specifically, the authors focus on offline MOO, and study which conditioning targets should be replaced, and what direction the new conditioning targets should take. To this end, the authors propose Archive-Guided Reallocation (ARC), which acts as a closed loop controller for conditional diffusion and flow models, requiring no retraining, backbone evaluations or objective queries during the generation. The framework retains an archive of conditioning targets, current solution candidates, and auditor (pretrained MLP ensemble) estimates of their ranking at the end of the generation. To improve the archive, the proposed method uses a single objective that takes into account the top 100%, 75% and 50% solution set performance. During each sampling round, the requests to be retargeted are determined based on the leave-one-out hypervolume contribution. The retargeted conditions are then directed based on the predicted landings from the auditor, computed such that the new directions maximize the weighted sum of hypervolumes for the top 100%, 75% and 50% solution sets.
The authors showcase that the balanced hypervolume is submodular, giving a theoretical motivation to perform the retargeting with respect to the hypervolume greedily. To validate the proposed method, the authors evaluate ARC across 48 tasks from offline MOO bench, comparing against surrogate based and generative model based baselines. The results show consistent improvement over PCD, the closely related method that uses fixed sampling targets.
Critical strengths
Authors study a well motivated question of reallocating some of the conditioning targets based on the estimated final performance of the corresponding solutions. Since the real oracle evaluations are expensive, ensuring that each generated sample contributes to the final solution set is a desirable goal.
Critical weaknesses
- In its current form, the paper is very difficult to read. The flow from one paragraph to another is missing, making it challenging to understand how each component is related to each other, and to the overall picture. Moreover, the text introduces additional mathematical notation frequently, making the text very cluttered.
- The evaluations are questionable. The authors compare results computed from 3 seeds (baselines from offline MOO benchmark) to 5 seeds (generative methods). Some comparisons include all 48 tasks, while some include a subset of those, yet the authors give no clear indicator why such choices were done in the main text. The text also includes various p-values for different results, without mentioning which test was used to determine the p-value. At minimum, I would expect a small note that these details are described in the appendix.
Questions for authors
- ARC combines the performance of top 100%, 75% and 50% solution sets, and assigns them coefficients (0.5, 0.3, 0.2) (Eq 1). How sensitive is the proposed method to these coefficients, and how were these coefficients chosen?
- Table 3 showcases that contribution based source ordering decreases the performance slightly, which is quite unintuitive. Do you have any analysis on why this happens?
Response to Reviewer: Evaluation and Technical Clarifications
We thank the reviewer for the careful evaluation and constructive feedback. We appreciate the recognition of ARC's motivation and address the concerns below.
W1: Presentation and clarity. We acknowledge that the presentation could be clearer, particularly in connecting the methodological components and introducing notation. ARC separates two decisions: which trajectories to redirect (source selection) and where to redirect them (archive-guided destination selection). We agree that a more structured explanation would improve readability.
W2: Evaluation protocol. We appreciate these concerns. Generative methods use five seeds, while Off-MOO-Bench baselines retain their originally reported three-seed results. The main paired ARC–PCD comparisons cover 48 tasks with matched checkpoints, noise, and sampling budgets. The all-method ranking uses 44 tasks where every method completed its seed budget, while individual ablations cover 45–48 tasks depending on experimental completion. Statistical significance is assessed using two-sided paired Wilcoxon signed-rank tests across tasks, with further details in Appendix C.2. We agree that these distinctions should be clearer in the main text.
Q1: Balanced utility coefficients. The coefficients (0.5,0.3,0.2) were fixed across all tasks to prioritize full-set HV while accounting for the quality of the top 75% and 50% of solutions. Table 3 shows modest improvements from balanced utility (+0.05% at the 100th percentile and +0.19% at the 50th percentile). We acknowledge that a systematic coefficient-sensitivity analysis would strengthen this evaluation.
Q2: Contribution-based source ordering. Table 3 shows that contribution-based ordering slightly underperforms uniform source selection (−0.25%). A possible explanation is that intermediate HV contributions do not reliably predict which trajectories benefit most from redirection. ARC therefore uses contribution scores to protect promising trajectories while uniformly sampling the remaining eligible sources. We acknowledge that this explanation requires further empirical validation.
We sincerely appreciate the reviewer's suggestions and hope these clarifications address the main concerns regarding ARC's methodology and evaluation.