- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a GP-based framework for query-efficient Boltzmann sampling, focusing on settings where energy evaluations are expensive. The authors consider two objectives: obtaining accurate samples during exploration and learning an accurate sampling distribution for subsequent use. For the first objective, they analyze three GP-based sampling policies and establish temperature-dependent sampling regret bounds. For the second, they derive a one-step acquisition function that minimizes the expected reverse KL divergence after an additional observation, together with several practical approximations.
The proposed methods are evaluated on synthetic distributions and a real-data inference task. The experiments demonstrate promising query efficiency compared with MCMC, neural samplers, and existing GP-based methods, particularly in low-dimensional settings.
Critical strengths
1. Principled methodology with theoretical analysis. The paper derives a one-step acquisition function directly from the expected reduction in reverse KL divergence, rather than relying on heuristic exploration criteria. It also establishes finite-budget sampling regret bounds for several GP-based policies, providing theoretical insights into how exploration depends on temperature. These results make the proposed framework more than a straightforward application of GP-based active learning.
2. Promising empirical performance: It demonstrates improved query efficiency on several tasks, both synthetic and realistic. In particular, the alanine experiment shows that OneStep can recover a minor mode missed by other GP sampling policies under the same query budget. This provides concrete evidence that the proposed method can improve distribution learning when energy evaluations are expensive.
Critical weaknesses
-
The proposed framework is closely related to existing GP-based active posterior estimation methods, particularly BAPE [1] and GPry [2]. Although both are included in the experiments, the paper does not directly compare against BAPE's expected-divergence acquisition, and some GP baselines use different prior mean functions. As a result, it is difficult to determine whether the reported improvements arise from the proposed acquisition function or other implementation choices. This weakens the evidence for the paper's incremental novelty.
-
A central motivation of the paper is to reduce sampling costs when energy evaluations are expensive. However, the experimental comparisons primarily focus on the number of energy evaluations, while the proposed acquisition functions introduce additional computation. Moreover, the reported sampling costs are not consistently adjusted for sample correlations across methods. A more comprehensive comparison using end-to-end runtime and estimation error at matched computational budgets would better substantiate the practical advantages.
[1] Kandasamy et al. (2015). Bayesian Active Learning for Posterior Estimation. IJCAI.
[2] El Gammal et al. (2023). Fast and Robust Bayesian Inference Using Gaussian Processes with GPry. Journal of Cosmology and Astroparticle Physics.
Questions for authors
-
The paper acknowledges BAPE's expected-divergence acquisition as a closely related approach. Could the authors clarify the main methodological differences between this criterion and OneStep, beyond the choice of divergence direction and the tractable approximations? Which aspects of OneStep do the authors consider the most substantial improvements over prior work?
-
The proposed method trades additional computation for fewer energy evaluations. Could the authors clarify how the computational overhead of OneStep should be considered when interpreting the reported efficiency improvements, particularly in comparison with existing GP-based approaches? Under what conditions do the authors expect this trade-off to be most beneficial?
2 comments
Thank you for the response. The additional comparison and analysis help address my main concerns and it remains unclear how query requirements and computational costs grow with dimension. However, I think the results within the low-dimensional, expensive-evaluation setting still make a worthwhile contribution. Overall, I will maintain my original rating.
We thank the reviewer for their feedback. Below we address their weaknesses and questions.
W1 and Q1: Limited evidence of improvement [...] the paper does not directly compare against BAPE's expected-divergence acquisition, and some GP baselines use different prior mean functions. [...]
For the BAPE-NED, this method is added as a baseline; please see G2 for discussion of its limitations. We also added ablations on hyperparameters such as the prior mean, and we see that our method is more robust than GPry to these choices; see Table 19. Additionally, GPry's acquisition lacks a principled derivation, despite its good performance in practice.
W2 and Q2: Insufficient evidence for the claimed computational efficiency [...] while the proposed acquisition functions introduce additional computation. [...] A more comprehensive comparison using end-to-end runtime and estimation error at matched computational budgets would better substantiate the practical advantages.
We added figures comparing acquisition runtimes with all other settings fixed for Planck-lite and H202; see Figure 2 and 10. The time allocated to computation includes fitting the GP and calculating the acquisition function. This cost is dominated by the first step of fitting the GP, so different GP-based methods do not differ significantly. However, we would like to clarify that we separate three axes of (1) cost—query, (2) computation/learning, and (3) sampling. As shown in Figure 1, in the appropriate regime, GP methods can achieve orders of magnitude lower oracle cost while matching neural samplers' computation and sampling costs.