- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies the problem of generating samples from an exponentially tilted distribution when only independent samples from the original distribution are available. The authors construct a self-normalized importance-weighted empirical distribution and use its Gaussian-smoothed score in a DDPM reverse sampling procedure.
Critical strengths
The paper addresses a practically relevant problem of sampling from exponentially tilted distributions using only samples from the original distribution, without requiring access to its density.
Critical weaknesses
- The proposed algorithm performs exponential tilting entirely through importance reweighting of the original samples, while DDPM is subsequently used merely to generate samples approximating the resulting weighted empirical distribution. Since this empirical distribution already admits exact sampling through importance resampling, the paper does not establish what additional statistical benefit the diffusion procedure provides, nor does it introduce a mechanism to address the fundamental weight degeneracy and sample coverage issues of exponential tilting. Consequently, the necessity and distinctive algorithmic contribution of the proposed DDPM framework remain insufficiently justified.
- The proposed framework largely combines established techniques in importance-weighted empirical approximation [1], DDPM convergence theory [2], low-dimensional score approximation [3], and Wasserstein analysis [4]. Its main novelty therefore relies on the claimed theoretical guarantees, yet several central results contain substantial mathematical gaps that undermine their validity (see questions). Moreover, the paper does not establish a clear statistical or computational advantage of its DDPM procedure over direct importance resampling, leaving its incremental contribution insufficiently justified.
[1] Iyer S R, Mandal H, Gupta D, et al. Fundamental limits for weighted empirical approximations of exponentially tilted distributions[C]// Proceedings of the 29th International Conference on Artificial Intelligence and Statistics. PMLR, 2026, 300: 5239–5247.
[2] Li G, Yan Y. O(d/T) convergence theory for diffusion probabilistic models under minimal assumptions[J]. Journal of Machine Learning Research, 2025, 26(292): 1–55.
[3] Mu X, Shang Z, Zhou Z, et al. Score approximation for diffusion models on arbitrary low-dimensional structures[J]. arXiv preprint arXiv:2606.19894, 2026.
[4] Weed J, Bach F. Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance[J]. Bernoulli, 2019, 25(4A): 2620–2648.
Questions for authors
- Since the importance-weighted empirical distribution already admits exact sampling through direct resampling, what motivates introducing an additional DDPM procedure to approximate this distribution? What fundamental sampling difficulty does DDPM address that cannot be handled by direct importance resampling?
- Can the authors demonstrate that DDPM-generated samples approximate the true tilted distribution more accurately than samples drawn directly from ? In particular, does the diffusion procedure provide any improvement in Wasserstein distance or other meaningful distributional metrics under a matched computational budget?
- When the tilt strength increases, the importance weights may concentrate on very few observations, substantially reducing the effective sample size. Since the proposed DDPM score is constructed entirely from these weighted samples, how does the algorithm mitigate this degeneracy or recover regions of the tilted distribution that are poorly represented in the original dataset?
- Theorem 2 claims a distribution-independent constant , but the proof appears to omit the covering constant from Definition 2, which can be arbitrarily large even for fixed intrinsic dimension. How can the stated uniform bound hold for distributions supported on arbitrarily many well-separated low-dimensional components?
- The derivative formula in Lemma 6 appears to have an incorrect sign, as the simple case and yields the opposite derivative. Can the authors provide a corrected derivation and rigorously justify the conditional-expectation and covariance bounds used in Lemma 8 to establish Proposition 2?
- Theorem 5 claims a sample complexity bound without explicit dependence on , although sufficiently strong tilting can concentrate the target distribution on regions with arbitrarily small probability under the original distribution. How can such a uniform learning guarantee hold when these regions are unlikely to appear in the training samples, particularly since the proof uses the unknown probabilities ?