- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes two randomized higher-order Langevin algorithms—a Hessian-based Taylor scheme and a Hessian-free Runge–Kutta variant—that improve dimension-dependent mixing guarantees beyond log-concavity without requiring Lipschitz third derivatives.
Critical strengths
The paper proposes a randomized correction that potentially improves the dimension dependence of higher-order Langevin sampling while removing the Lipschitz assumption on the third derivative. Its gradient-only variant avoids explicit Hessian calculations, making the approach potentially useful in practice.
Critical weaknesses
The bound in line 782 appears to omit a sqrt{d} factor because J_i has root-mean-square magnitude O(sqrt{d h^3}). This makes Gronwall step dimension dependent. This also affects gradient-only analysis. Although the error seems fixable, this requires a major rewriting which becomes inappropriate for the intended scope of author rebuttal. Therefore I suggest the authors to fix the problem and resubmit so that it can be reevaluated carefully again in a future venue.
In addition, the experiments provide limited evidence of a practical advantage: the dimension-scaling test covers only d=8–16, and the paper does not establish a clear advantage at matched computational cost over alternatives.
Questions for authors
N.A.
Response to Reviewer 8Zcy
We are grateful to the reviewer for the constructive comments. We appreciate these valuable suggestions, which will substantially improve the presentation of the paper.
About Critical Weaknesses
Response: We sincerely thank the reviewer for pointing out this issue and apologize for it. As identified by the reviewer, our previous proof, relied on a direct iterative argument, indeed suffering from the dimension-dependent accumulation. To address this issue, we have substantially revised our proof strategy. Specifically, instead of directly iterating the one-step error estimates, we now adopt a local-to-global approach, as established in [Yang and Wang, ICML, 2025] to establish the finite-time error bounds. More precisely, one can easily bound the one-step local truncation errors as follows: ∣E[X(t,x,t+h)−Y(t,x,t+h)]∣=O(dh5/2),∥∣X(t,x,t+h)−Y(t,x,t+h)∥∣L2(Ω;Rd)=O(dh2), where X(t,x,t+h) and Y(t,x,t+h) denote one-step true and numerical solution starting from initial data x at t, respectively. By applying Theorem 3.3 of [Yang and Wang, ICML, 2025] with p1=5/2 and p2=2, we obtain a finite-time mean-square error bound (E[∥X(tn)−Yn∥2])1/2≤C(T)(d2+E[∥X0∥4])1/2h3/2,∀0≤n≤N, where T=Nh. Following the idea of [Yang and Wang, ICML, 2025], we exploit the exponential ergodicity of the Langevin diffusion and the uniform-in-time moment bounds of both the exact and numerical solutions, to transfer finite-time error bound to uniform-in-time one in W2-distance. In this way we obtain the desired uniform-in-time non-asymptotic error bound.
This revised approach avoids the problematic dimension dependence in the Grönwall argument and also addresses the corresponding issue in the gradient-only analysis. The detailed arguments can be found in Appendix B of the revised manuscript.
[Yang and Wang, ICML, 2025] B. Yang and X. Wang. Non-asymptotic error bounds in W2-distance with sqrt (d) dimension dependence and first order convergence for Langevin Monte Carlo beyond log-concavity, ICML, 2025.
Response: Thank you for this comment. We have supplemented the original tests with an experiment at d∈(142,144,146,148,150), showing approximately linear empirical dimension dependence over this range. Our convergence experiments also show that RT-LMC and RRK-LMC achieve smaller errors and higher convergence rates than the classical LMC and RLMC at the same step sizes.