- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes an algorithm for sequential black-box optimization (BBO) using a single generative model to propose candidates in settings where the evaluation budget is very low. In contrast to other methods in the literature, the proposed algorithm, SPARROW, requires no retraining/fine-tuning of the generative model, nor any guidance component or objective model. Candidates are simply generated by a combination of rank-based resampling, empirical improvement directions, and generative refinements based on the pretrained generative model. Experiments on a range of high-dimensional optimization problems are presented comparing the proposed method against BBO baselines.
Critical strengths
-
The proposed method has basically no "moving parts". Given a pre-trained generative model, there is no need to retrain it nor any other model during the optimization process in SPARROW. This can make the method computationally very lightweight in terms of runtime per iteration, saving a significant amount computational resources.
-
SPARROW presents significant performance improvements with respect to all baselines it was compared against across the experiments in the paper.
-
Theoretical results in the appendix support some key arguments in the paper.
-
The paper is relatively easy to read, though some parts need minor revisions.
Critical weaknesses
Related work. There have been a few methods combining BO with generative models, which make some sort of a "bridge" between classical BBO and generative BBO. I'd suggest having a look for latent-space BO methods (e.g., Gruver et al., 2023) and non-latent-space BO with generative models (Oliveira et al., 2026). References are below. Although these methods still require refitting an objective surrogate and/or a generative model, these and related methods may lead to more suitable alternatives than the more classic BO baselines which SPARROW is compared against.
Background. I believe the background in Sec. 4.1 needs some revision in its definitions of the corruption and refinement operators. The operators are defined as mappings between state spaces, but their outputs are later used as probability distributions over the state space. The two are incompatible and need a better, formal definition. Otherwise, what is currently there is not making much sense. Also note that, a deterministic transition operator would be compatible with a flow-based model, like flow matching, where noise appears only at the beginning before the state transitions take place. Diffusion, however, involves stochastic state transitions, since Gaussian noise is inject at each state transition (in discrete-time approximations).
Minor. BBO is mentioned without prior definition in the abstract. The smallest amendment would be to place it in parentheses right next to the first mention of "black-box optimization" in the first sentence.
References
- Gruver, N., Stanton, S., Frey, N., Rudner, T. G. J., Hotzel, I., Lafrance-Vanasse, J., Rajpal, A., Cho, K., & Wilson, A. G. (2023). Protein Design with Guided Discrete Diffusion. Advances in Neural Information Processing Systems (NeurIPS), 36.
- Oliveira, R., Steinberg, D. M., & Bonilla, E. V. (2026). Generative Bayesian Optimization: Generative Models as Acquisition Functions. The Fourteenth International Conference on Learning Representations (ICLR).
Questions for authors
-
Although I could understand the first two design principles, "make every evaluation count" is still unclear to me. There's a mention of "SMC" (Sequential Monte Carlo?), but it's unclear how that relates to generative optimization problems. Is there any other concrete reference that can be cited to aid the discussion in that section?
-
The algorithm is interesting, but it seems to have been put together a bit ad-hoc. Why this way of selecting directions (sampling two pairs of data points uniformly at random and ) in a usually non-linear problem was applied?
-
How would the method deal with observation noise? It's briefly mentioned in Sec. 4.1 that rank-based optimization is more robust to evaluation noise, but that's not very clear, and observation noise is usually a significant detail to consider in practical BBO problems, especially when involving real physical processes. Some of the assumptions in the method and the analysis in the appendix seem to consider that observation noise is non-existent or negligible.
3 comments
Main concerns addressed
I thank the authors for their detailed responses and the additional experiments. After reading the revised manuscript, I consider my main concerns addressed. One remaining minor suggestion is to provide more complete technical details for GPGuide, particularly how the final-candidate estimate and its guidance gradient are computed, since this is a custom baseline.
I am maintaining my current score for now and remain open to revisiting it in light of upcoming discussions with the other reviewers and the AC.
Thank you for the positive feedback. We will expand Appendix H.4 to document the step-by-step GPGuide algorithm more clearly, including the final-candidate estimation and guidance-gradient computation, to facilitate reproducibility.
We thank the reviewer for the constructive feedback and detailed suggestions.
Related Works. We agree that generative and latent-space BO deserve more attention. We added a discussion of Gruver et al. (2023), Oliveira et al. (2026), and related approaches to our related work section (Section 2.2). Importantly, our airfoil experiments already compare against GP and TuRBO operating in the same learned 256D latent space. More advanced methods also adapt their surrogate or generator using objective feedback, which we explicitly decided to avoid in Section 5.3 because using a mischaracterized model for acquisition can compromise the entire subsequent exploration. We further clarify this in Section 5.3 of the revised paper.
Corruption-Refinement Formalism. We agree that Section 4.1 conflates deterministic mappings with stochastic operators. We clarified the section in the revised paper.
Making every evaluation count. Methods such as RERD (Uehara et al., 2025), guide the generation through Sequential Monte Carlo sampling along the generation trajectory. This consumes multiple objective evaluations that are discarded at the end of the generation cycle. In contrast, SPARROW uses one single evaluation per proposal and retains every evaluation. This allows us to use the most available information at any stage of optimization. We clarify this in Section 3 of the revised paper and cite RERD explicitly.
Directional Mutation The mutation is a differential-evolution-inspired (Lampinen & Storn, 2004) stochastic bias. Differences between randomly sampled archive candidates provide diverse directions, oriented toward the better-ranked candidate. We do not assume these are ascent directions for nonlinear objectives, nor that their influence necessarily survives refinement. As shown by the lambda=0 ablation in Section 5.7, mutation offers a measured benefit but is not essential to performance.
Observation Noise Rank-based selection is a standard, well established choice in evolutionary BBO and its benefits under noisy evaluations have been widely recognized (e.g. CMA-ES and IGO). Intuitively, evaluation noise does not affect the ordering unless it is important enough for evaluations to cross. This makes the rank-based signal completely unaffected by small enough noise. We conducted an additional ablation on the 64D tube under Gaussian (e.g. sensor noise) and heavy-tailed (e.g. sensor interferences) Cauchy observation noise, comparing SPARROW against a tuned value-based variant. Within the strict (B=100) budget, we use 90 search evaluations and reserve 10 to reevaluate the five top-ranked candidates twice, returning the candidate with the highest median observation. Consistent with this motivation, SPARROW retains its performance advantage under mild noise and across a broad range of heavy-tailed noise levels. We include these results in Section 5.7 and Appendix G of the revised paper. We leave explicit noise-aware optimization to future work.
Minor correction. We newly define BBO at its first occurrence in the abstract.