- Rating
- 1(−1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes an efficient Bayesian posterior sampling framework using an implicit generative prior. Specifically, the authors use the existing improved MeanFlow method to learn a one-step or few-step transport map from a Gaussian source space to the data space, then perform posterior sampling in the source space using parallel tempering, preconditioned Crank-Nicolson, and hybrid HMC. Unlike existing flow matching approaches, the framework provides theoretical guarantees for the fixed few-step transport map used in practice, without discretization error from numerical ODE integration. Experiments on a synthetic Bayesian inference problem demonstrate higher sampling efficiency and posterior approximation accuracy than existing methods. The proposed method also achieves high rewards at low computational cost in CLIP-guided image generation.
Critical strengths
S1. This paper provides a connection between the population training objective of iMF, fixed few-step transport approximation error, and posterior stability. This addresses a limitation of prior results that consider exactly integrated flow maps.
S2. The proposed framework substantially reduces the cost of source-space MCMC compared with multi-step flow matching approaches, while maintaining competitive posterior approximation accuracy on synthetic experiments.
S3. The proposed method accommodates both conventional Bayesian likelihoods and reward-based test-time guidance without retraining the prior.
Critical weaknesses
W1. The synthetic experiments use a block-separable 32-dimensional posterior, while the high-dimensional ImageNet experiments focus only on reward-guided generation. This leaves the effectiveness of the proposed method on high-dimensional, strongly coupled Bayesian inverse problems largely untested. Given that the proposed framework is motivated by Bayesian inference with implicit generative priors, evaluating it on more realistic inverse problems would substantially strengthen the empirical validation. For instance, InverseBench (Zheng et al., ICLR 2025) provides challenging scientific inverse problems, including medical imaging and tomography, while A Statistical Benchmark for Diffusion Posterior Sampling Algorithms (Zach et al., ICLR 2026) provides reference posterior samples for quantitative evaluation of posterior accuracy and coverage. Experiments on such benchmarks would help establish whether the proposed method generalizes beyond simplified synthetic settings.
W2. The main components, including improved MeanFlow (iMF), source parallel tempering, preconditioned Crank-Nicolson, and split HMC, are already established methods. The algorithmic contribution consists primarily of their combination, which somewhat limits the novelty. The authors should more clearly articulate the novel aspects of the proposed framework.
W3. The Wasserstein bounds depend on potentially large, dimension- and model-dependent regularity constants, and the asymptotic dependence is weak. The applicability of the assumptions, particularly the positive lower bound on likelihood weights required for geometric convergence, is insufficiently demonstrated for practical Bayesian inverse problems. These assumptions require clearer justification.
W4. This paper does not systematically evaluate or ablate the influence of transport step count, auxiliary loss weighting, tempering configurations, or hybrid HMC hyperparameters on accuracy and computational efficiency. Such analyses are needed to clarify the novelty of the proposed framework and better substantiate its claims.
Questions for authors
Please see the weakness section.
3 comments
I thank the authors for the rebuttal.
W1. The 64-dimensional deconvolution experiment partially addresses my concern that the original synthetic posterior was block-separable. I appreciate the inclusion of a coupled posterior and reference samples from Gibbs sampling. However, the evaluation still leaves open whether the method can accurately characterize the posterior and its uncertainty in realistic, high-dimensional inverse problems, such as medical imaging or tomography. This remains my main empirical concern.
W2. I appreciate the clarification that the main contribution is the theoretical connection between the iMF training objective, the implemented few-step transport, posterior stability, and sampling error.
W3. The authors clarify that the positive lower bound on likelihood weights is required for the sampler's geometric convergence result, while the main posterior approximation result does not rely on it. I appreciate this distinction. However, the response addresses only one part of my concern. I remain uncertain about how informative the Wasserstein bounds are in practice, given the potentially large dimension- and model-dependent constants and the weak asymptotic dependence on .
W4. The new ablations address all aspects I raised. I consider W4 resolved.
Overall, I appreciate the work that went into the rebuttal. Nevertheless, I was slightly disappointed that the authors did not directly address my central concerns. In particular, the responses to W1 and W3 felt evasive. The new experiment in W1 response leaves the method's performance on realistic, high-dimensional inverse problems untested, and the clarification about the convergence assumption leaves unanswered. Hence, I decided to lower my score to 1.
Thank you for your further engagement.
About the second part of W1, we cannot add large-scale medical imaging or tomography experiments within this rebuttal, due to time constraint. About the second part of W3, yes, the conservative constants and the rate are not ideal. It is just a theoretical guarantee, which can cover the worst case. Further justifying the usefulness of this bound in practice is left for furture work.
We thank the Reviewer for the thoughtful and constructive comments.
W1)
Thank you for the suggestion. We have added a 64-dimensional deconvolution problem with a coupled Laplace random-walk prior in Section 4.2, inspired by Zach et al. (2026). This is now a truly coupled posterior sampling problem whose posterior reference samples can be obtained via the Gibbs sampler thanks to the problem's structure. Evaluated across four observations, our hybrid sampler produces bulk effective samples 4.67 times faster than the pure pCN method using the same iMF transport. It also cuts sampling time by roughly two-thirds compared to the FM10 baseline while keeping distributional errors competitive.
References:
Martin Zach, Youssef Haouchat, and Michael Unser. A statistical benchmark for diffusion-posterior- sampling algorithms. In International Conference on Learning Representations, volume 2026, pp. 108984–109021, 2026.
W2)
We agree that the individual components are established. We already mentioned all of them in the introduction. Our contribution goes beyond combining them: we identify and analyze a formulation that connects the population training objective to the implemented few-step transport, posterior stability, and sampling error. The choice of transport objective is essential to this connection. For example, simply replacing iMF with few-step MF would not preserve our argument. Thus, few-step generation alone is insufficient for this guarantee. Please see also our reply to Reviewer RnYN (Weakness 2). We further extend the sampler convergence analysis to the hybrid SPT scheme and combine it with transport and posterior stability bounds to obtain an end-to-end error guarantee.
W3)
The assumption on the positive lower bound on likelihood weights (Assumption A.1) is used to establish geometric convergence of the source sampler; it is not required for our main results linking the population training objective to posterior approximation error. We note that the positive lower bound holds for bounded-reward guidance, Gaussian observation models with bounded forward-map range, and contamination models with a positive observation component independent of the unknown (see Appendix A.7). On the other hand, it fails for Gaussian likelihoods when the forward map is unbounded on the transport’s range. Our convergence theorem therefore does not cover that case.
W4)
We have added systematic ablations on the iMF+SPT+hybrid in Appendix B.4, Figures 9-14, covering all four requested aspects on the bana, sine and coupled Laplace problems. We vary one factor at a time and report sliced Wasserstein error and mean coordinate bulk ESS per second.
Transport steps: We test K∈{1,2,4,6,12}. More steps improve accuracy on sine and Laplace but reduce ESS per second. On banana, accuracy improves from one to two steps, with no consistent further gains.
Auxiliary loss weighting: We test λ∈{0,0.1,1,10}. The lowest mean error occurs at λ=1 on Laplace and λ=0.1 on banana. Removing auxiliary supervision does not reduce accuracy on sine.
Tempering: We test T∈{1,8,16,24,48} temperatures and grid powers p∈{1,2,3}. Banana benefits in mean accuracy from moving from one to eight temperatures, but larger ladders offer no consistent gains. Sine and Laplace show little accuracy change. Grid power has little effect across all three problems.
Hybrid HMC: We test integration lengths L∈{2,6,12} and target acceptance rates {0.6,0.75,0.9}. Increasing L from 6 to 12 substantially improves ESS per second with similar accuracy across all three problems. Target acceptance affects efficiency more than accuracy.