- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This work introduces a novel sampling method for Wasserstein gradient flows. The existing standard discretization scheme, JKO, has a slow convergence rate for non-strongly log-concave density functions. AIGF can improve this convergence rate using a Nesterov-style momentum on the density. However, this method can not leverage the well-posedness of the JKO proximal step. In this paper, the authors discretize the AIGF momentum dynamics while keeping the well-posed benefit. The authors implement two variants, A-JKO, including extrapolation, proximal, and momentum steps, and IA-JKO, an implicit version of A-JKO by optimizing a single proximal update and incorporating momentum. Then, the authors train a flow-based neural sampler with an offline matching loss, derived from the proposed discretization schemes. The authors test their approaches on both synthetic and real-world problems, which show promising results.
Critical strengths
- The paper is nicely written. The authors make a significant effort to present relevant literature, background, and their research question. Their contributions are clearly presented. In addition, the paper is quite theoretical; however, the authors successfully highlight their main results. Their proofs are complete. Overall, I really enjoyed reading the paper.
Critical weaknesses
-
I would suggest that the authors visualize sampled distributions in the peptides experiment to better illustrate their results and comparisons with baselines.
-
In lines 170-175, the authors might need to motivate why we need discretization schemes for gradient flows.
-
In Section 5, there might be no need for a subsection since there is only one.
Questions for authors
-
Could the authors explain more clearly the well-posed benefit of the standard JKO scheme?
-
Could the authors clearly explain their off-policy matching loss objective? It seems that the neural sampler is trained with an off-policy matching loss using the original JKO optimality condition. Is it the optimality of the standard JKO? How does the neural sampler relate to accelerated JKO schemes?
-
In Preliminaries, could the authors show how the Wasserstein-2 distance (line 129) is used to construct the accelerated gradient flow?
-
In Table 2, why does flow sampling perform better than the proposed JKO schemes?
-
For a single proximal update, the method requires a learned velocity vector field ; does the method require multiple velocity models for the whole trajectory of multiple steps? Would the proposed sampling approach be expensive compared to conditional flow sampling?
I do not have strong expertise in this area, so my technical comments remain limited. But I hope the authors can make their work more accessible to novice readers.