- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The authors propose that lower order moments hinder generative models from modelling stochastically drifting higher order statistics. They show that decoupling the lower- and higher order moments is possible without conflicting pushforward consistency during flow matching. Empirical results show improvements over chosen baselines when separately modeling the first two moments using an iTransformer and MLPs and the residual using conditional flow matching.
Critical strengths
- The paper demonstrates a clear improvement on modeling lower and higher order statistics (Figure 2b).
- The method is simple, fast, and shows good performance against the chosen baselines.
Critical weaknesses
While the central idea is intuitive, the paper hides that behind complicated and dense phrasing.
- The introduction uses non-standard terminology compared to the field, but makes no attempt at introducing it, or guiding the reader into the terminology used throughout.
- Section 4.3 seems disconnected from the rest of the paper and has no clear embedding in the story.
- A discussion of the method and its limitations is only partially included, but would help to put the method into perspective.
The categories of macroscopic drifts and microscopic stochasic dynamics seems strange. The distinction suggests differences in their drifting behaviour, but is claimed not to be different in lines 144/145. What are then the differences and why are those differences important for the method at all?
Section 4.3: The proof sketch is really hard to parse given that the terminology is poorly introduced, and a full proof would be greatly beneficial.
Minor:
- Lines 298, 301: is not introduced before its use. Connection to Wasserstein distance can be made only because it is mentioned once in line 74.
- Eq.3/6 : is used in Eq. 3, but only introduced after Eq. 6, is not introduced at all
- Line 122/123: refering to the shape of a distribution as its topology is imprecise
- Given the main contribution of this work, I would expect a more detailed description of how to train the network predicting the mean and scale without consulting the codebase.
- Formatting below table 2
- Formatting appendix F - it appears to be empty
- Line 826: D$^3$U is not bold
Questions for authors
- Theorem 1 begins with "For almost every context x", but never clarifies which contexts are not covered by the theorem. Is this a typo, or can you clarify for which contexts this theorem holds?