- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper refines an existing bound on the Wasserstein error of LMC for strongly log-concave target distribution. It preserves the linear dependence on the step size, but it also considers the spectrum of the Hessian. For the example of spiked Gaussian model, the bound has a clear improvement.
Critical strengths
I do not find any error in the proof, and the final bound has an improvement over prior work.
Critical weaknesses
-
The technical novelty of the paper is limited.
-
A comprehensive discussion of the literature has not been included, thus it’s unclear whether the improvement is significant or not.
-
The insight of the paper is limited. It only provides the proof, rather than the insightful reasoning behind the mathematical derivations.
-
(Minor) The writing style of the paper (especially the introduction) is more like a note, rather than an academic paper.
Questions for authors
See weaknesses
3 comments
I politely disagree with the authors on the response. As the ability of AI has been mentioned in the general response, I'd like also to share my opinions on the paper writing of AI era.
In my understanding, a good theoretical paper should have (not limited to) some good properties
- Solving a important or difficult research problem that the community cares about and is working on
- Inventing some new proof techniques that can be applied in many other problems.
- Providing insights for new problems or practice
Since the authors already claim that what is important is "human-written papers that offer clear, accessible, and easy-to-understand insights", this contradicts with the current sloppy version with only the "elegant" proof. Since AI can already generate lengthy research paper, proof is getting cheaper. You cannot write something randomly and "hope" readers can learn something from it.
Thus, it's necessary to show why the problem matters, and how you managed to prove the results. This does not require citing all of the "hundreds of papers on Langevin-related sampling", but the current version, even is not clear what is the literature, without a section of related work. Without those, it's even hard to understand why you study that upper bound.
Finally, I apologize for critizing on the "note" style. As I wrote, it is only a minor issue. A paper can have lots of writing styles, including what you want. However, the writing issues persist. Therefore, I decide to keep my score.
reply
Thank you for your reply and for sharing your views on this important question: what makes a good article in the age of LLMs? I agree with the three criteria you mentioned for defining a good theoretical article, although I wouldn’t necessarily emphasise the difficulty aspect in the first criterion. These three criteria define a good article not only in the age of LLMs, but they were also valid before this.
As regards the sloppy version of my article and the fact that it contains random elements, I shall take your comments on board. I hope not all readers will share this view, but if I receive further comments of a similar nature, I shall rewrite the article. I have just reread the introduction to my article, and I believe it clearly explains why we are studying the upper bound. We have not devoted a separate section to the links with previous work, since they are detailed in the introduction and in Table 1.
Answer to the review
Thank you for reading and evaluating my paper. As noted in my general response above, the main criticisms in your review largely stem from the stylistic choices I deliberately made for this manuscript. Below are some additional responses.
Discussion of prior work: I believe that all relevant work that may help contextualize our result is cited and discussed. There are hundreds of papers on Langevin-related sampling algorithms, and it would be impossible to be exhaustive. If some papers are not cited, it is because we found that mentioning them was of limited relevance. As in the example of the paper by Freund et al. suggested by Reviewer 1oRw, discussed in my answer above, its main bound is looser than the bound in Durmus et al. (2019). Since that paper was published later and its main result directly relevant to our work is looser, I felt this was a valid reason not to feel obliged to cite it. That said, if you feel that some papers not currently discussed deserve discussion, I would be glad to add them in the revised version.
Limited insight: The proof of the main result is so short and elegant that I felt it would be of limited use to provide a lengthy discussion of it. I wanted to keep the focus squarely on that elegant proof. I hope that many readers will draw useful insights from it.