- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes two methods to accerate samplers : PE for a particular structure of potential and E32 for image restauration. The first proposed method is show to keep the same finite-horizon state law than a reference method (FORS). Then, it is experimentally tested to sample a synthetic potential. The second method is tested for image restoration including inpainting and deblurring.
Critical strengths
- The proposed method obtains an acceleration around 20% that is very interesting in many practical applications.
Critical weaknesses
Major :
- The two methods seem unrelated except the context of accelerating samplers.
- The two methods are very specific. For PE, it solves the problem of sampling from a specific structure of sampler with restrictive constraint on curvature (e.g. S_u needs to be convex and smooth). E32 relies on a very specific methodology : two run of PC, two run of DDRM and 32 steps. These choices are not clearly motivated, explained and challenged.
Minor :
- line 38 : Please introduce the term of E32.
- line 47 : The cost of 92.63% is for which example ? In which situation ? It is a very specific number in a specific situation for a general introduction.
- line 49 : What do you mean exactly by "80.34 queries" ?
- line 85 : Please introduce the term FORS at the first occurence.
- line 130 : Which are the dimension of and ?
- line 133 : a, b lives in which interval ?
Questions for authors
- Could you extend your study for PE outside convex setting for ?
- Could you explain the different choice for the E32 method ?
- What is the conceptual link between PE and E32 ? Could you apply PE for image posterior sampling ?
3 comments
I thank the authors for their response. My second main concern on the specific caractere of the proposed method has not been answered. Moreover, they are many modifications of the text which might need a new complete careful reading. Therefore, I keep my negative score and suggest to resubmit.
Follow-up Response to Reviewer xQCR
Thank you for clarifying your concern about specificity. We distinguish PE's applicability conditions from E32's exploratory design choices.
PE is defined by certificates, not a particular potential. Theorem 1 requires a globally Lipschitz gradient, a valid reference-error bound, and positive proposal precision—not convexity of the nonlinear residual. Appendix D implements this construction for a trained 243–128–64–1 tanh potential with a nonconvex residual, demonstrating learned image-patch posterior sampling beyond log-cosh. The directly sampled conditional must still be strongly log-concave; Gaussian augmentation can supply the required precision while preserving the original posterior as its marginal.
The observed savings are not confined to one retention setting. Appendix C.4 varies the reuse allowance, proposal slack, and refresh trigger. All seven settings on the tested wide-model target reduce both queries and pipeline time: Fresh-FORS/PE ratios are 1.168–1.426 for queries and 1.068–1.318 for time. Under the theorem's conditions, these choices change computational cost, not the returned conditional law. This provides sensitivity evidence within the tested setting, rather than a claim of universal speedup.
E32 has a design rationale, but its configuration is not established as necessary or optimal. Two PC and two DDRM prefixes give equal representation to the initialization methods; 32 steps specify a shared continuation budget. Available controls compare prefix origins under a common suffix and common versus native suffixes from identical entries. The single-image 16-step control shows no improvement from the common suffix; these controls do not establish an optimal branch allocation or robustness to suffix length. The connection to PE is computational reuse, not a shared correctness guarantee: E32 does not implement or validate exact PE.E32 is therefore retained only as an exploratory study in Appendix I. We are also willing to remove the E32 study entirely to keep the paper focused on PE; doing so would leave PE's method, guarantees, and supporting experiments unchanged.
The evidence addressing specificity is concentrated in Theorem 1 (applicability conditions), Appendix D (a learned construction beyond log-cosh), and Appendix C.4 (parameter sensitivity). The central contribution is certified gradient reuse with measured computational savings, while preserving the prescribed conditional distribution and, under Corollary 2's matched conditions, the finite-horizon law of the outer sampler.
Response to Reviewer xQCR
We thank the reviewer for the careful reading and for recognizing the practical value of the acceleration. The revision focuses on PE. E32 is presented separately as an approximate diffusion study in Appendix I; the main paper's PE claims do not depend on it. References below are to the revised manuscript unless marked otherwise.
Can PE extend beyond convex potentials and support image posterior sampling?
The nonlinear potential need not be convex, but the directly sampled block conditional must be strongly log-concave. This remains a substantive restriction. For the queried potential (Su in the original formulation, now ϕu), the revised theorem requires a globally L-Lipschitz gradient, a valid reference-error bound, and H≻(L+γ)I. Nonzero reference error requires γ>0; zero error permits γ=0 (Theorem 1; Appendix B.2). Gaussian augmentation lets this precision condition apply to an augmented conditional while preserving the original posterior as the marginal target (Appendix D.2). The unaugmented posterior need not be globally log-concave.
For image posterior sampling, Appendix D provides a learned 243–128–64–1 RGB patch model, with coefficient-derived curvature and gradient-transport certificates and block updates up to 243 coordinates. Its tanh nonlinear component is bounded and nonconstant, so it is not globally convex (Eq. D.3). This construction does not certify a pretrained diffusion network. The original digit potential was also learned from data (original Section 4.1).
Section 5.3 reports a separate learned-prior CUDA workload study (Profile A; Appendix G), covering masking, deblurring, 4× super-resolution, and denoising up to 512×512, with three cohorts per task and 128 scenes per cell. With matched burn-in and retained-sample counts among the exact configurations, PE-Full achieves 2.18–2.40× speedups over Fresh FORS and 1.53–1.68× over Fixed + path in complete warm runtime. Fixed + path uses a fixed reference with path bounds, and all twelve adjusted runtime-ratio intervals against it lie below one (Table 3).
For deblurring in cohort A, Figure 3 reports mean times over 256 four-chain bundles:
Complete time also includes proposals and other device and host work. Gradient savings outweigh the added bound-computation cost, giving a 57.9% reduction in complete warm runtime.
How are PE and E32 related, and why this E32 configuration?
Both reuse earlier computation: PE retains gradients, certifies their current error, and uses an exact correction, whereas E32 retains observation-informed diffusion states for approximate continuation. Their guarantees are distinct.
E32 denotes a four-branch ensemble with a common 32-step continuation. Two PC and two DDRM prefixes give both initialization methods equal representation. Each prefix uses 224 evaluations; after noise alignment, every branch uses the same 32-step suffix, with independent randomness and no further observation updates (Figure I.1). The split allocates most computation to incorporating observations and gives each branch the same continuation budget: 4(224+32)=1,024 evaluated states per pool, or 2,048 for the two independently initialized scoring pools.
Presentation and notation.
FORS is now introduced as first-order rejection sampling in the abstract and Section 1. Table 1 compares reference policies, Figure 1 illustrates the procedure, and Appendix A provides notation and a worked example.
The 92.63% figure is the model-evaluation share of Fresh pipeline time for the 8,192-channel digit model on image 1020, whose complete pipeline takes 11.052 seconds per 128-output workload. The 80.34-query saving is 304.20−223.86 mean gradient queries per endpoint, including acquisition and evaluated correction (Section 5.1); its fractional value reflects averaging.
The block variables satisfy z,r,δ∈Rk and H,P∈Rk×k. If u contains only the remaining coordinates of a d-dimensional state, u∈Rd−k; observations and auxiliary variables may also enter the context. The digit conditional uses k=4 and two neighboring context coordinates. Under the original assumptions, a∈[0,λmin(H)) and b∈[0,∞), with 0⪯∇2Su⪯aI and 0⪯∇2V⪯bI.