- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes SABLE for black-box optimization in high-dimensional latent spaces of pretrained generative models. It uses a Bayesian affine surrogate and decomposes candidate queries into components within and orthogonal to the span of previously evaluated designs. A finite-horizon schedule explicitly controls off-span exploration, while a pseudo-observation compression scheme limits model-refitting costs as observations accumulate. Experiments on controlled objectives and four scientific latent-space tasks evaluate sample efficiency, computational overhead, and the contributions of the exploration schedule and compression.
Critical strengths
-
A concrete methodological response to two identifiable limitations. The paper addresses underexploration by standard affine EI and the growing cost of posterior refitting. The exploration schedule and compression mechanism are explicitly specified, supported by mathematical analysis, and evaluated separately. This provides useful methodological insight beyond demonstrating that a combined system works.
-
Substantial empirical validation against relevant alternatives. The evaluation includes the closest affine-BO predecessor, several high-dimensional BO methods, and evolutionary optimizers, with 10 independent seeds. SABLE achieves the highest mean performance on three of four scientific tasks, while compression substantially reduces computational overhead. Reporting both evaluation-count and wall-clock trajectories strengthens the practical relevance of the results.
Critical weaknesses
-
The schedule is precomputed from the evaluation horizon and a reference-resolution parameter instead of adapting to observed responses. Its justification uses an affine information-gain approximation, while the intended objectives can be nonlinear, noisy, or quantized. Although sensitivity experiments are provided, the reliability of regime selection and robustness to changing local resolvability remain insufficiently established.
-
The stability analysis applies to conditional posteriors and to marginal EI with shared hyperparameter weights; it does not cover changes in those weights caused by approximate evidence evaluation. Furthermore, bounded posterior-refitting state does not imply bounded total memory, since exact historical readouts require additional storage growing with the observation count. These qualifications limit the scope of the theoretical and scalability claims.
Questions for authors
- How robust is the prescribed exploration schedule when local resolvability changes during optimization or the initial smooth/noisy regime classification is incorrect? Can the proposed regime diagnostic select an effective setting within the stated evaluation budget?
- How much does compression change the inferred hyperparameter weights and acquisition decisions in practice? Can these effects be separated from approximation error under fixed hyperparameters?
- What are the total memory and end-to-end decision-time scaling, including historical readouts and recompression, as the evaluation count grows at fixed compression budget?
6 comments
Question 1: Exploration schedule, sensitivity, and regime selection (Weakness 1)
Methodological scope and schedule choice The Value of Information (VoI) schedule is motivated by an affine approximation and is not guaranteed to be optimal for general nonlinear, noisy, or quantised objectives. We have therefore revised the manuscript to emphasise that the main methodological contribution is the decoupling of off-span exploration from fitted surrogate uncertainty and not the particular VoI schedule. The latter provides one computationally inexpensive instantiation, whose definition, derivation and properties have been moved to the appendix.
Sensitivity to We conducted additional experiments comparing , representing the coarse- and fine-resolution regimes, on all four scientific tasks, using the same experimental protocol and ten paired seeds. The local resolvability diagnostics in Appendix D.6 identify the fine-resolution setting () for Turbulence and both Calorimeter tasks, and the coarse-resolution setting () for Peptides. At , these diagnostic-selected settings outperform the corresponding opposite regimes: 0.956 vs. 0.916 on Turbulence (10/10 paired wins), 1.166 vs. 1.023 on Peptides (7/10), 0.858 vs. 0.478 on Calorimeter DS2 (10/10), and 0.658 vs. 0.356 on DS3 (10/10). Sensitivity to the reference setting is relatively modest on Turbulence and Peptides but substantial on the calorimeter tasks, indicating that the consequences of an incorrect regime choice are objective-dependent.
Reliability of regime selection Appendix D.6 introduces a local-resolvability diagnostic based on two statistics, and , requiring 40 evaluations (1.3% of the budget), and assesses its reliability across 2,000 random diagnostic sub-designs per objective. The observed values are for Turbulence, for DS2, for DS3, and for Peptides, consistent with the respective fine- and coarse-resolution regimes. While the diagnostic was validated separately rather than used online in the reported optimisation experiments, these results support the feasibility of selecting an appropriate initial regime within the evaluation budget. Together with the sensitivity experiments, these results show that the diagnostic's regime assignments agree with the better-performing reference setting on all four scientific tasks.
Robustness to changing local resolvability The current implementation uses a precomputed schedule and does not adapt to changes in local resolvability during optimisation. The decoupled formulation accommodates adaptive schedules without modifying the surrogate or in-span acquisition, but evaluating their effectiveness under changing resolvability, including their hyperparameter sensitivities, is left for future work.
Question 2: Compression and acquisition stability (Weakness 2)
We agree that the original stability analysis did not cover changes in hyperparameter weights induced by approximate marginal-likelihood evaluation. The new Appendix E.4.2 addresses this gap by establishing a total-variation bound between exact and compressed hyperparameter distributions. It also extends the marginal-EI stability analysis to separate fixed-weight compression error from errors induced by approximate evidence evaluation. Finally, we bound the resulting acquisition regret and provide a sufficient condition for preserving the selected maximiser on a common finite candidate set.
These guarantees are conditional on the realised approximation errors. The compression-budget experiments in Section 4 provide complementary empirical evidence: at , compression budgets yields closely matching optimisation performance, whereas aggressive compression () causes substantial degradation. These experiments assess the combined approximation through optimisation performance but do not directly quantify changes in hyperparameter weights or individual acquisition decisions. Such numerical assessments remain future work.
We thank the reviewer for their thoughtful and constructive assessment, and for recognising the methodological insights provided by SABLE's two complementary contributions, the substantial empirical validation against relevant alternatives, and the practical significance of its computational improvements. We revised the manuscript with additional theoretical analysis and experiments to address the reviewer's concerns.