- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies following problem of optimizing the choice of interpolating curves in the context of flow matching. Given a probability density path and a mimicking field , one says that a family of interpolating curves belongs if minimizing the flow-matching objective induces . The question addressed here is how to choose optimally in such a way that, if we minimize the flow matching objective using stochastic gradient descent, then the number of iterations it takes to achieve a given precision is the smallest possible. One of the main results consists in a full solution to this problem in the case when $v(\theta,x)= \theta x $ and the data distribution $ p^{data} $ is a centered Guassian with arbitrary variance. For general distributions, the main contribution is to formulate the problem as an expectation minimization task with explicit objective. The constraint is described through a set of differential inequalities.
Critical strengths
- The paper opens the discussion on an interesting problem that might be of practical relevance.
- Explicit solution in a toy Gaussian example with explicit characterization. Moreover, the authors convincingly explain that choosing different can lead to substantial difference on the SGD performance.
- The general formulation of the problem does not admit a closed form solution, but it admits a clean interpretation and can be tackled numerically
Critical weaknesses
-
The depth of the theoretical result is limited. In fact, only the Gaussian example is analyzed. Though I agree that the general case is intractable, one would like to see that the theoretical analysis extends, possibly in a weaker form, to other target data distributions such as log-concave laws for example. Appendix K contains a study of Gaussian mixtures, but the conclusion seems to be that there exists no optimal g in this case, if I understand correctly.
-
The description of in terms of differential inequalities is nice, but requires priori knowledge of some . Showing that such exists, or exhibiting one, appears to be a non trivial problem. This limits the applicability of Theorem 4.3.
Questions for authors
-
The solution to the quadratic problem defining the conditional velocity field in flow matching is given in terms of a conditional expectation. I would have expected conditional expectation to be a useful tool in the description of the admissible set . Can the authors comment on why this is not the case?
-
Can one expect problem (FEASIBLEPATHOPTθ) to admit an optimal solution? The Gaussian mixture example seems to suggest that this may fail even in simple settings.