- Rating
- 3
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a high-accuracy parallel diffusion sampling algorithm with theoretical guarantees. By combining FORS with the existing parallel sampling method of Anari et al. and introducing an additional mechanism (causal guard), the authors achieve nearly linear query complexity and square-root adaptive depth.
Critical strengths
This paper addresses an important limitation of the existing parallel sampling method (Anari et al.), namely, the polynomial dependence of the expected query complexity on the accuracy parameter .
Critical weaknesses
- It is unclear whether the proposed algorithm can reduce inference time in practical settings.
- The proposed algorithm lacks experimental validation.
Questions for authors
No questions.
Score updated
As reflected in my confidence rating, I do not work directly on the topic of this paper. Having read the discussion with Reviewer n4Do, I am lowering my score to 2 for now. I would welcome the authors’ response to the points raised in my review and will reconsider my score in light of it.