- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces RW-Flow, which extends W-Flow for learning one-step flow matching methods on Riemannian manifolds. The method is motivated by the question of when a vanishing Sinkhorn divergence induced velocity field shows that the model distribution can match the target. They find that this can be achieved by the nondegeneracy of the Gibbs kernel. They then use this to investigate spectral and distance costs of the squared geodesic cost.nts, showing the limitations.
They evaluate their method on modeling Riemannian manifolds, such as the sphere, protein/RNA angles on tori, and triangular meshes. RW-Flow seems competitive with other Riemannian Generative Model baselines.
Critical strengths
- I think this paper investigates an interesting question. Understanding when a vanishing velocity field matches the target distribution is an important problem, especially for modeling distributions on Riemannian spaces. The connection to the Gibbs kernel and the analysis of different cost families make the theoretical part substantial and useful.
- The experimental part covers a bunch of Riemannian datasets and supports the theoretical result. It shows that the proposed method is comparable to baselines.
Critical weaknesses
- I wonder if there could be more detailed comparisons of training overhead, inference latency, and geometry costs against other methods; for example, Algo 1 uses two minibatch Sinkhorn calculations, and the spectral variants additionally require evaluating spectral kernels and their gradients.
- I also suggest including more figures, e.g., some teaser figures to show the motivation and the overall framework of the method; this could help readers understand.
Questions for authors
- Could you include the per-update training time and GPU memory usage, comparing RW-Flow with other methods, such as GFM RMF baselines?
- For the spectral variants, especially on meshes, what preprocessing is required? How much time and memory does it use, and can it be reused across runs?
- Can you provide head-to-head comparisons on sampling latency with other few step generation baselines ?
2 comments
I appreciate the authors’ response and their careful answers to my questions. I will keep my positive score.
Rebuttal
We thank the reviewer for their time and feedback. We have added per-update training time, GPU memory, sampling latency and mesh preprocessing cost, with comparisons to the other baselines. We answer each question below.
Q1, Q3. Head-to-head comparisons of training costs and sampling latency
In the table below, we include the per-update training time, GPU memory usage, sampling latency, along with other methods on the Earth Fire dataset. As shown, the training time for our RW-Flow is comparable to RMF and faster than the best performing GFM baseline (GFM Lagrangian). Sampling latencies of all methods are around the same at 1 NFE.
Q2. Preprocessing costs
Our method requires an one-time mesh preprocessing step that computes the first 1,000 eigenfunctions. Once a mesh has been preprocessed, the result can be reused across all subsequent runs. For the Spot (cow) mesh, this step takes about 20 seconds and 500 MB of GPU memory. The other manifolds do not require such preprocessing since the eigenfunctions on those surfaces are explicitly available.
Since the eigenfunctions are piecewise linear on the mesh, their gradients are constant on each face and precomputed in closed form, so the kernel gradient is computed analytically, without automatic differentiation, and adds negligible compute to training.
Conclusion
We hope these additions address the reviewer's questions about cost. We plan to add a teaser figure in the camera-ready version. We are happy to discuss further.